On the law of the iterated logarithm and strong invariance principles in computational geometry

02/22/2020
by   Johannes Krebs, et al.
0

We study the law of the iterated logarithm (Khinchin (1933), Kolmogorov (1929)) and related strong invariance principles in computational geometry. As potential applications, we think of well-known functionals such as functionals defined on the k-nearest neighbors graph and important functionals in topological data analysis such as the Euler characteristic and persistent Betti numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2020

On the law of the iterated logarithm and strong invariance principles in stochastic geometry

We study the law of the iterated logarithm (Khinchin (1933), Kolmogorov ...
research
06/30/2023

Simulating elliptic diffusions and orthogonal invariance

We study numerical methods for simulating diffusions that exploit the or...
research
07/04/2023

Can We Mathematically Spot Possible Manipulation of Results in Research Manuscripts Using Benford's Law?

The reproducibility of academic research has long been a persistent issu...
research
11/24/2021

Strong Invariance Principles for Ergodic Markov Processes

Strong invariance principles describe the error term of a Brownian appro...
research
12/27/2013

Combining persistent homology and invariance groups for shape comparison

In many applications concerning the comparison of data expressed by R^m-...
research
07/12/2022

Application of Benford-Newcomb Law with Base Change to Electoral Fraud Detection

The invariance of Benford-Newcomb law under base changing is employed to...
research
03/17/2022

GPU Computation of the Euler Characteristic Curve for Imaging Data

Persistent homology is perhaps the most popular and useful tool offered ...

Please sign up or login with your details

Forgot password? Click here to reset