Name
Abstract | ||
|---|---|---|
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random {\em hypergraph} model to a random {\em preferential attachment hypergraph} model. We then analyze the degree distribution of random preferential attachment hypergraphs and show that they possess heavy tail degree distribution properties similar to those of random preferential attachment graphs. However, our results show that the exponent of the degree distribution is sensitive to whether one considers the structure as a hypergraph or as a graph. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Combinatorics,Random graph,Exponent,Constraint graph,Hypergraph,Scale-free network,Heavy-tailed distribution,Degree distribution,Mathematics,Preferential attachment |
DocType | Volume | Citations |
Journal | abs/1502.02401 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen Avin | 1 | 608 | 48.60 |
| Zvi Lotker | 2 | 1000 | 79.68 |
| David Peleg | 3 | 6662 | 824.19 |