English
Related papers

Related papers: Percolation transition for random forests in $d\ge…

200 papers

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

Probability · Mathematics 2020-03-16 Laurent Ménard , Arvind Singh

Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…

Probability · Mathematics 2016-05-11 Jacob van den Berg , Demeter Kiss , Pierre Nolin

We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional…

Probability · Mathematics 2019-09-05 Angelo Abächerli , Jiří Černý

For the Gaussian free field on a $(d + 1)$-regular tree with $d \geq 2$, we study the percolative properties of its level sets in the critical and the near-critical regime. In particular, we show the continuity of the percolation…

Probability · Mathematics 2023-02-07 Jiří Černý , Ramon Locher

The percolation of Potts spins with equal values in Potts model on graphs (networks) is considered. The general method for finding the Potts clusters size distributions is developed. It allows for full description of percolation transition…

Statistical Mechanics · Physics 2020-08-20 P. N. Timonin

Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…

Probability · Mathematics 2013-04-09 Béla Bollobás , Karen Gunderson , Cecilia Holmgren , Svante Janson , Michał Przykucki

We present Monte Carlo simulations of the spanning-forest model (q \to 0 limit of the ferromagnetic Potts model) in spatial dimensions d=3,4,5. We show that, in contrast to the two-dimensional case, the model has a "ferromagnetic"…

Statistical Mechanics · Physics 2008-11-26 Youjin Deng , Timothy M. Garoni , Alan D. Sokal

The forest fire model is a reaction-diffusion model where energy, in the form of trees, is injected uniformly, and burned (dissipated) locally. We show that the spatial distribution of fires forms a novel geometric structure where the…

Statistical Mechanics · Physics 2009-10-31 Kan Chen , Per Bak

Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…

Probability · Mathematics 2023-05-22 Matthew Junge , Zoe McDonald , Jean Pulla , Lily Reeves

We study the bond percolation game and the site percolation game on the rooted Galton-Watson tree $T_{\chi}$ with offspring distribution $\chi$. We obtain the probabilities of win, loss and draw for each player in terms of the fixed points…

Probability · Mathematics 2023-05-09 Sayar Karmakar , Moumanti Podder , Souvik Roy , Soumyarup Sadhukhan

We study several statistical mechanical models on a general tree. Particular attention is devoted to the classical Heisenberg models, where the state space is the d-dimensional unit sphere and the interactions are proportional to the…

Probability · Mathematics 2016-09-07 Robin Pemantle , Jeffrey E. Steif

The voter model on $\mathbb{Z}^d$ is a particle system that serves as a rough model for changes of opinions among social agents or, alternatively, competition between biological species occupying space. When $d \geq 3$, the set of…

Probability · Mathematics 2016-02-19 Balazs Rath , Daniel Valesin

Fixing $\beta \ge 0$ and an integer $q \ge 2$, consider the ferromagnetic $q$-Potts measures $\mu_n^{\beta,B}$ on finite graphs ${\sf G}_n$ on $n$ vertices, with external field strength $B \ge 0$ and the corresponding random cluster…

Probability · Mathematics 2025-05-22 Anirban Basak , Amir Dembo , Allan Sly

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

Probability · Mathematics 2021-11-02 Rémy Sanchis , Diogo C. dos Santos , Roger W. C. Silva

We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…

Astrophysics · Physics 2009-10-31 Stephane Colombi , Dmitry Pogosyan , Tarun Souradeep

We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…

Probability · Mathematics 2018-03-28 Cristian F. Coletti , R. J. Gava , Pablo M. Rodriguez

We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…

Probability · Mathematics 2016-12-28 Erich Baur

We investigate level-set percolation of the Gaussian free field on transient trees, for instance on super-critical Galton-Watson trees conditioned on non-extinction. Recently developed Dynkin-type isomorphism theorems provide a comparison…

Probability · Mathematics 2018-02-23 Angelo Abächerli , Alain-Sol Sznitman

In the ordered phase of the 3D Ising model, minority spin clusters are surrounded by a boundary of dual plaquettes. As the temperature is raised, these spin clusters become more numerous, and it is found that eventually their boundaries…

Statistical Mechanics · Physics 2023-05-03 Michael Grady

We consider invasion percolation on the randomly-weighted complete graph $K_n$, started from some number $k(n)$ of distinct source vertices. The outcome of the process is a forest consisting of $k(n)$ trees, each containing exactly one…

Probability · Mathematics 2022-08-16 Louigi Addario-Berry , Jordan Barrett