Limits of Discrete Energy of Families of Increasing Sets
Hari Sarang Nathan
TL;DR
The paper develops a discrete-energy framework to bound the Hausdorff dimension of a set $E$ from finite samples by relating the discrete energy $J_s(P_n)$ of point sets to the continuous Riesz energy $I_s(\mu)$ of measures supported on $E$. It establishes that when a sequence of point sets is $s$-adaptable and the associated counting measures converge weakly to a measure $\mu$, then $J_s(P_n) \to I_s(\mu)$ and $\dim_{\mathcal{H}}(\mathrm{supp}(\mu)) \ge s$, providing a bridge between discrete samples and fractal dimensions. The work extends to random sampling, proving $\mathbb{E}[J_s(P_n)]=I_s(\mu)$ with finite variance characterized by $I_{2s}(\mu)$, and demonstrates probabilistic laws of large numbers for $J_s(P_n)$ in connection to $I_s(\mu)$. Finally, it leverages these results to Erdős/Falconer-type problems, showing that, under Falconer-type assumptions, $s$-adaptable point families yield nontrivial lower bounds on distance-sets and related incidence problems, with extensions to general kernels $\phi$ and dot-product frameworks, highlighting practical implications for high-dimensional data analysis and geometric-combinatorial questions.
Abstract
The Hausdorff dimension of a set can be detected using the Riesz energy. Here, we consider situations where a sequence of points, $\{x_n\}$, ``fills in'' a set $E \subset \mathbb{R}^d$ in an appropriate sense and investigate the degree to which the discrete analog to the Riesz energy of these sets can be used to bound the Hausdorff dimension of $E$. We also discuss applications to data science and Erdős/Falconer type problems.
