Localization of Electrical Flows

We show that in any graph, the average length of a flow path in an electrical flow between the endpoints of a random edge is $O(\log^2 n)$. This is a consequence of a more general result which shows that the spectral norm of the entrywise absolute value of the transfer impedance matrix of a graph is $O(\log^2 n)$. This result implies a simple oblivious routing scheme based on electrical flows in the case of transitive graphs.

[1]  Aleksander Madry,et al.  Fast Generation of Random Spanning Trees and the Effective Resistance Metric , 2015, SODA.

[2]  Y. Peres,et al.  Probability on Trees and Networks , 2017 .

[3]  Aleksander Madry,et al.  Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[4]  G. Lawler,et al.  Mixing times and e p bounds for oblivious routing , 2009 .

[5]  Sushant Sachdeva,et al.  Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[6]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[7]  Aleksander Madry,et al.  Faster Generation of Random Spanning Trees , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[8]  John Peebles,et al.  Sampling random spanning trees faster than matrix multiplication , 2016, STOC.

[9]  Gary L. Miller,et al.  Faster approximate multicommodity flow using quadratically coupled flows , 2012, STOC '12.

[10]  Thomas P. Hayes,et al.  Minimizing average latency in oblivious routing , 2008, SODA '08.

[11]  Satish Rao,et al.  A new approach to computing maximum flows using electrical flows , 2013, STOC '13.

[12]  Nikhil Srivastava,et al.  Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..

[13]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[14]  Ding-Zhu Du,et al.  Electric routing and concurrent flow cutting , 2009 .

[15]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.