2008/08/01 by Yong Gao · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Stochastic processes and statistical mechanics #Topological and Geometric Data Analysis #cs.DM #cs.NI
paper · pdf · doi:10.1016/j.tcs.2008.10.015
arxiv created 2008/08/01 · openalex publication_date 2008/10/20 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.