Abstract
Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with respect to degrees of two randomly chosen nodes and shortest path distance between them. While LRDCs are induced by nearest-neighbor degree correlations (NNDCs) between adjacent nodes, some networks possess intrinsic LRDCs which cannot be generated by NNDCs. Here we develop a method to extract intrinsic LRDC in a correlated network by comparing the probability distributions for the given network with those for nearest-neighbor correlated random networks. We also demonstrate the utility of our method by applying it to several real-world networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
