Related papers: Geometric Bounds for Favard Length
Reliable quality assessment of decoded point cloud geometry is essential to evaluate the compression performance of emerging point cloud coding solutions and guarantee some target quality of experience. This paper proposes a novel point…
The paper studies the Hausdorff dimension of harmonic measures on various boundaries of a relatively hyperbolic group which are associated with random walks driven by a probability measure with finite first moment. With respect to the Floyd…
The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely identifying every vertex in a graph. A set of vertices in a graph is a resolving set if for any pair of vertices x and…
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…
It is shown that fractal dimension can be estimated seeking a solution of functional equation defined for areas of coverages of different scales. The method proposed is compared with widely known way to estimate fractal dimension via linear…
An approach is given for estimating the Hausdorff dimension of the univoque set of a self-similar set. This sometimes allows us to get the exact Hausdorff dimensions of the univoque sets.
The theory of uniform Diophantine approximation concerns the study of Dirichlet improvable numbers and the metrical aspect of this theory leads to the study of the product of consecutive partial quotients in continued fractions. It is known…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
This paper concerns the intermediate dimensions, a spectrum of dimensions that interpolate between the Hausdorff and box dimensions. Potential theoretic methods are used to produce dimension bounds for images of sets under H\"older maps and…
Fractal dimension constitutes the main tool to test for fractal patterns in Euclidean contexts. For this purpose, it is always used the box dimension, since it is easy to calculate, though the Hausdorff dimension, which is the oldest and…
Seventy years ago, John Marstrand published a paper which, among other things, relates the Hausdorff dimension of a plane set to the dimensions of its orthogonal projections onto lines. For some time this paper attracted little attention,…
We geometrically analyze the problem of estimating parameters related to the shape and size of a two-dimensional target object on the plane by using randomly distributed distance sensors whose locations are unknown. Based on the analysis…
We establish a correspondence between Pavlovian conditioning processes and fractals. The association strength at a training trial corresponds to a point in a disconnected set at a given iteration level. In this way, one can represent a…
Providing generalization guarantees for modern neural networks has been a crucial task in statistical learning. Recently, several studies have attempted to analyze the generalization error in such settings by using tools from fractal…
We consider the Assouad dimension analogues of two important problems in geometric measure theory. These problems are tied together by the common theme of `passing to weak tangents'. First, we solve an analogue of Falconer's distance set…
We study dimensional properties of visible parts of fractal percolation in the plane. Provided that the dimension of the fractal percolation is at least 1, we show that, conditioned on non-extinction, almost surely all visible parts from…
Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…
Improving the diversity of generated results while maintaining high visual quality remains a significant challenge in image generation tasks. Fractal Generative Models (FGMs) are efficient in generating high-quality images, but their…
We study a variant of the Falconer distance problem for dot products. In particular, for fractal subsets $A\subset \mathbb{R}^n$ and $a,x\in \mathbb{R}^n$, we study sets of the form \[ \Pi_x^a(A) := \{\alpha \in \mathbb{R} : (a-x)\cdot y=…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…