<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Disassortative mixing in online social networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0909.0450/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/0909.0450/feed.xml" rel="self" type="application/rss+xml" /><item><title>Disassortative mixing in online social networks — mentioned by Anon84</title><link>https://news.ycombinator.com/item?id=917034</link><guid isPermaLink="false">urn:hackerpapers:mention:0909.0450:917034</guid><pubDate>Mon, 02 Nov 2009 16:11:19 GMT</pubDate><description>&lt;p&gt;This is relatively well known in (Complex) Network theory as applied to Social Networks. You&amp;#x27;re always more likely to be connected to a Hub (someone with high degree) that to a &amp;quot;leaf&amp;quot; (in the tree sense). If you plot the average number of friends your friends have versus the number of your friends on a log-log plot, you&amp;#x27;ll see a decreasing line. (See Fig. 2 of http://arxiv.org/abs/0909.0450 for a recent example).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0909.0450/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>physics.soc-ph</category></item></channel></rss>
