Algebraic Connectivity Ratio of Ramanujan Graphs

In this paper, we explore spectral properties of a class of regular Cayley graphs known as Ramanujan graphs and prove that the ratio of their algebraic connectivity to that of regular lattices grows exponentially as O(ngamma) with gamma = 1.84plusmn0.05 for networks with average degree of O(log(n)). Explicit construction algorithms exist for Ramanujan graphs that create regular graphs with especial degree and scale that depend on a pair of prime numbers. We introduce a randomized algorithm for construction of a class of fast regular graphs called quasi Ramanujan graphs. These graphs are obtained from finite number of degree balancing operations on Watts-Strogatz small-word networks that are irregular graphs. We show that quasi Ramanujan graphs share similar combinatorial optimality spectral properties as Ramanujan graphs and are not restricted to especial choices of degree and scale. A byproduct of this fact is that the algebraic connectivity ratio of quasi Ramanujan graphs grows exponentially in n as well. Numerical experiments are performed to verify our analytical predictions. Consensus algorithms converge extremely fast on networks with exponentially growing algebraic connectivity ratios.

[1]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  M. Alanyali,et al.  Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links , 2006, IEEE Transactions on Signal Processing.

[3]  J. Shamma,et al.  Belief consensus and distributed hypothesis testing in sensor networks , 2006 .

[4]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[5]  Meng Ji,et al.  Connectedness preserving distributed coordination control over dynamic graphs , 2005, Proceedings of the 2005, American Control Conference, 2005..

[6]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  R. Olfati-Saber,et al.  Consensus Filters for Sensor Networks and Distributed Sensor Fusion , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Venkatesh Saligrama Murat Alanyali Onur Savas.  Asynchronous Distributed Detection in Sensor Networks ∗ , 2005 .

[9]  Richard M. Murray,et al.  DYNAMIC CONSENSUS FOR MOBILE NETWORKS , 2005 .

[10]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[11]  Peng Yang,et al.  Distributed estimation and control of swarm formation statistics , 2006, 2006 American Control Conference.

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[13]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[14]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[15]  Dongyan Xu,et al.  Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis , 2005 .

[16]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[17]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[18]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[19]  R. Olfati-Saber,et al.  Distributed Kalman Filter with Embedded Consensus Filters , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[20]  A. Jadbabaie,et al.  On the stability of the Kuramoto model of coupled nonlinear oscillators , 2005, Proceedings of the 2004 American Control Conference.

[21]  G. Verghese,et al.  Synchronization in Generalized Erdös-Rényi Networks of Nonlinear Oscillators , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[22]  Noga Alon,et al.  Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

[23]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[24]  R. Olfati-Saber.  Ultrafast consensus in small-world networks , 2005, Proceedings of the 2005, American Control Conference, 2005..

[25]  J. Cortes.  Analysis and design of distributed algorithms for X-consensus , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[26]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[27]  D. Spielman,et al.  Expander codes , 1996 .

[28]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[29]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[30]  Reza Olfati-Saber,et al.  Distributed Kalman filtering and sensor fusion in sensor networks , 2006 .

[31]  R. Carli,et al.  Communication constraints in the state agreement problem , 2005 .

[32]  George J. Pappas,et al.  Controlling Connectivity of Dynamic Graphs , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[33]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[34]  M. Mesbahi.  On State-dependent dynamic graphs and their controllability properties , 2005, IEEE Transactions on Automatic Control.