A dynamic graph is approximated as a linear combination of latent adjacency matrices, estimated jointly from partial topology and smooth node signals, with better missing-edge reconstruction than tensor baselines.
Network evolution by different rewiring schemes,
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
eess.SP 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Graph signal aware decomposition of dynamic networks via latent graphs
A dynamic graph is approximated as a linear combination of latent adjacency matrices, estimated jointly from partial topology and smooth node signals, with better missing-edge reconstruction than tensor baselines.