The Spectra of Random Graphs with Given Expected Degrees

From MaRDI portal
Publication:4672751

DOI10.1080/15427951.2004.10129089zbMath1080.05021OpenAlexW2112643910MaRDI QIDQ4672751

Van H. Vu, Linyuan Lu, Fan R. K. Chung

Publication date: 3 May 2005

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc164443



Related Items

An impossibility result for reconstruction in the degree-corrected stochastic block model, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Universality of the mean-field for the Potts model, Finding maximum subgraphs with relatively large vertex connectivity, Swarming on random graphs, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, Spectral statistics of sparse Erdős-Rényi graph Laplacians, Motifs, coherent configurations and second order network generation, Epidemic spreading on metapopulation networks considering indirect contact, A random graph model for clustering graphs, Property (T) in density-type models of random groups, Unnamed Item, Algebraic and combinatorial expansion in random simplicial complexes, Generating large scale‐free networks with the Chung–Lu random graph model, Bootstrap percolation in inhomogeneous random graphs, Modularity of Erdős‐Rényi random graphs, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, Graph clustering, Concentration of the Kirchhoff index for Erdős-Rényi graphs, Balanced centrality of networks, Sparse random graphs: Eigenvalues and eigenvectors, On eigenvalues of random complexes, Allocating resources for epidemic spreading on metapopulation networks, Bootstrap percolation in power-law random graphs, A combinatorial Li-Yau inequality and rational points on curves, Fixed-point property of random quotients by plain words., On certain connectivity properties of the internet topology, On the Laplacian Eigenvalues of Gn,p, Eigenvalues of Euclidean random matrices, The spectra of multiplicative attribute graphs, Universality for distances in power-law random graphs, Spectral analysis for weighted iterated q-triangulation networks, Randomized rumor spreading in poorly connected small-world networks, A spectral method for community detection in moderately sparse degree-corrected stochastic block models, A remark on the spectra of random graphs with given expected degrees, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, Swarming on random graphs. II