Enlargement of subgraphs of infinite graphs by Bernoulli percolation

DOI10.1016/J.INDAG.2017.06.005zbMATH Open1367.05147arXiv1506.05868OpenAlexW3104930818MaRDI QIDQ2012573FDOQ2012573

Authors: Kazuki Okamura 

Publication date: 1 August 2017

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Abstract: We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs, and a property of the subgraphs. Then, in a manner similar to the way Hammersley's critical probability is defined, we can define two values associated with the triplet. We regard the two values as certain critical probabilities, and compare them with Hammersley's critical probability. In this paper, we focus on the following cases of a graph property: being a transient subgraph, having finitely many cut points or no cut points, being a recurrent subset, or being connected. Our results depend heavily on the choice of the triplet. Most results of this paper are announced in cite{O16} without proofs. This paper gives full details of them.

Full work available at URL: https://arxiv.org/abs/1506.05868

Recommendations

• Enlargement of subgraphs of infinite graphs by Bernoulli percolation: a summary
• Infinite graphs with a nontrivial Bond percolation threshold: some sufficient conditions
• scientific article; zbMATH DE number 3919519
• scientific article; zbMATH DE number 4091541
• Percolation on finite graphs and isoperimetric inequalities.

zbMATH Keywords

Bernoulli percolationcritical probabilitytransient graphs

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

Cites Work

• Graph theory
• Percolation
• Random walk: A modern introduction
• Random Walks on Infinite Graphs and Groups
• Probability on trees and networks
• Intersections of random walks.
• Gaussian estimates for Markov chains and random walks on groups
• Percolation in the hyperbolic plane
• Density and uniqueness in percolation
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sub-Gaussian estimates of heat kernels on infinite graphs
• Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation
• Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
• Recurrence of random walk traces
• Random walk on the infinite cluster of the percolation model
• Nearest-neighbor walks with low predictability profile and percolation in \(2+\varepsilon\) dimensions
• On the effect of adding \(\epsilon\)-Bernoulli percolation to everywhere percolating subgraphs of \({\mathbb{Z}}^d\)
• Mean-field behavior for nearest-neighbor percolation in \(d>10\)
• When are random graphs connected
• Homogenization via sprinkling
• Enlargement of subgraphs of infinite graphs by Bernoulli percolation: a summary

Cited In (5)

• On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
• Enlargement of subgraphs of infinite graphs by Bernoulli percolation: a summary
• On the effect of adding \(\epsilon\)-Bernoulli percolation to everywhere percolating subgraphs of \({\mathbb{Z}}^d\)
• Max-linear models in random environment
• Unions of random walk and percolation on infinite graphs

This page was built for publication: Enlargement of subgraphs of infinite graphs by Bernoulli percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012573)