<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Triangle Centrality · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2105.00110/</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/2105.00110/feed.xml" rel="self" type="application/rss+xml" /><item><title>Triangle Centrality — mentioned by michelpp</title><link>https://news.ycombinator.com/item?id=42177973</link><guid isPermaLink="false">urn:hackerpapers:mention:2105.00110:42177973</guid><pubDate>Mon, 18 Nov 2024 22:50:00 GMT</pubDate><description>&lt;p&gt;PageRank is one of several interesting centrality metrics that could be applied to a graph to influence RAG on structural data, another one is Triangle Centrality which counts triangles around nodes to figure out their centrality based on the concept that triangles close relationships into a strong bond, where open bonds dilute centrality by drawing weight away from the center: https://arxiv.org/abs/2105.00110 The paper shows high efficiency compared to other centralities like PageRank, however in some research using the GraphBLAS I and my coauthors found that TC was slower on a variety of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2105.00110/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
