-
Abstract
The modeling of realistic networks is of prime importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of link connectivity based on the preference for nearest neighbors or already highly connected nodes, or combine several of these approaches.
Our novel model brings together the well-know concepts of $k$-cores, originally introduced in social network analysis, and of preferential attachment. Recent studies exposed the significant $k$-core structure of several real world systems, e.g., the AS network of the Internet. We present a simple and efficient method for generating networks which at the same time strictly adhere to the characteristics of a given $k$-core structure, called core fingerprint, and feature a power-law degree distribution. We showcase our algorithm in a com- parative evaluation with two well-known AS network generators.
Mathematics Subject Classification: Primary: 05C85, 05C80; Secondary: 05C75.
\begin{equation} \\ \end{equation}
-
Access History
-
{{journal.titleEn}} 
DownLoad: