Related papers: Inhomogeneous Long-Range Percolation for Real-Life…
We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…
We further study the interfaces arising in a situation of inhomogeneity. More precisely, we identify a characteristic length for the gradient percolation model, that enables us to tighten previous estimates established for it. This allows…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
Most networks of interest do not live in isolation. Instead they form components of larger systems in which multiple networks with distinct topologies coexist and where elements distributed amongst different networks may interact directly.…
Social networks affect the diffusion of information, and thus have the potential to reduce or amplify inequality in access to opportunity. We show empirically that social networks often exhibit a much larger potential for unequal diffusion…
We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the…
Proximity networks are time-varying graphs representing the closeness among humans moving in a physical space. Their properties have been extensively studied in the past decade as they critically affect the behavior of spreading phenomena…
We study survival and extinction of a long-range infection process on a diluted one-dimensional lattice in discrete time. The infection can spread to distant vertices according to a Pareto distribution, however spreading is also prohibited…
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…
Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode graphs, such as the adjacency matrix and the Laplacian matrix, used to define the shift operator. For shift matrices…
Bootstrap percolation has been used effectively to model phenomena as diverse as emergence of magnetism in materials, spread of infection, diffusion of software viruses in computer networks, adoption of new technologies, and emergence of…
We study bond percolation on the square lattice with one-dimensional inhomogeneities. Inhomogeneities are introduced in the following way: A vertical column on the square lattice is the set of vertical edges that project to the same vertex…
We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all…
We propose a multistage version of the independent cascade model, which we call a multistage independent cascade (MIC) model, on networks. This model is parameterized by two probabilities: the probability $T_1$ that a node adopting a fad…
Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of moments approach that can be used to fit a…
Recently increasing attention has been addressed to the fluctuations observed in percolation defined in single and multiplex networks. These fluctuations are extremely important to characterize the robustness of real finite networks but…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…
We consider oriented long-range percolation on a graph with vertex set $\mathbb{Z}^d \times \mathbb{Z}_+$ and directed edges of the form $\langle (x,t), (x+y,t+1)\rangle$, for $x,y$ in $\mathbb{Z}^d$ and $t \in \mathbb{Z}_+$. Any edge of…