<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1310.6753/</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/1310.6753/feed.xml" rel="self" type="application/rss+xml" /><item><title>Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook — mentioned by liuhenry</title><link>https://news.ycombinator.com/item?id=8327171</link><guid isPermaLink="false">urn:hackerpapers:mention:1310.6753:8327171</guid><pubDate>Tue, 16 Sep 2014 21:17:42 GMT</pubDate><description>&lt;p&gt;From the linked paper [1], it looks like the scores are calculated based on a concept of &amp;quot;dispersion&amp;quot;, which is how closely a particular individual in your network is connected to each of the separate clusters of people you know. Each of the clusters in the graph represents a &amp;quot;social foci&amp;quot;, such as co-workers, high school classmates, college classmates, etc. The dispersion score calculates how well someone you know is connected to these multiple disjoint clusters of people in your life, and tries to show that the person with the highest score is most likely to be your romantic partner. This…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1310.6753/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SI</category></item><item><title>Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook — HN submission</title><link>https://news.ycombinator.com/item?id=6759866</link><guid isPermaLink="false">urn:hackerpapers:submission:1310.6753:6759866</guid><pubDate>Tue, 19 Nov 2013 08:17:01 GMT</pubDate><description>&lt;p&gt;Recognize romantic partner using FB network [Oct, 2013]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1310.6753/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SI</category></item><item><title>Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook — HN submission</title><link>https://news.ycombinator.com/item?id=6633209</link><guid isPermaLink="false">urn:hackerpapers:submission:1310.6753:6633209</guid><pubDate>Tue, 29 Oct 2013 11:16:08 GMT</pubDate><description>&lt;p&gt;A Network Analysis of Relationship Status on Facebook&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1310.6753/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SI</category></item></channel></rss>
