Related papers: Percolation threshold on planar Euclidean Gabriel …
We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $\delta \mathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $\delta$ goes to 0. In…
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…
We consider neighbor-induced damage percolation, a model describing systems where the inactivation of some elements may damage their neighboring active ones, making them unusable. We present an exact solution for the size of the giant…
We present a self-contained discussion of the universality classes of the generalized epidemic process (GEP) on Poisson random networks, which is a simple model of social contagions with cooperative effects. These effects lead to rich phase…
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
We study site percolation on a sequence of graphs $\{G_n\}_{n\geq1}$ on $n$ vertices where degree of each vertex is in the interval $(np -a_n, np+a_n)$ and the co-degree of every pair of vertices is at most ${n}p^2+ b_n$, where $p \in…
We summarize several decades of work in finding values for the percolation threshold p_c for site percolation on the square lattice, the universal correction-to-scaling exponent Omega, and the susceptibility amplitude ratio C^+/C^-, in two…
The Gaussian model of discontinuous percolation, recently introduced by Ara\'ujo and Herrmann [Phys. Rev. Lett., 105, 035701 (2010)], is numerically investigated in three dimensions, disclosing a discontinuous transition. For the…
It was pointed out by de Arcangelis et al. [Europhys. Lett. 14 (1991), 515] that the correct understanding of the percolation phenomenon of the Fortuin-Kasteleyn cluster in the Edwards-Anderson model is important since a dynamical…
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
We determine thresholds $p_c$ for random site percolation on a triangular lattice for neighbourhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN) and next-next-next-next-nearest (5NN)…
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…
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by investigating geometric percolation of non-interacting line segments and disks in two spatial dimensions. These examples serve as models for…
We study families of dependent site percolation models on the triangular lattice ${\mathbb T}$ and hexagonal lattice ${\mathbb H}$ that arise by applying certain cellular automata to independent percolation configurations. We analyze the…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
We propose an interdependent random geometric graph (RGG) model for interdependent networks. Based on this model, we study the robustness of two interdependent spatially embedded networks where interdependence exists between geographically…
In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.