Related papers: Distances in the highly supercritical percolation …
We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster is asymptotically equal to $\pi…
Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…
An update of the evidence that radio galaxies and clusters of galaxies are more common than average near the plane of the de Vaucouleurs Local Supercluster shows that in the distance range 100 to 200Mpc objects whose positions are…
Generalization of the one-dimensional totally asymmetric exclusion process (TASEP) with open boundary conditions in which particles are allowed to jump $l$ sites ahead with the probability $p_l\sim 1/l^{\sigma+1}$ is studied by Monte Carlo…
An electron diffraction technique is used to study the structure of clusters formed in an isentropically expanding supersonic argon jet. The formation of the hcp phase with increasing cluster size is reliably detected for the first time.…
Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…
In the totally asymmetric simple exclusion process (TASEP) two processes arise in the large time limit: the Airy_1 and Airy_2 processes. The Airy_2 process is an universal limit process occurring also in other models: in a stochastic growth…
We consider instances of long-range percolation on $\mathbb Z^d$ and $\mathbb R^d$, where points at distance $r$ get connected by an edge with probability proportional to $r^{-s}$, for $s\in (d,2d)$, and study the asymptotic of the…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…
This review examines progress on the Pop I, fundamental-mode Cepheid distance scale with emphasis on recent developments in geometric and quasi-geometric techniques for Cepheid distance determination. Specifically I examine the surface…
We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…
The one-dimensional asymmetric simple exclusion process (ASEP), where $N$ hard-core particles hop forward with rate $1$ and backward with rate $q<1$, is considered on a periodic lattice of $L$ site. Using KPZ universality and previous…
For independent nearest-neighbour bond percolation on Z^d with d >> 6, we prove that the incipient infinite cluster's two-point function and three-point function converge to those of integrated super-Brownian excursion (ISE) in the scaling…
In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…
In critical percolation models, in a large cube there will typically be more than one cluster of comparable diameter. In 2D, the probability of $k>>1$ spanning clusters is of the order $e^{-\alpha k^{2}}$. In dimensions d>6, when $\eta = 0$…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
Independent sets in graphs are sets of vertices containing no neighbors, and they represent a canonical spin system with hardcore constraints. Of particular interest is the setting of the boolean hypercube, where counting independent sets…
We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…