中文
相关论文

相关论文: One-point boundaries of ends of clusters in percol…

200 篇论文

I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals. It is known…

概率论 · 数学 2012-12-11 Jan Czajkowski

We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical…

概率论 · 数学 2022-02-14 Yinshan Chang

In this thesis, I am going to consider Bernoulli percolation on graphs admitting vertex-transitive actions of groups of isometries of d-dimensional hyperbolic spaces H^d. In the first chapter, I give an overview concerning percolation and…

概率论 · 数学 2015-04-14 Jan Czajkowski

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

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

概率论 · 数学 2024-03-13 Philip Easo

We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.

概率论 · 数学 2026-03-17 Pablo A. Gomes , Alan Pereira , Remy Sanchis

Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large…

概率论 · 数学 2021-01-26 Gábor Pete , Ádám Timár

We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs…

概率论 · 数学 2016-08-14 Adám Timár

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

概率论 · 数学 2020-08-12 Agelos Georgakopoulos , John Haslegrave

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

概率论 · 数学 2020-10-06 Jonathan Hermon , Tom Hutchcroft

Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…

We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…

概率论 · 数学 2022-03-07 Zhongyang Li

We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…

概率论 · 数学 2022-07-13 Tom Hutchcroft

We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…

概率论 · 数学 2016-08-15 Gabor Pete

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

数学物理 · 物理学 2016-10-18 Kathleen E. Hamilton , Leonid P. Pryadko

We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

概率论 · 数学 2021-06-09 Olivier Garet , Régine Marchand

We consider the standard model of i.i.d. bond percolation on $\mathbb Z^d$ of parameter $p$. When $p>p_c$, there exists almost surely a unique infinite cluster $\mathcal C_p$. Using the recent techniques of Cerf and Dembin, we prove that…

概率论 · 数学 2022-03-03 Barbara Dembin

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…

概率论 · 数学 2020-02-26 Tom Hutchcroft

We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…

概率论 · 数学 2025-01-03 Pablo A. Gomes , Alan Pereira , Remy Sanchis

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
‹ 上一页 1 2 3 10 下一页 ›