A two-hop neighbor preference-based random network graph model with high clustering coefficient for modeling real-world complex networks

A two-hop neighbor preference-based random network graph model with high clustering coefficient for modeling real-world complex networks

The Erdos-Renyi (ER) random network model generates graphs under the assumption that there could exist a link u-v between two nodes u and v irrespective of whether or not the two nodes had a common neighbor before the establishment of the link. As a result, random network graphs generated under the...

Full description

Bibliographic Details
Main Authors: Natarajan Meghanathan, Aniekan Essien, Raven Lawrence
Format: Article
Language:English
Published: Elsevier 2021-09-01
Series:Egyptian Informatics Journal
Subjects:
Two-hop neighbors
Random network graphs
Erdos-Renyi model
Complex network analysis
Clustering coefficient
Online Access:http://www.sciencedirect.com/science/article/pii/S1110866516300342

Internet

http://www.sciencedirect.com/science/article/pii/S1110866516300342

Similar Items