Related papers: Sharp metastability transition for two-dimensional…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^d$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,\dots,…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…
Answering questions of Itai Benjamini, we show that the event of complete occupation in 2-neighbour bootstrap percolation on the d-dimensional box [n]^d, for d\geq 2, at its critical initial density p_c(n), is noise sensitive, while in…
This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimensional Hamming torus where each node is open with probability $p$ and the percolation threshold is 2. For each $d'<d$ we find the critical exponent…
Consider a graph $G$ and an initial random configuration, where each node is black with probability $p$ and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least $r$ black neighbors and white…
Based on extensive simulations, we conjecture that critically pinned interfaces in 2-dimensional isotropic random media with short range correlations are always in the universality class of ordinary percolation. Thus, in contrast to…
We propose and study a one-dimensional $2\times 2$ hyperbolic Eulerian system with local relaxation from critical threshold phenomena perspective. The system features dynamic transition between strictly and weakly hyperbolic. For different…
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…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of…
In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture…
The reformulation of the mode-coupling theory (MCT) of the liquid-glass transition which incorporates the element of metastability is applied to the hard-sphere system. It is shown that the glass transition in this system is not a sharp one…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
The rigidity transition occurs when, as the density of microscopic components is increased, a disordered medium becomes able to transmit and ensure macroscopic mechanical stability, owing to the appearance of a space-spanning rigid…
We describe a new method for constraining Laplacian spectra of hyperbolic surfaces and 2-orbifolds. The main ingredient is consistency of the spectral decomposition of integrals of products of four automorphic forms. Using a combination of…
The isotropic-to-nematic transition in a two-dimensional fluid of hard needles is studied using grand canonical Monte Carlo simulations, multiple histogram reweighting, and finite size scaling. The transition is shown to be of the…
We report the phase diagram of two-dimensional hard ellipses as obtained from replica exchange Monte Carlo simulations. The replica exchange is implemented by expanding the isobaric ensemble in pressure. The phase diagram shows four…
In a previous work [Dillon and Nakanishi, Eur. Phys.J B {\bf 87}, 286 (2014)], we calculated the transmission coefficient of the two-dimensional quantum percolation model and found there to be three regimes, namely, exponentially localized,…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
In the modified bootstrap percolation model, sites in the cube {1,...,L}^d are initially declared active independently with probability p. At subsequent steps, an inactive site becomes active if it has at least one active nearest neighbour…
One of the most well-known classical results for site percolation on the square lattice is the equation $p_c+p_c^*=1$. In words, this equation means that for all values $\neq p_c$ of the parameter $p$, the following holds: either a.s. there…