Papers › Probability density estimation for sets of large graphs with respect to spectral...
Probability density estimation for sets of large graphs with respect to spectral information using stochastic block models
Daniel Ferguson, François G. Meyer
For graph-valued data sampled iid from a distribution μ, the sample moments are computed with respect to a choice of metric. In this work, we equip the set of graphs with the pseudo-metric defined by the ℓ₂ norm between the eigenvalues of the respective adjacency matrices. We use this pseudo metric and the respective sample moments of a graph valued data set to infer the parameters of a distribution μ̂ and interpret this distribution as an approximation of μ. We verify experimentally that complex distributions μ can be approximated well taking this approach.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections