On a two-truths phenomenon in spectral graph clustering

DOI10.1073/pnas.1814462116zbMath1431.62269arXiv1808.07801OpenAlexW2888391702WikidataQ64118018 ScholiaQ64118018MaRDI QIDQ5218576

Eric Bridgeford, John M. Conroy, Youngser Park, Joshua Cape, Minh Tang, Joshua T. Vogelstein, Vince Lyzinski, Avanti Athreya, Carey E. Priebe

Publication date: 4 March 2020

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Pattern recognition, speech recognition (68T10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Topological data analysis (62R40)

Related Items

Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering ⋮ Spectral graph clustering via the expectation-solution algorithm ⋮ On the efficacy of higher-order spectral clustering under weighted stochastic block models ⋮ Bayesian estimation of the latent dimension and communities in stochastic blockmodels ⋮ Vertex nomination via seeded graph matching ⋮ Unnamed Item