HackerPapers

arXiv:0909.0450physics.soc-ph

Disassortative mixing in online social networks

Haibo Hu, Xiaofan Wang

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The conventional wisdom is that social networks exhibit an assortative mixing pattern, whereas biological and technological networks show a disassortative mixing pattern. However, the recent research on the online social networks modifies the widespread belief, and many online social networks show a disassortative or neutral mixing feature. Especially, we found that an online social network, Wealink, underwent a transition from degree assortativity characteristic of real social networks to degree disassortativity characteristic of many online social networks, and the transition can be reasonably elucidated by a simple network model that we propose. The relations among network assortativity, clustering, and modularity are also discussed in the paper.

arXiv comments
6 pages, 5 figures, 1 table
Journal reference
EPL 86, 18003 (2009)
DOI
doi:10.1209/0295-5075/86/18003
Subjects
physics.soc-phPhysics and Society physics.data-anData Analysis, Statistics and Probability physics.pop-phPopular Physics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Nov 2009 to Nov 2009.

Comments linking this paper, per year.

Discussed in comments1 thread

    • This is relatively well known in (Complex) Network theory as applied to Social Networks. You're always more likely to be connected to a Hub (someone with high degree) that to a "leaf" (in the tree sense). If you plot the average number of friends your friends have versus the…

      Anon84View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.