Related papers: Flooding in weighted sparse random graphs of activ…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…
We show that the size distributions of fragments created by high energy nuclear collisions are remarkably well reproduced within the framework of a parameter free percolation model. We discuss two possible scenarios to explain this…
In this work, we propose an interdependent, multilayer network model and percolation process that matches infrastructures better than previous models by allowing some nodes to survive when their interdependent neighbors fail. We consider a…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
Flow networks are essential for both living organisms and enginneered systems. These networks often present complex dynamics controlled, at least in part, by their topology. Previous works have shown that topologically complex networks…
Conceptualizing a porous media as a network of conductors sets a compromise between the oversimplifying conceptualization of the media as a bundle of capillary tubes and the computationally expensive and unobtainable detailed description of…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
Diffusion is a key element of a large set of phenomena occurring on natural and social systems modeled in terms of complex weighted networks. Here, we introduce a general formalism that allows to easily write down mean-field equations for…
We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the…
\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…
Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…
Power-law behaviors are common in many disciplines, especially in network science. Real-world networks, like disease spreading among people, are more likely to be interconnected communities, and show richer power-law behaviors than isolated…
In the last decades, many authors have used the susceptible-infected-recovered model to study the impact of the disease spreading on the evolution of the infected individuals. However, few authors focused on the temporal unfolding of the…
We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its…
We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is…
Real networks are vulnerable to random failures and malicious attacks. However, when a node is harmed or damaged, it may remain partially functional, which helps to maintain the overall network structure and functionality. In this paper, we…
In this paper, we consider discrete time random walks on the pseudofractal scale-free web (PSFW) and we study analytically the related first passage properties. First, we classify the nodes of the PSFW into different levels and propose a…
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…
Congestion and extreme events in transportation networks are emergent phenomena with significant socio-economic implications. In this work, we study congestion and extreme event properties on real urban street (planar) networks drawn from…
The statistics of equally weighted random paths (ideal polymer) is studied in $2$ and $3$ dimensional percolating clusters. This is equivalent to diffusion in the presence of a trapping environment. The number of $N$ step walks follows a…