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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Elsevier
2021-09-01
|
| coleção: | Egyptian Informatics Journal |
| Assuntos: | |
| Acesso em linha: | http://www.sciencedirect.com/science/article/pii/S1110866516300342 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|