Related papers: Stability of shortest paths in complex networks wi…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
With a simple attack and repair evolution model, we investigate the stability and structural changes of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to…
Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular,…
Scale-free networks with moderate edge dependence experience a phase transition between ultrasmall and small world behaviour when the power law exponent passes the critical value of three. Moreover, there are laws of large numbers for the…
We study the distribution of optimal path lengths in random graphs with random weights associated with each link (``disorder''). With each link $i$ we associate a weight $\tau_i = \exp(ar_i)$ where $r_i$ is a random number taken from a…
We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
Stochastic networks based on random point sets as nodes have attracted considerable interest in many applications, particularly in communication networks, including wireless sensor networks, peer-to-peer networks and so on. The study of…
Let $G$ be an $n$-node and $m$-edge positively real-weighted undirected graph. For any given integer $f \ge 1$, we study the problem of designing a sparse \emph{f-edge-fault-tolerant} ($f$-EFT) $\sigma${\em -approximate single-source…
In this work we are concerned with the crossover between strong disorder (SD) and weak disorder (WD) behaviors in three well-known problems that involve minimal paths: directed polymers (directed paths with fixed starting point and length),…
We propose a general class of co-evolving tree network models driven by local exploration where new vertices attach to the current network via randomly sampling a vertex and then exploring the graph for a random number of steps in the…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
We study two kinds of weighted networks, weighted small-world (WSW) and weighted scale-free (WSF). The weight $w_{ij}$ of a link between nodes $i$ and $j$ in the network is defined as the product of endpoint node degrees; that is…
We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of…
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).…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
We consider nonequilibrium phase transitions in weighted scale-free networks, in which highly connected nodes, which are created earlier in time are partially immunized. For epidemic spreading we solve the dynamical mean-field equations and…
We present exact results, as well as some illustrative Monte Carlo simulations, concerning a stochastic network with weighted connections in which the fraction of nodes that are dynamically synchronized is a parameter. This allows one to…
We consider the continuous time version of the Random Walk Pinning Model (RWPM), studied in [5,6,7]. Given a fixed realization of a random walk Y$ on Z^d with jump rate rho (that plays the role of the random medium), we modify the law of a…
In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degree distribution alone does not suffice to characterize the…