We prove that the value of the critical probability for percolation on an abelian Cayley graph is determined by its local structure. This is a partial positive answer to a conjecture of Schramm: the function pc defined on the set of Cayley graphs of abelian groups of rank at least 2 is continuous for the Benjamini-Schramm topology. The proof involves group-theoretic tools and a new block argument.
We show that for any Cayley graph, the probability (at any p) that the cluster of the origin has siz...
This thesis is part of the mathematical study of percolation theory, which includes a family of mode...
AbstractLet G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolat...
Let {Gn}∞n=1 be a sequence of transitive infinite connected graphs with sup n≥1 pc(Gn) < 1, where...
Abstract. In percolation theory the critical probability P, ( G) of an infinite connected graph G i...
. It is shown that, for site percolation on the Cayley graph of a co-compact Fuchsian group of genus...
A comprehensive study of percolation in a more general context than the usual Z d setting is propose...
This thesis deals with two kinds of statistical mechanics problems: percolation ongroups and directe...
This thesis deals with two kinds of statistical mechanics problems: percolation ongroups and directe...
Funder: University of CambridgeAbstract: Let G be a connected, locally finite, transitive graph, and...
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered pr...
Abstract: We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-tran...
We prove that the set of possible values for the percolation threshold p꜀ of Cayley graphs has a gap...
By means of a well-developed method in self-organized criticality, we can obtain the lower bound for...
We show that for any Cayley graph, the probability (at any p) that the cluster of the originhas size...
We show that for any Cayley graph, the probability (at any p) that the cluster of the origin has siz...
This thesis is part of the mathematical study of percolation theory, which includes a family of mode...
AbstractLet G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolat...
Let {Gn}∞n=1 be a sequence of transitive infinite connected graphs with sup n≥1 pc(Gn) < 1, where...
Abstract. In percolation theory the critical probability P, ( G) of an infinite connected graph G i...
. It is shown that, for site percolation on the Cayley graph of a co-compact Fuchsian group of genus...
A comprehensive study of percolation in a more general context than the usual Z d setting is propose...
This thesis deals with two kinds of statistical mechanics problems: percolation ongroups and directe...
This thesis deals with two kinds of statistical mechanics problems: percolation ongroups and directe...
Funder: University of CambridgeAbstract: Let G be a connected, locally finite, transitive graph, and...
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered pr...
Abstract: We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-tran...
We prove that the set of possible values for the percolation threshold p꜀ of Cayley graphs has a gap...
By means of a well-developed method in self-organized criticality, we can obtain the lower bound for...
We show that for any Cayley graph, the probability (at any p) that the cluster of the originhas size...
We show that for any Cayley graph, the probability (at any p) that the cluster of the origin has siz...
This thesis is part of the mathematical study of percolation theory, which includes a family of mode...
AbstractLet G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolat...