Network comparison and the within-ensemble graph distance

Quantifying the differences between networks is a challenging and ever-present problem in network science. In recent years, a multitude of diverse, ad hoc solutions to this problem have been introduced. Here, we propose that simple and well-understood ensembles of random networks—such as Erdős–Rényi...

Descripción completa

Detalles Bibliográficos
Autores principales: Hartle, Harrison, Klein, Brennan, McCabe, Stefan, Daniels, Alexander, St-Onge, Guillaume, Murphy, Charles, Hébert-Dufresne, Laurent
Formato: Online Artículo Texto
Lenguaje:English
Publicado: The Royal Society Publishing 2020
Materias:
Special Feature
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7735290/
https://www.ncbi.nlm.nih.gov/pubmed/33363435
http://dx.doi.org/10.1098/rspa.2019.0744

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7735290/
https://www.ncbi.nlm.nih.gov/pubmed/33363435
http://dx.doi.org/10.1098/rspa.2019.0744

Ejemplares similares