Related papers: Percolation in a simple cubic lattice with distort…
We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…
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…
The percolation behavior of aligned rigid rods of length $k$ ($k$-mers) on two-dimensional triangular lattices has been studied by numerical simulations and finite-size scaling analysis. The $k$-mers, containing $k$ identical units (each…
The concept of midpoint percolation has recently been applied to characterize the double percolation transitions in negatively curved structures. Regular $d$-dimensional hypercubic lattices are in the present work investigated using the…
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…
The BFW model introduced by Bohman, Frieze, and Wormald [Random Struct. Algorithms, 25, 432 (2004)] and recently investigated in the framework of discontinuous percolation by Chen and D'Souza [Phys. Rev. Lett., 106, 115701 (2011)], is…
Macroscopic properties of heterogeneous media are frequently modelled by regular lattice models, which are based on a relatively small basic cluster of lattice sites. Here, we extend one of such models to any cluster's size kxk. We also…
Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…
We analyze the connectivity of an $M$-layer network over a common set of nodes that are active only in a fraction of the layers. Each layer is assumed to be a subgraph (of an underlying connectivity graph $G$) induced by each node being…
A relation between the effective diffusion coefficient in a lattice with random site energies and random trasition rates and the macroscopic conductivity in a random resistor network allows for elucidating possible sources of anomalous…
We present an alternative geometric representation for the eleven Archimedean lattices, in which each site and bond is uniquely labeled by an ordered pair of integers and characterized via a modular function. This structured labeling…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
A point process on the topological space S is at most countable subset without a random accumulation point in S. In studies of the point processes, there is a problem of seeing the properties of rigidity and tolerance, and this problem is…
The vertex distortion of a lattice knot is the supremum of the ratio of the distance between a pair of vertices along the knot and their distance in the l1-norm. We show analogous results to those of Gromov, Pardon and…
A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…