Spectra of random graphs with given expected degrees

AUTOR(ES)

Chung, Fan

FONTE

National Academy of Sciences

RESUMO

In the study of the spectra of power-law graphs, there are basically two competing approaches. One is to prove analogues of Wigner's semicircle law, whereas the other predicts that the eigenvalues follow a power-law distribution. Although the semicircle law and the power law have nothing in common, we will show that both approaches are essentially correct if one considers the appropriate matrices. We will prove that (under certain mild conditions) the eigenvalues of the (normalized) Laplacian of a random power-law graph follow the semicircle law, whereas the spectrum of the adjacency matrix of a power-law graph obeys the power law. Our results are based on the analysis of random graphs with given expected degrees and their relations to several key invariants. Of interest are a number of (new) values for the exponent β, where phase transitions for eigenvalue distributions occur. The spectrum distributions have direct implications to numerous graph algorithms such as, for example, randomized algorithms that involve rapidly mixing Markov chains.

Documentos Relacionados

• The average distances in random graphs with given expected degrees
• Quasi-random graphs
• Discrete-time random walks on diagrams (graphs) with cycles.
• Expected Frequencies of Chromosome Associations in Tetraploids with Random Chiasma Formation
• Further properties of random walks on diagrams (graphs) with and without cycles.