Related papers: A universally applicable approach to connectivity …
This study introduces a pore morphology algorithm that emphasizes the central role of topology in multiphase flow through porous media. Analysis of drainage in lattice-based pore networks identifies two key quantities, the percolation…
False-vacuum eternal inflation can be described as a random walk on the network of vacua of the string landscape. In this paper we show that the problem can be mapped naturally to a problem of directed percolation. The mapping relies on two…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Scaling limits of critical percolation models show major differences between low and high dimensional models. The article discusses the formulation of the continuum limit for the former case. A mathematical framework is proposed for the…
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erd\H{o}s-R\'enyi…
$k$-core percolation is a percolation model which gives a notion of network functionality and has many applications in network science. In analysing the resilience of a network under random damage, an extension of this model is introduced,…
We present a study on connectivity percolation in suspensions of hard platelets by means of Monte Carlo simulation. We interpret our results using a contact-volume argument based on an effective single--particle cell model. It is commonly…
The study of percolation in so-called {\em nested subgraphs} implies a generalization of the concept of percolation since the results are not linked to specific graph process. Here the behavior of such graphs at criticallity is studied for…
Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening,…
Simulating percolation and critical phenomena of labelled species inside films composed of single-component linear homogeneous macromolecules using molecular Monte Carlo method in 3 dimensions, we study dependence of these conducting…
The emergence of large-scale connectivity underlies the proper functioning of many networked systems, ranging from social networks and technological infrastructure to global trade networks. Percolation theory characterizes network formation…
We report the discovery of a discrete hierarchy of micro-transitions occurring in models of continuous and discontinuous percolation. The precursory micro-transitions allow us to target almost deterministically the location of the…
In the presented article, statistical properties regarding the topology and standard percolation on relative neighborhood graphs (RNGs) for planar sets of points, considering the Euclidean metric, are put under scrutiny. RNGs belong to the…
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 investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We…
We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…