Statistical fidelity: a tool to quantify the similarity between multi-variable entities with application in complex networks

DOI10.1080/00207160.2016.1247437zbMATH Open1391.05237OpenAlexW2531888006MaRDI QIDQ3174863FDOQ3174863

Authors: Alexandru Topirceanu, Mihai Udrescu 

Publication date: 18 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1247437

Recommendations

• On efficient network similarity measures
• A linear-time algorithm and analysis of graph relative Hausdorff distance
• Toward quantifying vertex similarity in networks
• Framework based on communicability to measure the similarity of nodes in complex networks
• A review on network robustness from an information theory perspective

zbMATH Keywords

complex networkssimilarity measurerealismnetwork motifsnetwork comparison

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Cites Work

• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Networks, crowds and markets. Reasoning about a highly connected world.
• Collective dynamics of `small-world' networks
• Exploring complex networks
• The Watts–Strogatz network model developed by including degree distribution: theory and computer simulation
• Francis Galton's account of the invention of correlation

Cited In (2)

• Topological data analysis for network resilience quantification
• Similarity analysis of time interval data sets -- a graph theory approach

Uses Software

• Gephi
• FANMOD

This page was built for publication: Statistical fidelity: a tool to quantify the similarity between multi-variable entities with application in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174863)