The barycentre graph of a graph dataset is reconstructed by pairing the mean Laplacian spectrum with Soules-basis eigenvectors aligned to communities, and for balanced stochastic block models this reconstruction is claimed to converge to the population mean.
IEEE/ACM Transactions on Networking27(5), 2125–2136 (2019)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Spectral Barycentre of a Set of Graphs with Community Structure
The barycentre graph of a graph dataset is reconstructed by pairing the mean Laplacian spectrum with Soules-basis eigenvectors aligned to communities, and for balanced stochastic block models this reconstruction is claimed to converge to the population mean.