Related papers: The upper critical dimension of the negative-weigh…
Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting.…
We study the vortex lines that are a feature of many random or disordered three-dimensional systems. These show universal statistical properties on long length scales, and geometrical phase transitions analogous to percolation transitions…
In the first paper of this series [S. Torquato, J. Chem. Phys. {\bf 136}, 054106 (2012)], analytical results concerning the continuum percolation of overlapping hyperparticles in $d$-dimensional Euclidean space $\mathbb{R}^d$ were obtained,…
We consider the $\mathbb{C}\mathbb{P}^{(N_f-1)}$ Non-Linear-Sigma-Model in the dimension $4<d<6$. The critical behaviour of this model in the large $N_f$ limit is reviewed. We propose a Higher Derivative Gauge (HDG) theory as an ultraviolet…
We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…
Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now…
We conducted Monte Carlo simulations to analyze the percolation transition of a non-symmetric loop model on a regular three-dimensional lattice. We calculated the critical exponents for the percolation transition of this model. The…
It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these results rely on isoperimetric properties of the underlying…
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…
Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest…
Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of bootstrap percolation models in two…
We study the effects of adding loops to a critical percolation cluster on the diffusional, and equivalently, (scalar) elastic properties of the fractal network. From the numerical calculations of the eigenspectrum of the transition…
We study percolation on self-dual hypergraphs that contain hyperedges with four bounding vertices, or "four-edges", using three different generators, each containing bonds or sites with three distinct probabilities $p$, $r$, and $t$…
We consider here the percolation problem in thin films, both in the direction normal to the film and in the direction parallel to the film. We thereby describe here the cross-over between 2D and 3D percolation, which we do on cubic and…
Descriptors that characterize the geometry and topology of the pore space of porous media are intimately linked to their transport properties. We quantify such descriptors, including pore-size functions and the critical pore radius…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
Static wireless networks are by now quite well understood mathematically through the random geometric graph model. By contrast, there are relatively few rigorous results on the practically important case of mobile networks, in which the…
We study a percolation problem based on critical loop configurations of the O($n$) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…