2000 character limit reached
Spectra of sparse regular graphs with loops (1107.4127v1)
Published 20 Jul 2011 in cond-mat.stat-mech, cond-mat.dis-nn, cs.SI, math-ph, math.MP, and physics.soc-ph
Abstract: We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary length. The implications of our results to the structural and dynamical properties of networks are discussed by showing how loops influence the size of the spectral gap and the propensity for synchronization. Analytical formulas for the spectrum are obtained for specific length of the loops.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.