Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
On the size of a finite vacant cluster of random interlacements with small intensity
Download PDF
Download PDF
  • Published: 16 March 2010

On the size of a finite vacant cluster of random interlacements with small intensity

  • Augusto Teixeira1 

Probability Theory and Related Fields volume 150, pages 529–574 (2011)Cite this article

Abstract

In this paper, we establish some properties of percolation for the vacant set of random interlacements, for d ≥ 5 and small intensity u. The model of random interlacements was first introduced by Sznitman in (Ann Math, arXiv:0704.2560, 2010). It is known that, for small u, almost surely there is a unique infinite connected component in the vacant set left by the random interlacements at level u, see Sidoravicius and Sznitman (Commun Pure Appl Math 62(6):831–858, 2009) and Teixeira (Ann Appl Probab 19(1):454–466, 2009). We estimate here the distribution of the diameter and the volume of the vacant component at level u containing the origin, given that it is finite. This comes as a by-product of our main theorem, which proves a stretched exponential bound on the probability that the interlacement set separates two macroscopic connected sets in a large cube. As another application, we show that with high probability, the unique infinite connected component of the vacant set is “ubiquitous” in large neighborhoods of the origin.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Benjamini I., Sznitman A.S.: Giant component and vacant set for random walk on a discrete torus. J. Eur. Math. Soc. 10(1), 1–40 (2008)

    MathSciNet  Google Scholar 

  2. Dembo A., Sznitman A.S.: On the disconnection of a discrete cylinder by a random walk. Probab. Theory Relat. Fields 136(2), 321–340 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dembo, A., Sznitman, A.S.: A lower bound on the disconnection time of a discrete cylinder. Progress in Probability, vol. 60. In and Out of Equilibrium 2, pp. 211–227. Birkhäuser, Basel (2008)

  4. Deuschel J.-D., Pisztora A.: Surface order large deviations for high-density. Probab. Theory Relat. Fields 104, 467–482 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Erdös P., Taylor S.J.: Some intersection properties of random walk paths. Acta Math. Acad. Sci. Hungar. 11, 231–248 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  6. Grigoryan A., Telcs A.: Sub-Gaussian estimates of heat kernels on infinite graphs. Duke Math. J. 109(3), 451–510 (2001)

    Article  MathSciNet  Google Scholar 

  7. Grimmett G.: Percolation, 2nd edn. Springer, New York (1999)

    MATH  Google Scholar 

  8. Kesten, H.: Aspects of first passage percolation, Ecole d’été de probabilité de Saint-Flour XIV-1984, pp. 125–264. Lecture Notes in Mathematics, vol. 1180. Springer, New York (1986)

  9. Lawler G.F.: Intersections of Random Walks. Birkhäuser, Basel (1991)

    Google Scholar 

  10. Lawler G.F.: Cut times for simple random walk. Elect. J. Probab. 1, 1–24 (1996)

    MATH  Google Scholar 

  11. McDiarmid, C.: Concentration. Probabilistic methods for algorithmic discrete mathematics, pp. 195–248, Algorithms Combin., 16. Springer, Berlin (1998)

  12. Resnick S.I.: Extreme Values, Regular Variation and Point Processes. Springer, Berlin (1987)

    MATH  Google Scholar 

  13. Sidoravicius V., Sznitman A.S.: Percolation for the vacant set of random interlacements. Comm. Pure Appl. Math. 62(6), 831–858 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sznitman, A.S.: Vacant set of random interlacements and percolation. Ann. Math., arXiv:0704.2560 (2010, to appear)

  15. Sznitman A.S.: Random walks on discrete cylinders and random interlacements. Probab. Theory Relat. Fields 145, 143–174 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sznitman A.S.: Upper bound on the disconnection time of discrete cylinders and random interlacements. Ann. Probab. 37(5), 1715–1746 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sznitman A.S.: On the domination of random walk on a discrete cylinder by random interlacements. Elect. J. Probab. 14, 1670–1704 (2009)

    MathSciNet  MATH  Google Scholar 

  18. Teixeira A.Q.: On the uniqueness of the infinite cluster of the vacant set of random interlacements. Ann. Appl. Probab. 19(1), 454–466 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Windisch D.: On the disconnection of a discrete cylinder by a biased random walk. Ann. Appl. Probab. 18(4), 1441–1490 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  20. Windisch D.: Random walk on a discrete torus and random interlacements. Elect. Commun. Probab. 13, 140–150 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, ETH, 8092, Zurich, Switzerland

    Augusto Teixeira

Authors
  1. Augusto Teixeira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Augusto Teixeira.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Teixeira, A. On the size of a finite vacant cluster of random interlacements with small intensity. Probab. Theory Relat. Fields 150, 529–574 (2011). https://doi.org/10.1007/s00440-010-0283-x

Download citation

  • Received: 21 April 2009

  • Revised: 24 February 2010

  • Published: 16 March 2010

  • Issue Date: August 2011

  • DOI: https://doi.org/10.1007/s00440-010-0283-x

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Mathematics Subject Classification (2000)

  • 60K35
  • 82C41
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature