Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Existence of Hydrodynamics for the Totally Asymmetric Simple K-Exclusion Process

Timo Seppalainen
The Annals of Probability
Vol. 27, No. 1 (Jan., 1999), pp. 361-415
Stable URL: http://www.jstor.org/stable/2652879
Page Count: 55
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available

Abstract

In a totally asymmetric simple K-exclusion process, particles take nearest-neighbor steps to the right on the lattice Z, under the constraint that each site contain at most K particles. We prove that such processes satisfy hydrodynamic limits under Euler scaling, and that the limit of the empirical particle profile is the entropy solution of a scalar conservation law with a concave flux function. Our technique requires no knowledge of the invariant measures of the process, which is essential because the equilibria of asymmetric K-exclusion are unknown. But we cannot calculate the flux function precisely. The proof proceeds via a coupling with a growth model on the two-dimensional lattice. In addition to the basic K-exclusion with constant exponential jump rates, we treat the site-disordered case where each site has its own jump rate, randomly chosen but frozen for all time. The hydrodynamic limit under site disorder is new even for the simple exclusion process (the case K = 1). Our proof makes no use of the Markov property, so at the end of the paper we indicate how to treat the case with arbitrary waiting times.

Page Thumbnails

  • Thumbnail: Page 
361
    361
  • Thumbnail: Page 
362
    362
  • Thumbnail: Page 
363
    363
  • Thumbnail: Page 
364
    364
  • Thumbnail: Page 
365
    365
  • Thumbnail: Page 
366
    366
  • Thumbnail: Page 
367
    367
  • Thumbnail: Page 
368
    368
  • Thumbnail: Page 
369
    369
  • Thumbnail: Page 
370
    370
  • Thumbnail: Page 
371
    371
  • Thumbnail: Page 
372
    372
  • Thumbnail: Page 
373
    373
  • Thumbnail: Page 
374
    374
  • Thumbnail: Page 
375
    375
  • Thumbnail: Page 
376
    376
  • Thumbnail: Page 
377
    377
  • Thumbnail: Page 
378
    378
  • Thumbnail: Page 
379
    379
  • Thumbnail: Page 
380
    380
  • Thumbnail: Page 
381
    381
  • Thumbnail: Page 
382
    382
  • Thumbnail: Page 
383
    383
  • Thumbnail: Page 
384
    384
  • Thumbnail: Page 
385
    385
  • Thumbnail: Page 
386
    386
  • Thumbnail: Page 
387
    387
  • Thumbnail: Page 
388
    388
  • Thumbnail: Page 
389
    389
  • Thumbnail: Page 
390
    390
  • Thumbnail: Page 
391
    391
  • Thumbnail: Page 
392
    392
  • Thumbnail: Page 
393
    393
  • Thumbnail: Page 
394
    394
  • Thumbnail: Page 
395
    395
  • Thumbnail: Page 
396
    396
  • Thumbnail: Page 
397
    397
  • Thumbnail: Page 
398
    398
  • Thumbnail: Page 
399
    399
  • Thumbnail: Page 
400
    400
  • Thumbnail: Page 
401
    401
  • Thumbnail: Page 
402
    402
  • Thumbnail: Page 
403
    403
  • Thumbnail: Page 
404
    404
  • Thumbnail: Page 
405
    405
  • Thumbnail: Page 
406
    406
  • Thumbnail: Page 
407
    407
  • Thumbnail: Page 
408
    408
  • Thumbnail: Page 
409
    409
  • Thumbnail: Page 
410
    410
  • Thumbnail: Page 
411
    411
  • Thumbnail: Page 
412
    412
  • Thumbnail: Page 
413
    413
  • Thumbnail: Page 
414
    414
  • Thumbnail: Page 
415
    415