Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 98 tok/s Pro
Kimi K2 226 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Non-uniqueness and mean-field criticality for percolation on nonunimodular transitive graphs (1711.02590v3)

Published 7 Nov 2017 in math.PR, math-ph, and math.MP

Abstract: We study Bernoulli bond percolation on nonunimodular quasi-transitive graphs, and more generally graphs whose automorphism group has a nonunimodular quasi-transitive subgroup. We prove that percolation on any such graph has a non-empty phase in which there are infinite light clusters, which implies the existence of a non-empty phase in which there are infinitely many infinite clusters. That is, we show that $p_c<p_h \leq p_u$ for any such graph. This answers a question of Haggstrom, Peres, and Schonmann (1999), and verifies the nonunimodular case of a well-known conjecture of Benjamini and Schramm (1996). We also prove that the triangle condition holds at criticality on any such graph, which implies that various critical exponents exist and take their mean-field values. All our results apply, for example, to the product $T_k\times \mathbb{Z}d$ of a $k$-regular tree with $\mathbb{Z}d$ for $k\geq 3$ and $d \geq 1$, for which these results were previously known only for large $k$. Furthermore, our methods also enable us to establish the basic topological features of the phase diagram for anisotropic percolation on such products, in which tree edges and $\mathbb{Z}d$ edges are given different retention probabilities. These features had only previously been established for $d=1$, $k$ large.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)