pith. sign in

arxiv: physics/0512075 · v1 · submitted 2005-12-08 · ⚛️ physics.soc-ph · cond-mat.soft

Degree Landscapes in Scale-Free Networks

classification ⚛️ physics.soc-ph cond-mat.soft
keywords networkslandscapesmountainsnodeshierarchicaladjacentanalogueassociated
0
0 comments X
read the original abstract

We generalize the degree-organizational view of real-world networks with broad degree-distributions in a landscape analogue with mountains (high-degree nodes) and valleys (low-degree nodes). For example, correlated degrees between adjacent nodes corresponds to smooth landscapes (social networks), hierarchical networks to one-mountain landscapes (the Internet), and degree-disassortative networks without hierarchical features to rough landscapes with several mountains. We also generate ridge landscapes to model networks organized under constraints imposed by the space the networks are embedded in, associated to spatial or, in molecular networks, to functional localization. To quantify the topology, we here measure the widths of the mountains and the separation between different mountains.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.