The resistance perturbation distance: a metric for the analysis of dynamic networks
From MaRDI portal
Publication:1693161
DOI10.1016/j.dam.2017.10.007zbMath1377.05051arXiv1605.01091OpenAlexW2963691285WikidataQ60150349 ScholiaQ60150349MaRDI QIDQ1693161
François G. Meyer, Nathan D. Monnig
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01091
Related Items
Tracking network dynamics: a survey using graph distances, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, Network comparison and the within-ensemble graph distance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph kernels from the Jensen-Shannon divergence
- Effective graph resistance
- Recent advances in graph-based pattern recognition with applications in document analysis
- On a conjecture concerning spanning tree invariants and loop systems
- A study of graph spectra for comparing graphs and trees
- Quick approximation to matrices and applications
- Graph similarity and distance in graphs
- The electrical resistance of a graph captures its commute and cover times
- A graph-theoretic approach to enterprise network dynamics.
- Practical graph isomorphism. II.
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Spectral Sparsification of Graphs
- The Linear Algebra a Beginning Graduate Student Ought to Know
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- First-passage properties of the Erdos–Renyi random graph
- Graph isomorphism in quasipolynomial time [extended abstract]
- Minimizing Effective Resistance of a Graph
- Machine Learning: ECML 2004
- Network Analysis
