L
Linyuan Lu
Researcher at University of South Carolina
Publications - 138
Citations - 8834
Linyuan Lu is an academic researcher from University of South Carolina. The author has contributed to research in topics: Hypergraph & Random graph. The author has an hindex of 32, co-authored 138 publications receiving 8254 citations. Previous affiliations of Linyuan Lu include University of California, San Diego & Nankai University.
Papers
More filters
Proceedings ArticleDOI
A random graph model for massive graphs
TL;DR: A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs.
Journal ArticleDOI
The average distances in random graphs with given expected degrees
Fan Chung,Linyuan Lu +1 more
TL;DR: It is shown that for certain families of random graphs with given expected degrees the average distance is almost surely of order log n/log d́, where d̃ is the weighted average of the sum of squares of the expected degrees.
Journal ArticleDOI
Connected Components in Random Graphs with Given Expected Degree Sequences
Fan Chung,Linyuan Lu +1 more
TL;DR: In this article, the authors consider a family of random graphs with a given expected degree sequence and examine the distribution of the sizes/volumes of the connected components which turns out depending primarily on the average degree d and the second-order average degree D~.
MonographDOI
Complex Graphs and Networks
Fan Chung,Linyuan Lu +1 more
TL;DR: In the information age, graph theory has been studied in a variety of ways as mentioned in this paper, e.g., the preferential attachment scheme for biological networks, random graphs with given expected degrees, the rise of the giant component Average distance and the diameter Eigenvalues of the adjacency matrix of $G(\mathbf{w})$ The semi-circle law for $G(m)$ The configuration model for power law graphs.
Journal ArticleDOI
Spectra of random graphs with given expected degrees
Fan Chung,Linyuan Lu,Van Vu +2 more
TL;DR: In this article, it was shown that the eigenvalues of the Laplacian of a random power-law graph follow the Wigner's semicircle law, whereas the spectrum of the adjacency matrix obeys the power law.