Network comparison and the within-ensemble graph distance
Publication:5161157
DOI10.1098/rspa.2019.0744zbMath1472.05138arXiv2008.02415OpenAlexW3047462403WikidataQ104575674 ScholiaQ104575674MaRDI QIDQ5161157
Laurent Hébert-Dufresne, Guillaume st-Onge, Charles Murphy, Stefan McCabe, Harrison Hartle, Brennan Klein, Alexander Daniels
Publication date: 29 October 2021
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02415
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)
Related Items (3)
Cites Work
- Unnamed Item
- Analyzing complex networks evolution through Information Theory quantifiers
- A survey of graph edit distance
- A study of graph spectra for comparing graphs and trees
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Tracking network dynamics: a survey using graph distances
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- Fifty years of graph matching, network alignment and network comparison
- Comparing clusterings -- an information based distance
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Evolution of Random Graphs
- A graph distance metric based on the maximal common subgraph
- Random Geometric Graphs
- Networks
- Error Detecting and Error Correcting Codes
- A critical point for random graphs with a given degree sequence
- Graph distances using graph union
- Collective dynamics of ‘small-world’ networks
- Encyclopedia of Distances
This page was built for publication: Network comparison and the within-ensemble graph distance
