Congestion Due to Random Walk Routing

  title={Congestion Due to Random Walk Routing},
  author={Onuttom Narayan and Iraj Saniee and Vladimir Marbukh},
  booktitle={COMPLEX NETWORKS},
In this paper we derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the uniform multicommodity flow problem under random walk routing. We show the mean load is linearly dependent on the nodal degree with a common multiplier equal to the sum of the inverses of the non-zero eigenvalue of the graph Laplacian. Even though some aspects of the mean load value, such as linear dependence on the nodal degree, are intuitive and may be derived from the… Expand
1 Citations
An analytical solution to the multicommodity network flow problem with weighted random routing
An analytical expression is derived for the mean load at each node of an arbitrary undirected graph for the non-uniform multicommodity flow problem under weighted random routing that enables a (tight) upper bound for the capacity of the network under more standard routing policies. Expand


Laplacian spectra of, and random walks on, complex networks: are scale-free architectures really important?
An exact closed set of integral equations are derived, which provide the averages of the Laplacian operator's resolvent, which enables the propagation of a signal and random walks on the network. Expand
The purpose of this article is to survey the current literature on multicommodity network flows, concerned with generalizing the results which are known for single commodity flows in networks into three broad categories: optimization, computation and structure. Expand
Maximal Flow Through a Network
Introduction. The problem discussed in this paper was formulated by T. Harris as follows: "Consider a rail network connecting two cities by way of a number of intermediate cities, where each link ofExpand
Spectral graph theory
  • U. Feige
  • Zeta and 𝐿-functions in Number Theory and Combinatorics
  • 2019
With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shallExpand
Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
A theoretical justification of the experimental exponent discrepancy observed by Narayan and Saniee between traffic loads in Gromov-hyperbolic networks from the Rocketfuel database and synthetic Euclidean lattice networks is provided. Expand
The maximum concurrent flow problem
A fully polynomial-time approximation scheme for the maximum concurrent flow problem is developed and the problem of associating costs to the edges so as to maximize the minimum-cost of routing the concurrent flow is the dual of the MCFP. Expand
Random Walks on Graphs: A Survey
Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling. Expand
Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs
In this work we prove that the giant component of the Erdös–Renyi random graph G(n, c/n) for c a constant greater than 1 (sparse regime), is not Gromov δ–hyperbolic for any δ with probability tendingExpand
Random walks on complex networks.
The random walk centrality C is introduced, which is the ratio between its coordination number and a characteristic relaxation time, and it is shown that it determines essentially the mean first-passage time (MFPT) between two nodes. Expand
A measure of betweenness centrality based on random walks
  • M. Newman
  • Computer Science, Mathematics
  • Soc. Networks
  • 2005
A betweenness measure is proposed that relaxes this assumption that information spreads only along those shortest paths, including contributions from essentially all paths between nodes, not just the shortest, although it still gives more weight to short paths. Expand