Related papers: Nearest-neighbor connectedness theory: A general a…
The values obtained experimentally for the conductivity critical exponent in numerous percolation systems, in which the interparticle conduction is by tunnelling, were found to be in the range of $t_0$ and about $t_0+10$, where $t_0$ is the…
We investigate site and bond percolation in triangular and square lattices subjected to linear distortion. In contrast to previously studied distortion schemes that preserve lattice geometry, linear distortion dislocates regular lattice…
Correlations between electrical and thermal conduction in polymer composites are blurred due to the complex contribution of charge and heat carriers at the nanoscale junctions of filler particles. Conflicting reports on the lack or…
We prove that nearest-neighbor percolation in dimensions $d\geq 11$ displays mean-field behavior by proving that the infrared bound holds, in turn implying the finiteness of the percolation triangle diagram. The finiteness of the triangle…
2-boostrap percolation on a graph is a diffusion process where a vertex gets infected whenever it has at least 2 infected neighbours, and then stays infected forever. It has been much studied on the infinite grid for random Bernoulli…
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…
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$,…
In this paper we investigate the properties of nodal structures in random wave fields, and in particular we scrutinize their recently proposed connection with short-range percolation models. We propose a measure which shows the difference…
We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
A set of lower bounds on the continuum percolation threshold $\eta_c$ of overlapping convex hyperparticles of general nonspherical (anisotropic) shape with a specified orientational probability distribution in $d$-dimensional Euclidean…
The formation of sintering bridges in amorphous powders affects both flow behavior and perceived material quality. When sintering is driven by surface tension, bridges emerge sequentially, favoring contacts between smaller particles first.…
We introduce a bond percolation procedure on a $D$-dimensional lattice where two neighbouring sites are connected by $N$ channels, each operated by valves at both ends. Out of a total of $N$, randomly chosen $n$ valves are open at every…
Rigidity Percolation is a crucial framework for describing rigidity transitions in amorphous systems. We present a new, efficient algorithm to study central-force Rigidity Percolation in two dimensions. This algorithm combines the Pebble…
Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of…
This contribution is concerned with the effective viscosity problem, that is, the homogenization of the steady Stokes system with a random array of rigid particles, for which the main difficulty is the treatment of close particles. Standard…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…
We propose a method of studying the continuous percolation of aligned objects as a limit of a corresponding discrete model. We show that the convergence of a discrete model to its continuous limit is controlled by a power-law dependency…