Uniform upper bound of the spectrum of rooted graphs

Given the number of vertices only, we provide a uniform upper bound for spectrum of rooted graphs under the equal-neighbor rule, by acquiring the tight upper bound of the scrambling constant (SC). Furthermore, with the concept of canonical form of rooted graphs, we find the least connective topology of rooted graphs in the sense of SC.

[1]  F. Chung.  Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .

[2]  Xudong Ye,et al.  Cooperative Output Regulation of Heterogeneous Multi-Agent Systems: An $H_{\infty}$ Criterion , 2014, IEEE Transactions on Automatic Control.

[3]  Persi Diaconis,et al.  Geometric bounds for the eigenvalues , 2018, Introduction to Analysis on Graphs.

[4]  Ming Cao,et al.  Topology design for fast convergence of network consensus algorithms , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[5]  Chai Wah Wu,et al.  Synchronization and convergence of linear dynamics in random directed networks , 2006, IEEE Transactions on Automatic Control.

[6]  J. Stoer,et al.  Abschätzungen für die eigenwerte positiver linearer operatoren , 1969 .

[7]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[8]  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.

[9]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

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

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

[12]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[13]  A. Odlyzko,et al.  Bounds for eigenvalues of certain stochastic matrices , 1981 .

[14]  Amr El Abbadi,et al.  Convergence Rates of Distributed Average Consensus With Stochastic Link Failures , 2010, IEEE Transactions on Automatic Control.

[15]  J. A. Fill.  Eigenvalue bounds on convergence to stationarity for nonreversible markov chains , 1991 .

[16]  L. Moreau,et al.  Stability of continuous-time distributed consensus algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[17]  John N. Tsitsiklis,et al.  A Lower Bound for Distributed Averaging Algorithms on the Line Graph , 2011, IEEE Transactions on Automatic Control.

[18]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[19]  Christoph Zenger,et al.  Inclusion domains for the eigenvalues of stochastic matrices , 1971 .

[20]  Richard M. Murray,et al.  INFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS , 2002 .

[21]  K. Hadeler,et al.  Abschätzungen für den zweiten Eigenwert eines positiven Operators , 1970 .