Related papers: Local Percolation Probabilities for a Natural Sand…
With the recent advent of a sound mathematical theory for extreme events in dynamical systems, new ways of analyzing a system's inherent properties have become available: Studying only the probabilities of extremely close Poincar\'{e}…
In this paper, we study the robustness of network topologies. We use the concept of percolation as measuring tool to assess the reliability polynomial of those systems which can be modeled as a general inhomogeneous random graph as well as…
A useful result about leftmost and rightmost paths in two dimensional bond percolation is proved. This result was introduced without proof in \cite{G} in the context of the contact process in continuous time. As discussed here, it also…
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…
In this paper we study anisotropic oriented percolation on $\mathbb{Z}^d$ for $d\geq 4$ and show that the local condition for phase transition is closely related to the mean-field condition. More precisely, we show that if the sum of the…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We prove that the value of the critical probability for percolation on an abelian Cayley graph is determined by its local structure. This is a partial positive answer to a conjecture of Schramm: the function pc defined on the set of Cayley…
In this study, we develop a saturation-dependent treatment of dispersion in porous media using concepts from critical path analysis, cluster statistics of percolation, and fractal scaling of percolation clusters. We calculate spatial solute…
We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity…
Liquid diodes are surface structures that facilitate the flow of liquids in a specific direction. When these structures are within the capillary regime, they promote liquid transport without the need for external forces. In nature, they are…
Under sufficient permanent random covalent bonding, a fluid of atoms or small molecules is transformed into an amorphous solid network. Being amorphous, local structural properties in such networks vary across the sample. A natural order…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…
We study how the dynamics of a drying front propagating through a porous medium are affected by small-scale correlations in material properties. For this, we first present drying experiments in micro-fluidic micro-models of porous media.…
Many natural fibrous networks with fiber diameters much smaller than the average poresize can be described as three-dimensional (3D) random line networks. We consider here a `Mikado' model for such systems, consisting of straight line…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
Flow and transport in fractured geological media are strongly controlled by aperture heterogeneity and uncertainty in subsurface characterisation, yet most upscaling approaches rely on deterministic representations of fracture permeability.…
In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…
We make the first steps towards generalizing the theory of stochastic block models, in the sparse regime, towards a model where the discrete community structure is replaced by an underlying geometry. We consider a geometric random graph…
We prove that, with probability 1, all orthogonal projections of the natural measure on a percolation fractal are absolutely continuous and (except for the horizontal and vertical projection) have H\"older continuous density.
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…