English
Related papers

Related papers: Indistinguishability for recurrent clusters

200 papers

For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…

Probability · Mathematics 2025-10-15 Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

Probability · Mathematics 2014-04-30 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta

We describe the rings of invariants for the finite orthogonal groups of plus type in odd characteristic acting on the defining representations. We also describe the invariants of the corresponding Sylow subgroups in the defining…

Commutative Algebra · Mathematics 2026-03-12 H. E. A. Campbell , R. James Shank , David L. Wehlau

We consider the Boolean model with random radii based on Cox point processes. Under a condition of stabilization for the random environment, we establish existence and non-existence of subcritical regimes for the size of the cluster at the…

Probability · Mathematics 2020-05-26 Benedikt Jahnel , András Tóbiás , Elie Cali

We consider a stationary and ergodic random field {\omega(b)} parameterized by the family of bonds b in Z^d, d>1. The random variable \omega(b) is thought of as the conductance of bond b and it ranges in a finite interval [0,c_0]. Assuming…

Probability · Mathematics 2008-09-16 A. Faggionato

A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees,…

Probability · Mathematics 2021-05-27 Gabriel Berzunza , Xing Shi Cai , Cecilia Holmgren

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

Probability · Mathematics 2008-04-26 Jozsef Balogh , Yuval Peres , Gabor Pete

We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…

Spectral Theory · Mathematics 2026-02-11 Charles Bordenave , Cyril Letrouit , Mostafa Sabri

The aim of this paper is to underline the relation between reversible growth processes and invariant percolation. We present two models of interacting branching random walks (BRWs), truncated BRWs and competing BRWs, where survival of the…

Probability · Mathematics 2015-01-20 Sebastian Müller

A statistical description of heavy particles suspended in incompressible rough self-similar flows is developed. It is shown that, differently from smooth flows, particles do not form fractal clusters. They rather distribute inhomogeneously…

Chaotic Dynamics · Physics 2007-05-23 J. Bec , M. Cencini , R. Hillerbrand

When there is no independence, abnormal observations may have a tendency to appear in clusters instead of scattered along the time frame. Identifying clusters and estimating their size are important problems arising in statistics of…

Probability · Mathematics 2020-01-08 Miguel Abadi , Ana Cristina Moreira Freitas , Jorge Milhazes Freitas

The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows to find the critical threshold and the size of the giant component. Numerical simulations…

Disordered Systems and Neural Networks · Physics 2009-11-11 M. Angeles Serrano , Marian Boguna

The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…

Statistical Mechanics · Physics 2009-11-07 Santo Fortunato

Cluster concepts have been extremely useful in elucidating many problems in physics. Percolation theory provides a generic framework to study the behavior of the cluster distribution. In most cases the theory predicts a geometrical…

Statistical Mechanics · Physics 2016-09-15 Antonio Coniglio , Annalisa Fierro

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…

Combinatorics · Mathematics 2020-05-11 Adam Timar

Call a percolation process on edges of a graph change intolerant if the status of each edge is almost surely determined by the status of the other edges. We give necessary and sufficient conditions for change intolerance of the wired…

Probability · Mathematics 2007-05-23 Deborah Heicklen , Russell Lyons

Despite a long history and a clear overall understanding of properties of random walks on an incipient infinite cluster in percolation, some important information on it seems to be missing in the literature. In the present work, we revisit…

Statistical Mechanics · Physics 2022-08-24 Adrian Pacheco-Pozo , Igor M. Sokolov

We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…

Probability · Mathematics 2025-06-10 Chenlin Gu , Wenhao Zhao

In the present paper, we give a certain condition on subgroups of the group representation of the Cayley tree such that an invariance property holds. Except for the given condition, we show that the invariance property does not hold.

Functional Analysis · Mathematics 2019-10-31 U. A. Rozikov , F. H. Haydarov

We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the…

Probability · Mathematics 2025-10-29 Alessandra Faggionato , Ivailo Hartarsky
‹ Prev 1 8 9 10 Next ›