Journal
SOCIAL NETWORK ANALYSIS AND MINING
Volume 8, Issue 1, Pages -Publisher
SPRINGER WIEN
DOI: 10.1007/s13278-018-0492-3
Keywords
-
Categories
Funding
- National Science Foundation Research Experiences [1358583]
- National Science Foundation CCLI [1019532]
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [1358583] Funding Source: National Science Foundation
- Division Of Undergraduate Education
- Direct For Education and Human Resources [1019532] Funding Source: National Science Foundation
Ask authors/readers for more resources
Graph theoretic properties such as the clustering coefficient, characteristic (or average) path length, global and local efficiency provide valuable information regarding the structure of a graph. These four properties have applications to biological and social networks and have dominated much of the literature in these fields. While much work has done in applied settings, there has yet to be a mathematical comparison of these metrics from a theoretical standpoint. Motivated by both real-world data and computer simulations, we present asymptotic linear relationships between the characteristic path length, global efficiency, and graph density, and also between the clustering coefficient and local efficiency. In the current literature, these properties are often presented as independent metrics; however, we show in this paper that they are inextricably linked.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available