Fetching the paper…
Reading the bibliography…
The effective resistance between a pair of nodes in a weighted undirected graph is defined as the potential difference induced when a unit current is injected at one node and extracted from the other, treating edge weights as the conductance values of edges.
Random walks and electric networks
P. G. Doyle and J. L. Snell · 1984
Earlier work this paper cites.
Problems in decentralized decision making and computation
John Nikolas Tsitsiklis · 1984
Earlier work this paper cites.
Geometric bounds for eigenvalues of Markov chains
Persi Diaconis and Daniel Stroock · 1991
Earlier work this paper cites.
Resistance distance
D. J. Klein and M. Randić · 1993
Earlier work this paper cites.
An extension of Foster’s network theorem
Prasad Tetali · 1994
Earlier work this paper cites.
The electrical resistance of a graph captures its commute and cover times
Ashok K Chandra, Prabhakar Raghavan, Walter L Ruzzo, Roman Smolensky, and Prasoon Tiwari · 1996
Earlier work this paper cites.
Next century challenges: Scalable coordination in sensor networks
Deborah Estrin, Ramesh Govindan, John Heidemann, and Satish Kumar · 1999
Earlier work this paper cites.
Resistance-distance sum rules
D. J. Klein · 2002
Earlier work this paper cites.
A simple method for computing resistance distance
R. B. Bapat, I. Gutmana, and W. Xiao · 2003
Earlier work this paper cites.
Fastest mixing Markov chain on a graph
Stephen Boyd, Persi Diaconis, and Lin Xiao · 2003
Earlier work this paper cites.
Gossip-based computation of aggregate information
David Kempe, Alin Dobra, and Johannes Gehrke · 2003
Earlier work this paper cites.
Fast linear iterations for distributed averaging
Lin Xiao and Stephen Boyd · 2004
Earlier work this paper cites.
Bounding fastest mixing
Sébastien Roch et al · 2005
Earlier work this paper cites.
Symmetry analysis of reversible Markov chains
Stephen Boyd, Persi Diaconis, Pablo Parrilo, and Lin Xiao · 2005
Earlier work this paper cites.
Calculating two-point resistances in distance-regular resistor networks
M. Jafarizadeh, R. Sufiani, and S. Jafarizadeh · 2006
Earlier work this paper cites.
Randomized gossip algorithms
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah · 2006
Earlier work this paper cites.
The Schur Complement and Its Applications
F. Zhang · 2006
Earlier work this paper cites.
Consensus and cooperation in networked multi-agent systems
Reza Olfati-Saber, J Alex Fax, and Richard M Murray · 2007
Earlier work this paper cites.
Efficiency of the gossip algorithm for wireless sensor networks
E. Zanaj, M. Baldi, and F. Chiaraluce · 2007
Earlier work this paper cites.
Gossiping in distributed systems
Anne-Marie Kermarrec and Maarten van Steen · 2007
Cited alongside, same era.
Minimizing effective resistance of a graph
A. Ghosh, S. Boyd, and A. Saberi · 2008
Cited alongside, same era.
Calculating effective resistances on underlying networks of association schemes
M. A. Jafarizadeh, R. Sufiani, and S. Jafarizadeh · 2008
Cited alongside, same era.
Small-world graphs: Characterization and alternative constructions
Rama Cont and Emily Tanimura · 2008
Cited alongside, same era.
Randomized consensus algorithms over large scale networks
F. Fagnani and S. Zampieri · 2008
Cited alongside, same era.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Cited alongside, same era.
Linear time average consensus on fixed graphs?
Alex Olshevsky · 2015
Later among the works it cites.
EXTRA: An exact first-order algorithm for decentralized consensus optimization
W. Shi, Q. Ling, G. Wu, and W. Yin · 2015
Later among the works it cites.
Alex Olshevsky · 2016
Later among the works it cites.
Decentralized computation of effective resistances and acceleration of consensus algorithms
Necdet Serhat Aybat and Mert Gürbüzbalaban · 2017
Later among the works it cites.
Accelerated consensus via min-sum splitting
Patrick Rebeschini and Sekhar C Tatikonda · 2017
Later among the works it cites.
Introduction to averaging dynamics over networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gossip algorithms
Devavrat Shah · 2009
Cited alongside, same era.
Markov chains and mixing times. with a chapter by James G. Propp and David B. Wilson
David A Levin, Yuval Peres, and Elizabeth L Wilmer · 2009
Cited alongside, same era.
The hitting and cover times of random walks on finite graphs using local degree information
Satoshi Ikeda, Izumi Kubo, and Masafumi Yamashita · 2009
Cited alongside, same era.
Distributed averaging via lifted Markov chains
Kyomin Jung, Devavrat Shah, and Jinwoo Shin · 2010
Cited alongside, same era.
Graph sparsification by effective resistances
D. A. Spielman and N. Srivastava · 2011
Cited alongside, same era.
Consensus acceleration in multi-agent systems with the Chebyshev semi-iterative method
R. L. G. Cavalcante, A. Rogers, and N. R. Jennings · 2011
Cited alongside, same era.
Fabio Fagnani and Paolo Frasca · 2017
Later among the works it cites.
Community detection and stochastic block models: recent developments
Emmanuel Abbe · 2017
Later among the works it cites.
A distributed quasi-Newton algorithm for empirical risk minimization with nonsmooth regularization
Ching-pei Lee, Cong Han Lim, and Stephen J Wright · 2018
Later among the works it cites.
Distributed linearized alternating direction method of multipliers for composite convex consensus optimization
Necdet Serhat Aybat, Zi Wang, Tianyi Lin, and Shiqian Ma · 2018
Later among the works it cites.
Accelerated gossip via stochastic heavy ball method
Nicolas Loizou and Peter Richtárik · 2018
Later among the works it cites.
A Chebyshev-accelerated primal-dual method for distributed optimization
Jacob H Seidman, Mahyar Fazlyab, George J Pappas, and Victor M Preciado · 2018
Later among the works it cites.
Accelerated consensus with linear rate of convergence
Jingjing Bu, Maryam Fazel, and Mehran Mesbahi · 2018
Later among the works it cites.
Nicolas Loizou and Peter Richtárik · 2019
Closest in time.
Provably accelerated randomized gossip algorithms
Nicolas Loizou, Michael Rabbat, and Peter Richtárik · 2019
Closest in time.
A review of stochastic block models and extensions for graph clustering
Clement Lee and Darren J Wilkinson · 2019
Closest in time.
The Mosek optimization toolbox for Matlab manual. version 8.0.0.60
Mosek ApS · 2019
Closest in time.
Effective resistances of two-dimensional resistor networks
Rajat Chandra Mishra and Himadri Barman · 2020
Closest in time.
Gossip algorithm with nonuniform clock distribution: Optimization over classical and quantum networks
Saber Jafarizadeh · 2020
Closest in time.