<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ensemble inequivalence in random graphs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0705.2385/</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/0705.2385/feed.xml" rel="self" type="application/rss+xml" /><item><title>Ensemble inequivalence in random graphs — mentioned by Anon84</title><link>https://news.ycombinator.com/item?id=40909738</link><guid isPermaLink="false">urn:hackerpapers:mention:0705.2385:40909738</guid><pubDate>Mon, 08 Jul 2024 21:10:30 GMT</pubDate><description>&lt;p&gt;Cool. I actually worked on this back in the early days of my PhD (https://arxiv.org/pdf/0705.2385). Never expected to see it on HN&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0705.2385/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item></channel></rss>
