Related papers: Factorization of percolation density correlation f…
We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…
Langlands et al. considered two crossing probabilities, pi_h and pi_{hv}, in their extensive numerical investigations of critical percolation in two dimensions. Cardy was able to find the exact form of pi_h by treating it as a correlation…
We present a study of connectivity percolation in suspensions of hard spherocylinders by means of Monte Carlo simulation and connectedness percolation theory. We focus attention on polydispersity in the length, the diameter and the…
The influence of geometry and morphology of superconducting structure on critical currents and magnetic flux trapping in percolative type-II superconductor is considered. The superconductor contains the clusters of a normal phase, which act…
The critical behaviour of correlation functions near a boundary is modified from that in the bulk. When the boundary is smooth this is known to be characterised by the surface scaling dimension $\xt$. We consider the case when the boundary…
The structure of the three-dimensional random field Ising magnet is studied by ground state calculations. We investigate the percolation of the minority spin orientation in the paramagnetic phase above the bulk phase transition, located at…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…
An exact formula is given for the probability that there exists a spanning cluster between opposite boundaries of an annulus, in the scaling limit of critical percolation. The entire distribution function for the number of distinct spanning…
Exact or precise thresholds have been intensively studied since the introduction of the percolation model. Recently the critical polynomial $P_{\rm B}(p,L)$ was introduced for planar-lattice percolation models, where $p$ is the occupation…
We study a percolation problem on a substrate formed by two-dimensional XY spin configurations, using Monte Carlo methods. For a given spin configuration we construct percolation clusters by randomly choosing a direction $x$ in the spin…
We study the number of clusters in two-dimensional (2d) critical percolation, N_Gamma, which intersect a given subset of bonds, Gamma. In the simplest case, when Gamma is a simple closed curve, N_Gamma is related to the entanglement entropy…
This work is the first in a series of papers devoted to the construction and study of scaling limits of dynamical and near-critical planar percolation and related objects like invasion percolation and the Minimal Spanning Tree. We show here…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
The number of clusters per site $n(p)$ in percolation at the critical point $p = p_c$ is not itself a universal quantity---it depends upon the lattice and percolation type (site or bond). However, many of its properties, including…
A new ``Percolation with Clustering'' (PWC) model is introduced, where (the probabilities of) site percolation configurations on the leaf set of a binary tree are rewarded exponentially according to a generic function, which measures the…
In this article we study percolation on the Cayley graph of a free product of groups. The critical probability $p_c$ of a free product $G_1*G_2*...*G_n$ of groups is found as a solution of an equation involving only the expected subcritical…