Related papers: Cluster decomposition of percolation probability o…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…
We develop a recursive formula for the probability of a k-cluster in bootstrap percolation.
In this paper we study statistical methods of parameters estimation of the site percolation model. Advantages of the proposed method is demonstrated for the computing of the confidence interval of mass fractal dimension of a percolation…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
We introduce a class of random graphs with a community structure, which we call the hierarchical configuration model. On the inter-community level, the graph is a configuration model, and on the intra-community level, every vertex in the…
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 tends to $1/2$ as the intensity of…
The 't Hooft criterion leading to confinement out of a percolating cluster of central vortices suggests defining a novel three-dimensional gauge theory directly on a random percolation process. Wilson loop is viewed as a counter of…
In the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…
We investigate percolation in mixtures of nanorods in the presence of external fields that align or disalign the particles with the field axis. Such conditions are found in the formulation and processing of nanocomposites, where the field…
Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…
The logarithmic conformal field theory describing critical percolation is further explored using Watts' determination of the probability that there exists a cluster connecting both horizontal and vertical edges. The boundary condition…
Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
Grimmett's random-orientation percolation is formulated as follows. The square lattice is used to generate an oriented graph such that each edge is oriented rightwards (resp. upwards) with probability $p$ and leftwards (resp. downwards)…