arXiv Analytics

Sign in

arXiv:1506.05868 [math.PR]AbstractReferencesReviewsResources

Enlargement of subgraphs of infinite graphs by Bernoulli percolation

Kazuki Okamura

Published 2015-06-19Version 1

We consider changes of properties of subgraphs of an infinite graph if we enlarge the subgraphs by adding Bernoulli percolation on the infinite graph to them. We give a pair of an infinite graph, a subgraph of it, and, a property. Then, we can define two "critical probabilities" of the pair, in the same manner as the (ordinal) critical probability is defined. We focus on the following cases that a property is being a transient subgraph, having finitely many or no cut points, being a recurrent subset, and, being connected. We compare the two critical probabilities with the critical probability. Our results depend heavily on a choice of a pair of an infinite graph, a subgraph of it, and, a property.

Related articles: Most relevant | Search more
arXiv:1611.08549 [math.PR] (Published 2016-11-25)
On the critical probability in percolation
arXiv:2405.07345 [math.PR] (Published 2024-05-12)
Critical probabilities for positively associated, finite-range dependent percolation models
arXiv:2205.02734 [math.PR] (Published 2022-05-05)
Percolation critical probabilities of matching lattice-pairs