English
Related papers

Related papers: Sharpness of the percolation phase transition for …

200 papers

We study families of dependent site percolation models on the triangular lattice ${\mathbb T}$ and hexagonal lattice ${\mathbb H}$ that arise by applying certain cellular automata to independent percolation configurations. We analyze the…

Probability · Mathematics 2009-11-10 Federico Camia , Charles M. Newman , Vladas Sidoravicius

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett

In clean and weakly disordered systems, topological and trivial phases having a finite bulk energy gap can transit to each other via a quantum critical point. In presence of strong disorder, both the nature of the phases and the associated…

Disordered Systems and Neural Networks · Physics 2025-06-26 Saikat Mondal , Adhip Agarwala

We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…

Statistical Mechanics · Physics 2009-11-07 Róbert Juhász , Ferenc Iglói

We develop techniques to study the phase transition for planar Gaussian percolation models that are not (necessarily) positively correlated. These models lack the property of positive associations (also known as the `FKG inequality'), and…

Probability · Mathematics 2023-07-18 Stephen Muirhead , Alejandro Rivera , Hugo Vanneuville , Laurin Köhler-Schindler

A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…

Statistical Mechanics · Physics 2012-12-11 Stephan Mertens , Cristopher Moore

The vacant set of random interlacements at level $u>0$, introduced in arXiv:0704.2560, is a percolation model on $\mathbb{Z}^d$, $d \geq 3$ which arises as the set of sites avoided by a Poissonian cloud of doubly infinite trajectories,…

Probability · Mathematics 2015-01-23 Balazs Rath

We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…

Probability · Mathematics 2019-07-08 Alain-Sol Sznitman

We analyse the cluster discovered by invasion percolation on a branching process with a power-law offspring distribution. Invasion percolation is a paradigm model of self-organised criticality, where criticality is approached without tuning…

Probability · Mathematics 2023-11-20 Rowel Gündlach , Remco van der Hofstad

Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…

Disordered Systems and Neural Networks · Physics 2019-12-25 Ginestra Bianconi , Ivan Kryven , Robert M. Ziff

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…

Mathematical Physics · Physics 2016-10-18 Kathleen E. Hamilton , Leonid P. Pryadko

We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…

Statistical Mechanics · Physics 2026-05-19 Qi Wang , Ming Li

We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In this model, the underlying graph is an oriented rooted tree in which each vertex points to each of its $d$ children with `short' edges, and…

Probability · Mathematics 2021-03-10 Bernardo N. B. de Lima , Réka Szabó , Daniel Valesin

We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infinite third moment. The scaling limit of the critical…

Probability · Mathematics 2022-07-18 Shankar Bhamidi , Souvik Dhara , Remco van der Hofstad , Sanchayan Sen

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these…

Probability · Mathematics 2017-06-05 Li Li

We study percolation transition of run and tumble particles (RTPs) on a two dimensional square lattice. RTPs in these models run to the nearest neighbour along their internal orientation with unit rate, and to other nearest neighbours with…

Statistical Mechanics · Physics 2024-12-30 Soumya K. Saha , Aikya Banerjee , P. K. Mohanty

We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…

Probability · Mathematics 2021-07-30 Balazs Rath , Daniel Valesin

We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…

Statistical Mechanics · Physics 2007-05-23 S. K. Nechaev , O. A. Vasilyev

Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…

Probability · Mathematics 2026-05-15 Diana De Armas Bellon , Matthew I. Roberts