<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>α-Indirect Control in Onion-like Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2109.07181/</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/2109.07181/feed.xml" rel="self" type="application/rss+xml" /><item><title>α-Indirect Control in Onion-like Networks — mentioned by sayonaraman</title><link>https://news.ycombinator.com/item?id=28690286</link><guid isPermaLink="false">urn:hackerpapers:mention:2109.07181:28690286</guid><pubDate>Wed, 29 Sep 2021 04:21:23 GMT</pubDate><description>&lt;p&gt;it&amp;#x27;s an incomplete graph problem, no all the edges (and vertices) are available, i guess the best way to describe it is finding missing edges by identifying network &amp;quot;hubs&amp;quot; i.e. most influential nodes (as in PageRank or Katz Centrality https://en.wikipedia.org/wiki/Katz_centrality ). The original paper: https://arxiv.org/abs/2109.07181v2 It&amp;#x27;s not a database problem but more of a graph search algorithm optimized for particular network topology.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2109.07181/"&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>
