中文
相关论文

相关论文: Concentration estimates for the isoperimetric cons…

200 篇论文

We study the isoperimetric subgraphs of the giant component $\textbf{C}_n$ of supercritical bond percolation on the square lattice. These are subgraphs of $\textbf{C}_n$ having minimal edge boundary to volume ratio. In contrast to the work…

概率论 · 数学 2016-11-02 Julian Gold

We study the isoperimetric subgraphs of the infinite cluster $\textbf{C}_\infty$ for supercritical bond percolation on $\mathbb{Z}^d$ with $d\geq 3$. Specifically, we consider the subgraphs of $\textbf{C}_\infty \cap [-n,n]^d$ which have…

概率论 · 数学 2017-10-30 Julian Gold

We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $\Phi(n)$, where $\Phi$ is the isoperimetric function…

We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…

概率论 · 数学 2007-07-24 Asaf Nachmias , Yuval Peres

Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…

概率论 · 数学 2018-10-29 Barbara Dembin

We consider the unique infinite connected component of supercritical bond percolation on the square lattice and study the geometric properties of isoperimetric sets, i.e., sets with minimal boundary for a given volume. For almost every…

概率论 · 数学 2016-05-13 Marek Biskup , Oren Louidor , Eviatar B. Procaccia , Ron Rosenthal

We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…

概率论 · 数学 2007-08-21 Lung-Chi Chen , Akira Sakai

The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$…

统计力学 · 物理学 2009-10-31 Martin Z. Bazant

Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…

概率论 · 数学 2024-03-12 Philip Easo , Tom Hutchcroft

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

概率论 · 数学 2025-12-23 Arthur Blanc-Renaudie , Asaf Nachmias

We obtain a new lower bound of 0.06576 for the 1-entanglement critical probability (in dimension 3), and prove that the critical point for the existence of a sphere surrounding the origin and intersecting only closed bonds in $\mathbb{Z}^d$…

概率论 · 数学 2021-12-08 Olivier Couronné

We apply the critical geometry approach for bounded critical phenomena [1] to $3d$ percolation. The functional shape of the order parameter profile $\phi$ is related via the fractional Yamabe equation to its scaling dimension…

统计力学 · 物理学 2021-10-27 Alessandro Galvani , Andrea Trombettoni , Giacomo Gori

We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…

组合数学 · 数学 2026-03-20 Sahar Diskin , Michael Krivelevich , Itay Markbreit

Isoperimetric profile describes the minimal boundary size of a set with a prescribed volume. Itai Benjamini conjectured that the isoperimetric profile of the giant component in supercritical percolation experiences an averaging effect and…

概率论 · 数学 2023-09-27 Christian Hirsch , Kyeongsik Nam

We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…

组合数学 · 数学 2021-03-08 Femke van Ieperen , Ivan Kryven

We prove that the results regarding the Isoperimetric inequality and Cheeger constant formulated in terms of the Minkowski content, obtained by the authors in previous papers in the framework of essentially non-branching metric measure…

度量几何 · 数学 2019-05-08 Fabio Cavalletti , Andrea Mondino

We study percolation as a critical phenomenon on a multifractal support. The scaling exponents of the the infinite cluster size ($\beta$ exponent) and the fractal dimension of the percolation cluster ($d_f$) are quantities that seem do not…

统计力学 · 物理学 2007-05-23 J. E. Freitas , G. Corso , L. S. Lucena

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

组合数学 · 数学 2024-09-10 Sahar Diskin , Michael Krivelevich

We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to…

概率论 · 数学 2007-05-23 Noam Berger , Marek Biskup

We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…

概率论 · 数学 2025-11-13 Shirshendu Chatterjee , Pranav Chinmay , Jack Hanson , Philippe Sosoe
‹ 上一页 1 2 3 10 下一页 ›