טוען...
Diameter in ultra‐small scale‐free random graphs
It is well known that many random graphs with infinite variance degrees are ultra‐small. More precisely, for configuration models and preferential attachment models where the proportion of vertices of degree at least k is approximately k (−(τ − 1)) with τ ∈ (2,3), typical distances between pairs of...
שמור ב:
| הוצא לאור ב: | Random Struct Algorithms |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
John Wiley & Sons, Inc.
2018
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6446946/ https://ncbi.nlm.nih.gov/pubmed/30983844 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1002/rsa.20798 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|