Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Spread-out percolation on transitive graphs of polynomial growth (2404.17262v2)

Published 26 Apr 2024 in math.PR, math.CO, and math.GR

Abstract: Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in $G$. We show that the critical probability $p_c(G_r)$ for Bernoulli bond percolation on $G_r$ satisfies $p_c(G_r) \sim 1/\mathrm{deg}(G_r)$ as $r\to\infty$. This extends work of Penrose and Bollob\'as-Janson-Riordan, who considered the case $G=\mathbb{Z}d$. Our result provides an important ingredient in parallel work of Georgakopoulos in which he introduces a new notion of dimension in groups. It also verifies a special case of a conjecture of Easo and Hutchcroft.

Citations (2)

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

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

Collections

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 3 posts and received 0 likes.