Enlargement of subgraphs of infinite graphs by Bernoulli percolation

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Okamura, Kazuki
Format: Preprint
Veröffentlicht: 2015
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910147253633024
author Okamura, Kazuki
author_facet Okamura, Kazuki
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_1506_05868
institution arXiv
publishDate 2015
record_format arxiv
spellingShingle Enlargement of subgraphs of infinite graphs by Bernoulli percolation
Okamura, Kazuki
Probability
60K35, 82B41, 82B43, 05C63, 05C80, 05C81
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.
title Enlargement of subgraphs of infinite graphs by Bernoulli percolation
topic Probability
60K35, 82B41, 82B43, 05C63, 05C80, 05C81
url https://arxiv.org/abs/1506.05868