Related papers: Transport and Percolation Theory in Weighted Netwo…
To study transport properties of complex networks, we analyze the equivalent conductance $G$ between two arbitrarily chosen nodes of random scale-free networks with degree distribution $P(k)\sim k^{-\lambda}$ in which each link has the same…
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…
We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdos-Renyi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our…
We study the transport properties of model networks such as scale-free and Erd\H{o}s-R\'{e}nyi networks as well as a real network. We consider the conductance $G$ between two arbitrarily chosen nodes where each link has the same unit…
Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
In reality, many real-world networks interact with and depend on other networks. We develop an analytical framework for studying interacting networks and present an exact percolation law for a network of $n$ interdependent networks (NON).…
Two stochastic models are proposed to generate a system composed of two interdependent scale-free (SF) or Erd\H{o}s-R\'{e}nyi (ER) networks where interdependent nodes are connected with exponential or power-law relation, as well as…
The self averaging properties of conductance $g$ are explored in random resistor networks with a broad distribution of bond strengths $P(g)\simg^{\mu-1}$. Distributions of equivalent conductances are estimated numerically on hierarchical…
Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $\rho(t)$ of random walkers in the presence of one or multiple traps with concentration $c$. We show…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…
We propose and study a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows the weights of links are…
We develop a simple systematic method, valid for all strengths of disorder, to obtain analytically the full distribution of conductances P(g) for a quasi one dimensional wire within the model of non-interacting fermions. The method has been…
We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path $\ell_{\rm opt}$ in a disordered Erd\H{o}s-R\'enyi (ER) random network and scale-free (SF) network. Each link $i$ is…
Understanding the subgraph distribution in random networks is important for modelling complex systems. In classic Erdos networks, which exhibit a Poissonian degree distribution, the number of appearances of a subgraph G with n nodes and g…
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…
In this work we study in detail all phases of the time evolution of a delta-like excitation in Erd\"os-Renyi (ER) random networks by means of the survival probability (SP): The initial decay of the SP (both, the fast decay followed by the…