English

Truncated long-range percolation on oriented graphs

Probability 2016-06-22 v1

Abstract

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.

Keywords

Cite

@article{arxiv.1509.02042,
  title  = {Truncated long-range percolation on oriented graphs},
  author = {Aernout C. D. van Enter and Bernardo N. B. de Lima and Daniel Valesin},
  journal= {arXiv preprint arXiv:1509.02042},
  year   = {2016}
}

Comments

9 pages, 1 figure

R2 v1 2026-06-22T10:50:46.664Z