Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 93 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 31 tok/s
GPT-5 High 35 tok/s Pro
GPT-4o 86 tok/s
GPT OSS 120B 459 tok/s Pro
Kimi K2 195 tok/s Pro
2000 character limit reached

Random Čech complexes on $\mathbb{R}^d$: decrackling the noise with local scalings (1912.10548v1)

Published 22 Dec 2019 in math.PR, math.AG, and math.CO

Abstract: We investigate the homology of an unbounded noisy sample on $\mathbb{R}d$, under various assumptions on the sampling density. This investigation is based on previous results by Adler, Bobrowski, and Weinberger (\cite{crackle}), and Owada and Adler (\cite{topoCrackle}). There, it was found that unbounded noise generally introduces non-vanishing homology, a phenomenon called \textit{topological crackle}, unless the density has superexponential decay on $\mathbb{R}d$. We show how some well-chosen \textit{non-trivial} variable bandwidth constructions can extend the class of densities where crackle doesn't occur to any light tail density with mild assumptions, what we call \textit{decrackling the noise}.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube