Related papers: Percolation in heterogeneous spatial networks with…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
We formulate and study a model for inhomogeneous long-range percolation on $\Zbold^d$. Each vertex $x\in\Zbold^d$ is assigned a non-negative weight $W_x$, where $(W_x)_{x\in\Zbold^d}$ are i.i.d.\ random variables. Conditionally on the…
Percolation, describing critical behaviors of phase transition in a geometrical context, prompts wide investigations in natural and social networks as a fundamental model. The introduction of quantum-intrinsic interference and tunneling…
Percolation in a scale-free hierarchical network is solved exactly by renormalization-group theory, in terms of the different probabilities of short-range and long-range bonds. A phase of critical percolation, with algebraic…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
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…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
We investigate the problem of disseminating broadcast messages in wireless networks with time-varying links from a percolation-based perspective. Using a model of wireless networks based on random geometric graphs with dynamic on-off links,…
We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…
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…
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Renyi graph of N vertices we…
Capturing the dynamics of granular flows at intermediate length scales can often be difficult. We propose studying the dynamics of contact networks as a new tool to study fracture at intermediate scales. Using experimental three-dimensional…
Various natural and engineered systems, from urban traffic flow to the human brain, can be described by large-scale networked dynamical systems. These systems are similar in being comprised of a large number of microscopic subsystems, each…
We prove a Large Deviations Principle (LDP) for systems of diffusions (particles) interacting through their ranks, when the number of particles tends to infinity. We show that the limiting particle density is given by the unique solution of…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
A model for growing networks is introduced, having as a main ingredient that new nodes are attached to the network through one existing node and then explore the network through the links of the visited nodes. From exact calculations of two…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
We study the structural characteristics of complex networks using the representative eigenvectors of the adjacent matrix. The probability distribution function of the components of the representative eigenvectors are proposed to describe…
K-core and bootstrap percolation are widely studied models that have been used to represent and understand diverse deactivation and activation processes in natural and social systems. Since these models are considerably similar, it has been…