Related papers: Percolation crossing probabilities in hexagons: a …
Using methods of conformal field theory, we conjecture an exact form for the probability that n distinct clusters span a large rectangle or open cylinder of aspect ratio k, in the limit when k is large.
We explore the coupling between the helix-coil and coil-globule transitions of a helical polymer using Monte Carlo simulations. A very rich state diagram is found. Each state is characterized by a specific configuration of the chain which…
In this communication with computer simulation we evaluate simple cubic random-site percolation thresholds for neighbourhoods including the nearest neighbours (NN), the next-nearest neighbours (2NN) and the next-next-nearest neighbours…
A brief introduction of the relationship of string percolation to the Quantum Chromo Dynamics (QCD) phase diagram is presented. The behavior of the Polyakov loop close to the critical temperature is studied in terms of the color fields…
We study the transport properties of directed percolation clusters at the upper critical dimension $d_{c} = 4+1$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) scaling behavior. Employing field…
We study directed percolation at the upper critical transverse dimension $d=4$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) behavior. Viewing directed percolation as a kinetic process, we address…
We examine the structure of the percolating cluster (PC) formed by site percolation on a random clustered network (RCN) model. Using the generating functions, we formulate the clustering coefficient and assortative coefficient of the PC. We…
We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…
The review is a brief description of the state of problems in percolation theory and their numerous applications, which are analyzed on base of interesting papers published in the last 15-20 years. At the submitted papers are studied both…
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
The Excursion Set approach has been used to make predictions for a number of interesting quantities in studies of nonlinear hierarchical clustering. These include the halo mass function, halo merger rates, halo formation times and masses,…
Let $A$ be an arc on the boundary of the unit disk $U$. We prove an asymptotic formula for the probability that there is a percolation cluster $K$ for critical site percolation on the triangular grid in $U$ which intersects $A$ and such…
Monte Carlo simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions. Simulations are performed for two cases: (i) objects whose…
We give a physical description in terms of percolation theory of the phase transition that occurs when the disorder increases in the random antiferromagnetic spin-1 chain between a gapless phase with topological order and a random singlet…
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…
We present a probabilistic theory of random walks in turbid media with non-scattering regions. It is shown that important characteristics such as diffusion constants, average step lengths, crossing statistics and void spacings can be…
We study continuum percolation in nuclear collisions for the realistic case in which the nuclear matter distribution is not uniform over the collision volume, and show that the percolation threshold is increased compared to the standard,…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
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…