Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4944615 | Information Sciences | 2017 | 9 Pages |
Abstract
Let G be a network with n nodes and eigenvalues λ1 ⥠λ2 ⥠â â â ⥠λn. Then G is called an (n, d, λ)-network if it is d-regular and λ=max{|λ2|,|λ3|,â¯,|λn|}. It is shown that if G is an (n, d, λ)-network and λ=O(d), the average clustering coefficient c¯(G) of G satisfies c¯(G)â¼d/n for large d. We show that this description also holds for strongly regular graphs and ErdÅs-Rényi graphs. Although most real-world networks are not constructed theoretically, we find that many of them have c¯(G) close to d¯/n and many close to 1âμ2¯(nâd¯â1)d¯(d¯â1), where d¯ is the average degree of G and μ2¯ is the average of the numbers of common neighbors over all non-adjacent pairs of nodes.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Yusheng Li, Yilun Shang, Yiting Yang,