<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Confidence sets for persistence diagrams · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1303.7117/</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/1303.7117/feed.xml" rel="self" type="application/rss+xml" /><item><title>Confidence sets for persistence diagrams — mentioned by nkurz</title><link>https://news.ycombinator.com/item?id=5466557</link><guid isPermaLink="false">urn:hackerpapers:mention:1303.7117:5466557</guid><pubDate>Sat, 30 Mar 2013 20:24:40 GMT</pubDate><description>&lt;p&gt;A good idea. This helps so that when the paper is updated one finds the most current version. http://arxiv.org/abs/1303.7117&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1303.7117/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.ST</category></item><item><title>Confidence sets for persistence diagrams — mentioned by ot</title><link>https://news.ycombinator.com/item?id=5466091</link><guid isPermaLink="false">urn:hackerpapers:mention:1303.7117:5466091</guid><pubDate>Sat, 30 Mar 2013 17:47:55 GMT</pubDate><description>&lt;p&gt;Just a few days ago the following paper was published on the ArXiv, it specifically tackles the problem of noise. I haven&amp;#x27;t had time to read it thoroughly, but it also contains a nice introduction to persistent homology for statisticians, who are usually not familiar with the concepts of algebraic topology. http://arxiv.org/pdf/1303.7117v1.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1303.7117/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.ST</category></item></channel></rss>
