betaFeedback

WorksMathematics

No percolation at criticality on quasi-transitive graphs

Abstract

We prove that critical Bernoulli bond percolation has no infinite cluster on any infinite connected locally finite quasi-transitive graph with critical probability less than one. This resolves the bond form of the criticality conjecture of Benjamini and Schramm.

Introduction

Bernoulli bond percolation on an undirected graph G=(V,E)G=(V,E) retains each edge independently with probability p∈[0,1]p \in[0,1]. Retained edges are called open. The open cluster CxC_x of a vertex xx consists of the vertices joined to xx by finite open paths, including xx itself. Write x↔Ax \leftrightarrow A when CxC_x meets a set A⊆VA \subseteq V, and x↔yx \leftrightarrow y when y∈Cxy \in C_x. With Pp\mathbb{P}_p denoting the product law, the critical probability is

pc(G)=inf⁡{p∈[0,1]:Pp(there is an infinite open cluster)>0}.p_c(G)=\inf\{p \in[0,1] : \mathbb{P}_p(\text{there is an infinite open cluster})>0\}.

A graph is quasi-transitive if its automorphism group has finitely many orbits on vertices. This includes every vertex-transitive graph and every Cayley graph of a finitely generated group with a finite generating set.

The criticality problem asks whether an infinite cluster can first appear at the threshold itself. Benjamini and Schramm formulated the general quasi-transitive conjecture in their systematic study of percolation beyond Euclidean lattices [3].

Theorem 1.1. Let GG be an infinite connected locally finite quasi-transitive undirected graph. If pc(G)<1p_c(G)<1, then

Ppc(G)(there is an infinite open cluster)=0.\mathbb{P}_{p_c(G)}(\text{there is an infinite open cluster})=0.

Equivalently, Ppc(G)(∣Cx∣=∞)=0\mathbb{P}_{p_c(G)}(|C_x|=\infty)=0 for every vertex xx.

Theorem 1.1 resolves the Benjamini–Schramm criticality conjecture positively for Bernoulli bond percolation. Its conclusion concerns all vertex orbits. The hypothesis pc<1p_c<1 is necessary: at parameter one every edge is open, so an infinite connected graph percolates. In particular, the theorem includes nearest-neighbor bond percolation on Zd\mathbb{Z}^d for every d≥2d \ge2; see Corollary 10.1.

The two subexponential arguments

For a vertex xx, let B(x,r)B(x,r) be the graph-distance ball of integer radius rr. Put V−(r)=min⁡x∣B(x,r)∣V_-(r)=\min_x |B(x,r)| and V+(r)=max⁡x∣B(x,r)∣V_+(r)=\max_x |B(x,r)|. Quasi-transitivity makes these extrema finite and compares them up to a bounded shift of rr. It also implies that V+(r)1/rV_+(r)^{1/r} has a limit. A limit greater than one is the exponential case covered by Hutchcroft. In the other case, the proof divides according to the following exhaustive alternatives:

  • (i) log⁡V−(r)/log⁡r→∞\log V_{-}(r)/\log r \to\infty;

  • (ii) V−(r)≤rdV_{-}(r) \leq r^{d} along an unbounded sequence of radii, for some fixed finite dd.

This division requires no classification of intermediate growth.

In case (i), suppose that an infinite cluster occurs at pcp_c. At a slightly smaller parameter, large finite clusters still occur with probability bounded away from zero. The volume growth then places two distinct large clusters within a distance that is small on the logarithmic scale of their sizes. Repeatedly bisecting a path between them produces a single adjacent pair. Each bisection adds at most one cluster and one possible connecting edge. We choose these edges using the decrease in a search’s conditional success probability, and control the total cost by relative entropy. Section 3 establishes the search and entropy estimates. Sections 4 and 5 show that the resulting adjacent pair contradicts the bound in Proposition 3.1: across a fixed edge, distinct clusters each of size at least ss occur with probability at most Cs−1/2Cs^{-1/2}.

In case (ii), we apply the finitary structure theorem of Tessera and Tointon [30] (Corollary 2.4) to an auxiliary vertex-transitive graph. Lifting its quotient action to GG and passing to a finite-index subgroup gives a finitely generated nilpotent quotient and a kernel with finite vertex orbits. Section 7 uses an induction on the number of infinite cyclic factors in a chosen series of that group. The one-dimensional case has pc=1p_c = 1. Otherwise there are two integer coordinates on vertices that change by a fixed translation under each group element. The induction excludes an infinite open ray whose two coordinates both remain bounded.

Under the assumed critical percolation, uniqueness and this exclusion produce two high-probability approximate moves in linearly independent coordinate directions in Section 8. After rescaling, the moves advance by (1,1)(1,1) and (1,−1)(1,-1), with arbitrarily small edge steps. They persist at a parameter below pcp_c. In Section 9, we place corridors in these coordinates, with intersections confined to their common end regions. The joint gluing inequality (Theorem 6.1) transfers connections through each fresh corridor: reaching a relay set whose vertices have uniformly high target probabilities gives a high conditional chance of continuing to the target. Finally an adaptive exploration keeps the conditional chance of failure small at every tested site. A planar boundary count gives positive probability of infinitely many successful sites, hence an infinite open cluster below pcp_c. All paths and all revealed edges belong to GG; the quotient supplies coordinates for this construction.

Percolation was introduced by Broadbent and Hammersley [6]. For nearest-neighbor bond percolation on Zd\mathbb{Z}^{d}, planar methods established critical nonpercolation in dimension two [17, 21]. The lace expansion gave the result in sufficiently high dimensions [16], and Fitzner and van der Hofstad obtained it for d≥11d \geq11 [13]. The sharpness theorems of Aizenman–Barsky and Menshikov describe the subcritical regime [1, 26]; they do not by themselves settle the behavior at the threshold.

Beyond lattices, Benjamini, Lyons, Peres, and Schramm proved critical nonpercolation for nonamenable graphs admitting a unimodular quasi-transitive action [4]. Timár excluded infinitely many infinite critical clusters on transitive nonunimodular graphs [31], leaving the possibility of a unique infinite cluster. Hutchcroft excluded all infinite critical clusters on every quasi-transitive graph of exponential growth [19], Theorem 1.2; we use that entire theorem. Hermon and Hutchcroft treated unimodular quasi-transitive graphs satisfying a uniform stretched-exponential return-probability bound with exponent greater than 1/21/2 [18], Theorem 1.2). The two arguments above cover the remaining subexponential case.

Our joint gluing theorem also has a finite-graph and lattice history that is distinct from the general quasi-transitive conclusion. Kozma and Nitzan conjectured the multiplicative connection inequality [22] and showed that their weaker uniform near-one gluing Conjecture 3 implies critical nonpercolation on Zd\mathbb{Z}^d for every d≥2d \ge2 [22]. Leder’s public account reports a Lean formalization of that lattice conclusion and displays the first-contact comparison (GEN) [23]. Although the account does not claim Conjecture 1, (GEN) implies the finite joint inequality: take its increasing cluster functional to be the indicator of meeting the target and bound the resulting weighted mean by its minimum. The subsequent public manuscript [8] explicitly records this consequence and stronger finite connection comparisons. Its public site-percolation extension [7] treats independent labelled hyperedges and critical site percolation on Zd\mathbb{Z}^d for d≥3d \ge3. We give a direct joint-gluing proof with this antecedent credit. These finite and lattice results do not assert Theorem 1.1 for general quasi-transitive graphs.

The probabilistic tools are developed with their local predecessors at their points of use. The adjacent-cluster bound adapts the boundary-discrepancy method of Aizenman, Kesten, and Newman [2] and Hutchcroft’s ghost-field formulation [20]. Conditional association was developed by van den Berg and Kahn [34]; alternating conditional-cluster resampling is the method of van den Berg, Häggström, and Kahn [35]. Decision-tree inequalities [12, 28] provide related links between exploration and pivotality; here the local estimate uses the martingale of conditional connection probabilities. The entropy bound accommodates adaptive read sets whose overlap is controlled only under a comparison law, beyond the fixed-set setting of Shearer’s inequality and its relative-entropy forms [9, 24].

The geometric construction adapts the seed and adaptive-block strategy of Grimmett and Marstrand [14] and the fresh-collar and stored-prediction arguments of Kozma and Nitzan [22]. Critical extinction in each fixed slab [11] does not alone give the full-lattice conclusion. Choosing useful directions by exit probabilities is related to Martineau and Tassion’s parallelogram construction [25]. Here the two-direction argument and the conditional-failure boundary count are carried out on the original graph, including when the reveal domains are countable.

The structural reduction runs from Gromov’s polynomial-growth theorem [15] through Trofimov’s graph and near-polynomial-growth theorems [32, 33] to Tessera and Tointon’s one-scale theorem [30], Corollary 2.4. The latter develops the approximate-group method of Breuillard, Green, and Tao [5] and supplies the quotient action and stabilizer information used here. Related nilpotent quotients occur in percolation locality on polynomial-growth graphs [10]. In this paper the quotient supplies coordinates; every connection and exposure uses original edges.

Uniformity and the growth alternatives

We record the reductions needed to use finite arguments uniformly on the infinite graph. Graph distance always counts edges. Unless specified otherwise, balls are induced subgraphs as well as vertex sets. The maximum degree is denoted by DD.

Graph conventions and the threshold

It suffices to prove Theorem 1.1 for simple graphs. Indeed, loops have no effect on clusters. If parallel edges occur, subdivide each edge once, using a distinct new vertex for each edge. The resulting graph is simple and remains connected and locally finite. There are finitely many edge orbits, since there are finitely many vertex orbits and each representative has finite degree. Lifting the original automorphisms therefore proves quasi-transitivity of the subdivided graph. At parameter tt, each original edge is fully traversable with probability t2t^2, independently of the others. An infinite cluster in the subdivided graph contains infinitely many original vertices, by local finiteness. Thus percolation on it occurs exactly when the effective configuration on the original graph percolates, and its critical probability is pc(G)\sqrt{p_c(G)}. The simple-graph conclusion at this parameter gives the desired conclusion on GG.

Henceforth the infinite graph is simple. Finite auxiliary graphs may have parallel edges after contractions. Local finiteness and connectedness imply countability. Finitely many vertex orbits imply D<∞D < \infty. For p<1/Dp < 1/D, the probability of an open simple path of length nn starting at xx is at most DnpnD^n p^n, which tends to zero. An infinite cluster would contain such a path for every nn, so

pc≥1/D>0.(1)p_c \ge1/D > 0. \tag*{(1)}

The event that some infinite cluster exists is unchanged by altering finitely many edge states: adding finitely many edges joins only finitely many clusters, and deleting finitely many edges splits an infinite cluster into finitely many pieces. It is therefore a tail event and has probability zero or one. Monotonicity in pp shows that our definition of pcp_c agrees with the supremum of the parameters at which almost surely every cluster is finite. In particular all clusters are finite almost surely for p<pcp < p_c.

We use Harris’s inequality: increasing functions of independent edge states have nonnegative covariance [17]. For finitely many bits, this follows by induction from the covariance decomposition after conditioning on one bit; the two conditional means are themselves increasing. For bounded functions of countably many bits, conditional expectations on finite sets of coordinates and martingale convergence give the same conclusion. Decreasing functions are likewise positively correlated; an increasing and a decreasing function are negatively correlated.

If critical percolation occurs with positive probability, countability gives a vertex xx with Ppc(∣Cx∣=∞)>0\mathbb{P}_{p_c}(|C_x| = \infty) > 0. For a fixed path from yy to xx, Harris’s inequality bounds Ppc(∣Cy∣=∞)\mathbb{P}_{p_c}(|C_y| = \infty) below by this positive probability times pcp_c to the path length. Finitely many vertex orbits then give

θ:=min⁡x∈VPpc(∣Cx∣=∞)>0.(2)\theta:= \min_{x \in V} \mathbb{P}_{p_c}(|C_x| = \infty) > 0. \tag*{(2)}

This uniform lower bound is the contradiction hypothesis in both subexponential arguments.

Ball comparisons

Lemma 2.1. There is an integer C0C_0 such that every vertex orbit meets every ball of radius C0C_0. Moreover, for nonnegative integer radii,

V+(r)≤V−(r+C0),V+(r+s)≤V+(r)V+(s).(3)V_+(r) \le V_-(r + C_0), \qquad V_+(r+s) \le V_+(r)V_+(s). \tag*{(3)}

The limit γ=lim⁡r→∞V+(r)1/r\gamma= \lim_{r \to\infty} V_+(r)^{1/r} exists. If γ>1\gamma> 1, every vertex ball has exponential growth; if γ=1\gamma= 1, then log⁡V+(r)=o(r)\log V_+(r) = o(r).

Proof. Choose a representative in each of the finitely many orbits. For each representative and each orbit, fix a path to that orbit, and let C0C_0 bound the lengths of these finitely many paths. Translating them proves the density assertion. To compare balls, move the center of a ball attaining V+(r)V_+(r) within distance C0C_0 of a center attaining V−(r+C0)V_-(r+C_0). The translated smaller ball lies in the larger one. Also B(x,r+s)B(x,r+s) is covered by the radius-ss balls centered in B(x,r)B(x,r), proving the second inequality.

Thus log⁡V+(r)\log V_+(r) is subadditive. Dividing a radius into blocks of any fixed length shows that its quotient by rr converges to its infimum. This proves existence of γ\gamma. Finally V+(r−C0)≤∣B(x,r)∣≤V+(r)V_+(r-C_0) \le|B(x,r)| \le V_+(r) for r≥C0r \ge C_0 gives the claimed uniform growth conclusions. ∎

We now invoke precisely the following external result.

Theorem 2.2 (Hutchcroft [19], Theorem 1.2). If a connected locally finite quasi-transitive graph satisfies lim inf⁡r→∞∣B(x,r)∣1/r>1\liminf_{r \to\infty} |B(x,r)|^{1/r} > 1, then it has almost surely no infinite Bernoulli bond cluster at its critical probability.

It remains to work under log⁡V+(r)=o(r)\log V_{+}(r) = o(r). Either

log⁡V−(r)log⁡r⟶∞,(4)\frac{\log V_{-}(r)}{\log r} \longrightarrow\infty, \tag*{(4)}

or this quotient is bounded along an unbounded sequence of integer radii. In the latter case there is a finite dd such that

V−(r)≤rdalong that sequence.(5)V_{-}(r) \le r^{d} \quad\text{along that sequence}. \tag*{(5)}

These alternatives are exhaustive, including when the quotient oscillates.

Exact clusters and finite witnesses

Conditioning on the exact vertex set of a cluster fixes its boundary edges closed and imposes only an internal connectivity condition. Consequently the edges induced outside that set keep their product law. Revealing every incident edge, including internal edges, has the same property. We will specify which of these two exposures is being used.

The event ∣Cx∣≥s|C_x| \ge s, for a fixed positive integer ss, can be witnessed inside B(x,s−1)B(x,s-1): a connected cluster of at least ss vertices contains a connected set of ss vertices containing xx. Its probability is therefore continuous in pp. A connection between fixed finite sets is the increasing union of connections in finite induced subgraphs. Its probability can be approximated from below by such finite events, at the same parameter pp. These observations also apply uniformly to finitely many vertex or pair orbits.

Two clusters, depth-first search, and entropy

The interpolation argument will join clusters along a short path while controlling the change in probability. We prepare its three inputs: a bound on adjacent large distinct clusters, a second-moment estimate for depth-first pivotal edges, and an entropy bound for several explorations of the same configuration.

Adjacent large distinct clusters

For an edge e=xye = xy and an integer s≥1s \ge1, write

Hs(e)={Cx≠Cy, ∣Cx∣≥s, ∣Cy∣≥s}.H_s(e) = \{C_x \ne C_y,\ |C_x| \ge s,\ |C_y| \ge s\}.

Cluster size means the number of vertices. The next estimate is uniform over the edges, including those in different automorphism orbits. Its proof adapts the cluster-boundary discrepancy argument of Aizenman, Kesten, and Newman [2] and Hutchcroft’s ghost-field and martingale formulation [20]. We give the finite-graph averaging argument and its quasi-transitive passage explicitly.

Proposition 3.1. Let GG be an infinite connected locally finite quasi-transitive graph of subexponential growth. For every p∗>0p_* > 0 there is C<∞C < \infty such that

Pp(Hs(e))≤Cs−1/2(e∈E(G), s≥1, p∗≤p<1).\mathbb{P}_p(H_s(e)) \le Cs^{-1/2} \qquad(e \in E(G),\ s \ge1,\ p_* \le p < 1).

The constant may depend on GG and p∗p_*.

Proof. Let DD bound the degrees of GG. We first prove an averaged estimate on any finite induced subgraph FF. Independently of the edge states, mark each vertex with probability 1−e−h1-e^{-h}, where 0<h≤10 < h \le1. Let TeT_e be the event that the endpoints of ee lie in distinct clusters both containing a mark. Let NeN_e count the marked clusters incident to ee, counting a cluster only once even when it contains both endpoints, and put Ie=1{Ne≥1}I_e = 1_{\{N_e \ge1\}}. Flipping ee does not change the union of its endpoint clusters, so IeI_e is unchanged by that flip. For closed ee, 1Te=Ne−Ie1_{T_e} = N_e-I_e, whereas for open ee, Ne=IeN_e=I_e. With q=1−pq=1-p, conditioning on all other edges therefore gives

References

  1. [1]Michael Aizenman and David J. Barsky. Sharpness of the phase transition in percolation models. Communications in Mathematical Physics, 108(3):489–526, 1987. doi: 10.1007/BF01212322.DOI
  2. [2]Michael Aizenman, Harry Kesten, and Charles M. Newman. Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation. Communications in Mathematical Physics, 111(4):505–531, 1987. doi: 10.1007/BF01219071. URL https://link.springer.com/article/10.1007/BF01219071.DOI
  3. [3]Itai Benjamini and Oded Schramm. Percolation beyond Z^d, many questions and a few answers. Electronic Communications in Probability, 1:71–82, 1996. doi: 10.1214/ECP.v1-978. URL https://emis.de/ft/41630.DOI
  4. [4]Itai Benjamini, Russell Lyons, Yuval Peres, and Oded Schramm. Critical percolation on any nonamenable group has no infinite clusters. The Annals of Probability, 27(3):1347–1356, 1999. doi: 10.1214/aop/1022677450.DOI
  5. [5]Emmanuel Breuillard, Ben Green, and Terence Tao. The structure of approximate groups. Publications Mathématiques de l’IHÉS, 116:115–221, 2012. doi: 10.1007/s10240-012-0043-9. URL https://arxiv.org/abs/1110.5008.
  6. [6]S. R. Broadbent and J. M. Hammersley. Percolation processes. I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society, 53(3):629–641, 1957. doi: 10.1017/S0305004100032680.
  7. [7]ChatGPT 5.6. Percolation at criticality, September 2026. URL https://nitromannitol.github.io/site-percolation-7d3f2/. With Claude Opus 5 and GLM 5.3 support; prompted by Ahmed Bou-Rabee. Public exposition and Lean development, September 5, 2026.
  8. [8]ChatGPT 5.6 Sol and Claude Fable 5.1. Kozma–Nitzan connection inequalities for Bernoulli percolation, September 2026. URL https://nitromannitol.github.io/kn1-verification-b80e9/document/kn_summary.pdf. Prompted by Ahmed Bou-Rabee; public manuscript, updated September 5, 2026.
  9. [9]F. R. K. Chung, R. L. Graham, P. Frankl, and J. B. Shearer. Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory, Series A, 43(1):23–37, 1986. doi: 10.1016/0097-3165(86)90019-1.
  10. [10]Daniel Contreras, Sébastien Martineau, and Vincent Tassion. Locality of percolation for graphs with polynomial growth. Electronic Communications in Probability, 28(1):1–9, 2023. doi: 10.1214/22-ECP508. URL https://doi.org/10.1214/22-ECP508.
  11. [11]Hugo Duminil-Copin, Vladas Sidoravicius, and Vincent Tassion. Absence of infinite cluster for critical Bernoulli percolation on slabs. Communications on Pure and Applied Mathematics, 69(7):1397–1411, 2016. doi: 10.1002/cpa.21641.
  12. [12]Hugo Duminil-Copin, Aran Raoufi, and Vincent Tassion. Sharp phase transition for the random-cluster and Potts models via decision trees. Annals of Mathematics, 189(1):75–99, 2019. doi: 10.4007/annals.2019.189.1.2.
  13. [13]Robert Fitzner and Remco van der Hofstad. Mean-field behavior for nearest-neighbor percolation in d > 10. Electronic Journal of Probability, 22:1–65, 2017. doi: 10.1214/17-EJP56. URL https://arxiv.org/abs/1506.07977. Paper No. 43.
  14. [14]G. R. Grimmett and J. M. Marstrand. The supercritical phase of percolation is well behaved. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 430 (1879):439–457, 1990. doi: 10.1098/rspa.1990.0100. URL https://doi.org/10.1098/rspa.1990.0100.
  15. [15]Mikhael Gromov. Groups of polynomial growth and expanding maps. Publications Mathématiques de l’IHÉS, 53:53–78, 1981. doi: 10.1007/BF02698687. URL https://www.numdam.org/item/PMIHES_1981__53__53_0/. With an appendix by Jacques Tits.
  16. [16]Takashi Hara and Gordon Slade. Mean-field critical behaviour for percolation in high dimensions. Communications in Mathematical Physics, 128(2):333–391, 1990. doi: 10.1007/BF02108785.DOI
  17. [17]Theodore E. Harris. A lower bound for the critical probability in a certain percolation process. Proceedings of the Cambridge Philosophical Society, 56(1):13–20, 1960. doi: 10.1017/S0305004100034241.DOI
  18. [18]Jonathan Hermon and Tom Hutchcroft. No percolation at criticality on certain groups of intermediate growth. International Mathematics Research Notices, 2021(22):17433–17455, 2021. doi: 10.1093/imrn/rnz265. URL https://arxiv.org/abs/1809.11112v2.
  19. [19]Tom Hutchcroft. Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters. Comptes Rendus. Mathématique, 354(9):944–947, 2016. doi: 10.1016/j.crma.2016.07.013. URL https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2016.07.013/.DOI
  20. [20]Tom Hutchcroft. Locality of the critical probability for transitive graphs of exponential growth. The Annals of Probability, 48(3):1352–1371, 2020. doi: 10.1214/19-AOP1395. URL https://arxiv.org/abs/1808.08940v2.
  21. [21]Harry Kesten. The critical probability of bond percolation on the square lattice equals 1/2. Communications in Mathematical Physics, 74(1):41–59, 1980. doi: 10.1007/BF01197577.DOI
  22. [22]Gady Kozma and Shahaf Nitzan. A reduction of the θ(p_c) = 0 problem to a conjectured inequality, 2024. URL https://arxiv.org/abs/2401.12397v1.
  23. [23]Justin Leder. θ(p_c) = 0 for Bernoulli bond percolation on Z^d in all dimensions d ≥ 2: A guide to the Lean formalization. Public research announcement, August 2026. URL https://github.com/anthropics/formal-math/blob/795efb86f191735c5481675763537cfb4ff37e55/percolation/summary.pdf.
  24. [24]Mokshay Madiman and Prasad Tetali. Information inequalities for joint distributions, with interpretations and applications. IEEE Transactions on Information Theory, 56(6):2699–2713, 2010. doi: 10.1109/TIT.2010.2046253.DOI
  25. [25]Sébastien Martineau and Vincent Tassion. Locality of percolation for Abelian Cayley graphs. The Annals of Probability, 45(2):1247–1277, 2017. doi: 10.1214/15-AOP1086. URL https://doi.org/10.1214/15-AOP1086.
  26. [26]M. V. Men’shikov. Coincidence of critical points in percolation problems. Doklady Akademii Nauk SSSR, 288(6):1308–1311, 1986. URL https://www.mathnet.ru/eng/dan8543. English translation: Soviet Mathematics Doklady 33 (1986), 856–859.
  27. [27]National Institute of Standards and Technology. NIST Digital Library of Mathematical Functions. https://dlmf.nist.gov/, 2026. Version 1.2.8, released September 15, 2026; Tables 18.3.1 and 18.6.1; accessed September 24, 2026.
  28. [28]Ryan O’Donnell, Michael Saks, Oded Schramm, and Rocco A. Servedio. Every decision tree has an influential variable. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 31–39. IEEE Computer Society, 2005. doi: 10.1109/SFCS.2005.34.
  29. [29]Derek J. S. Robinson. A Course in the Theory of Groups, volume 80 of Graduate Texts in Mathematics. Springer, New York, 2 edition, 1996. doi: 10.1007/978-1-4419-8594-1.DOI
  30. [30]Romain Tessera and Matthew C. H. Tointon. A finitary structure theorem for vertex-transitive graphs of polynomial growth. Combinatorica, 41:263–298, 2021. doi: 10.1007/s00493-020-4295-6. URL https://arxiv.org/abs/1908.06044v3.
  31. [31]Ádám Timár. Percolation on nonunimodular transitive graphs. The Annals of Probability, 34 (6):2344–2364, 2006. doi: 10.1214/009117906000000494.DOI
  32. [32]V. I. Trofimov. Graphs with polynomial growth. Mathematics of the USSR-Sbornik, 51(2):405–417, 1985. doi: 10.1070/SM1985v051n02ABEH002866. URL https://www.mathnet.ru/eng/sm2028. English translation of Matematicheskii Sbornik 123(165) (1984), 407–421.DOI
  33. [33]V. I. Trofimov. Undirected and directed graphs with near polynomial growth. Discussiones Mathematicae Graph Theory, 23(2):383–391, 2003. doi: 10.7151/dmgt.1208. URL https://eudml.org/doc/270249.DOI
  34. [34]J. van den Berg and J. Kahn. A correlation inequality for connection events in percolation. The Annals of Probability, 29(1):123–126, 2001. doi: 10.1214/aop/1008956324. URL https://doi.org/10.1214/aop/1008956324.
  35. [35]J. van den Berg, O. Häggström, and J. Kahn. Some conditional correlation inequalities for percolation and related processes. Random Structures & Algorithms, 29:417–435, 2006. doi: 10.1002/rsa.20102. URL https://arxiv.org/abs/math/0408176.

Paper details

vlnc:W_zykqrbxe
Version
v1 · latest
Published
License
LicenseRef-OpenAI-public
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

unreleased internal OpenAI model

View statement
Looking for related papers…
Contents