arXiv Analytics

Sign in

arXiv:1111.2449 [math.PR]AbstractReferencesReviewsResources

Brownian Web and Oriented Percolation: Density Bounds

Anish Sarkar, Rongfeng Sun

Published 2011-11-10Version 1

In a recent work, we proved that under diffusive scaling, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2 converges in distribution to the Brownian web. In that proof, the FKG inequality played an important role in establishing a density bound, which is a part of the convergence criterion for the Brownian web formulated by Fontes et al (2004). In this note, we illustrate how an alternative convergence criterion formulated by Newman et al (2005) can be verified in this case, which involves a dual density bound that can be established without using the FKG inequality. This alternative approach is in some sense more robust. We will also show that the spatial density of the collection of rightmost infinite open paths starting at time 0 decays asymptotically in time as c/\sqrt{t} for some c>0.

Comments: 12 pages. This is a proceeding article for the RIMS workshop "Applications of Renormalization Group Methods in Mathematical Sciences", held at Kyoto University from September 12th to 14th, 2011. Submitted to the RIMS Kokyuroku series
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:math/0203184 [math.PR] (Published 2002-03-19, updated 2002-04-23)
The Brownian Web
arXiv:2408.13796 [math.PR] (Published 2024-08-25)
The game behind oriented percolation
arXiv:math/0311254 [math.PR] (Published 2003-11-15, updated 2005-04-06)
The Brownian web: Characterization and convergence