Paper Info
Title
Asymptotics of the spectral radius for directed Chung-Lu random graphs with community structure.
Abstract
The spectral radius of the adjacency matrix can impact both algorithmic efficiency as well as the stability of solutions to an underlying dynamical process. Although much research has considered the distribution of the spectral radius for undirected random graph models, as symmetric adjacency matrices are amenable to spectral analysis, very little work has focused on directed graphs. Consequently, we provide novel concentration results for the spectral radius of the directed Chung-Lu random graph model. We emphasize that our concentration results are applicable both asymptotically and to networks of finite size. Subsequently, we extend our concentration results to a generalization of the directed Chung-Lu model that allows for community structure.
Year
Venue
Field
2017
arXiv: Combinatorics
Adjacency matrix,Discrete mathematics,Combinatorics,Community structure,Algorithmic efficiency,Random graph,Spectral radius,Directed graph,Spectral analysis,Asymptotic analysis,Mathematics
DocType
Volume
Citations 
Journal
abs/1705.10893
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
David Burstein1744.44