Truncated Long-Range Percolation on Oriented Graphs
- 97 Downloads
We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented bonds are open; assuming that the sum of these probabilities is infinite, we ask if the probability of percolation is positive when we truncate the graph, disallowing bonds of range above a possibly large but finite threshold. We give some conditions in which the answer is affirmative. We also translate some of our results on oriented percolation to the context of a long-range contact process.
KeywordsContact processes Oriented percolation Long-range percolation Truncation
Mathematics Subject Classification60K35 82B43
This work was done during B.N.B.L.’s sabbatical stay at IMPA; he would like to thank Rijksuniversiteit Groningen and IMPA for their hospitality. The research of B.N.B.L. was supported in part by CNPq and FAPEMIG (Programa Pesquisador Mineiro).
- 1.Aizenman, M., Duminil-Copin, H., Sidoravicius, V.: Random currents and continuity of Ising model’s spontaneous magnetization. Commun. Math. Phys. 334(2), 719–742 (2013)Google Scholar
- 18.Slade, G., The lace expansion and its applications. Lectures from the 34th Summer School on Probability Theory held in Saint-Flour, July 624 (2004)Google Scholar