Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs

From MaRDI portal
Publication:1747747

DOI10.1214/16-AOP1142zbMath1386.05174arXiv1501.06087OpenAlexW4298311822MaRDI QIDQ1747747

Marc Lelarge, Laurent Massoulié, Charles Bordenave

Publication date: 27 April 2018

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.06087




Related Items

Spectral gap in random bipartite biregular graphs and applicationsRate optimal Chernoff bound and application to community detection in the stochastic block modelsDetection thresholds in very sparse matrix completionMixing time of PageRank surfers on sparse random digraphsCommunity detection in the sparse hypergraph stochastic block modelThere is no going back: properties of the non-backtracking LaplacianThe limit theorem with respect to the matrices on non-backtracking paths of a graphEntrywise eigenvector analysis of random matrices with low expected rankLearning sparse graphons and the generalized Kesten-Stigum thresholdSpectral theory of the non-backtracking Laplacian for graphsAsymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random GraphsNon-backtracking spectra of weighted inhomogeneous random graphsSpectral radii of sparse random matricesThe Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard RegimeMaximum likelihood estimation of sparse networks with missing observationsUnnamed ItemContiguity and non-reconstruction results for planted partition models: the dense caseCommunity Detection and Stochastic Block ModelsEstimating the number of communities by spectral methodsSpectral gap of sparse bistochastic matrices with exchangeable rowsDetecting a planted community in an inhomogeneous random graphReversibility of the non-backtracking random walkThe spectral gap of sparse random digraphsCommunity detection in sparse networks via Grothendieck's inequalityRecent results of quantum ergodicity on graphs and further investigationSparse random tensors: concentration, regularization and applicationsCommunity detection with dependent connectivityExact recovery in the hypergraph stochastic block model: a spectral algorithmThe spectral norm of random lifts of matricesEigenvalues of random lifts and polynomials of random permutation matricesGlobal and individualized community detection in inhomogeneous multilayer networksEigenvalues of the non-backtracking operator detached from the bulkTop eigenpair statistics for weighted sparse graphs



Cites Work