The Degree Distribution of Random k-Trees
| dc.creator | Gao, Yong | |
| dc.date | 2008-08-01 | |
| dc.date.accessioned | 2026-07-07T12:04:43Z | |
| dc.date.available | 2026-07-07T12:04:43Z | |
| dc.description | A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential attachment and copying mechanisms that existing evolving graph processes fail to model due to technical obstacles. The result also serves as a further cautionary note reinforcing the point of view that a power law degree distribution should not be regarded as the only important characteristic of a complex network, as has been previously argued. | |
| dc.identifier | https://arxiv.org/abs/0808.0202 | |
| dc.identifier | http://arxiv.org/abs/0808.0202 | |
| dc.identifier | doi:10.1016/j.tcs.2008.10.015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/208181 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | The Degree Distribution of Random k-Trees | |
| dc.type | text |