Given an undirected network, we describe a two-dimensional graphical measure based on the connected component distribution of its degree-limited subgraphs. This process yields an unambiguous visual , which reveals important network properties. It can be used as a classification tool, as graphs from related application areas have striking similarities. It can also be used as an efficient algorithm to demonstrate graph non-isomorphism for large graphs with identical degree distributions. Finally, it can be used as an analysis tool to help distinguish real-world networks from their synthetic counterparts.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7339597 | PMC |
http://dx.doi.org/10.6028/jres.121.001 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!