Scale-invariant graph embeddings whose parameters add under node merging give consistent multi-scale network reconstructions, with accuracy that depends on the metric and model family.
They require that the renormalized probability P(ℓ) sum equals the coarse-grained P(ℓ) cog with the same functional form ([18], section B 1) for all the scales
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.soc-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Renormalizable Graph Embeddings For Multi-Scale Network Reconstruction
Scale-invariant graph embeddings whose parameters add under node merging give consistent multi-scale network reconstructions, with accuracy that depends on the metric and model family.