scale-free property for degrees and weights in a preferential attachment random graph model
Clicks: 126
ID: 225210
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
126 views
14 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #34 of 40 articles by views in nature protocols
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A random graph evolution mechanism is defined. The evolution studied is a combination of the preferential attachment model and the interaction of four vertices. The asymptotic behaviour of the graph is described. It is proved that the graph exhibits
a power law degree distribution; in other words, it is scale-free. It turns out that any exponent in (2,∞) can be achieved. The proofs are based on martingale methods.
| Reference Key |
fazekas2013journalscale-free
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;István Fazekas;Bettina Porvázsnyik |
| Journal | nature protocols |
| Year | 2013 |
| DOI |
10.1155/2013/707960
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.