English
Related papers

Related papers: On randomly placed arcs on the circle

200 papers

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

Combinatorics · Mathematics 2007-05-23 Nicholas Pippenger

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

We study probabilistic iterated function systems (IFS), consisting of a finite or infinite number of average-contracting bi-Lipschitz maps on R^d. If our strong open set condition is also satisfied, we show that both upper and lower bounds…

Dynamical Systems · Mathematics 2015-10-06 Andreas Anckar

We view space-filling circle packings as subsets of the boundary of hyperbolic space subject to symmetry conditions based on a discrete group of isometries. This allows for the application of counting methods which admit rigorous upper and…

Number Theory · Mathematics 2023-10-18 Daniel Lautzenheiser

We compute the almost sure Hausdorff dimension of random self-affine sponges in $\mathbb{R}^d$ without imposing any separation conditions. In this context, randomness arises from the matrices in the defining semigroup, which are random yet…

Dynamical Systems · Mathematics 2025-05-08 Balázs Bárány , Antti Käenmäki , Michał Rams

We classify maximal systems of arcs which intersect at most once on the 4-punctured sphere.

Geometric Topology · Mathematics 2021-08-02 Paul Tee

Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, and let $U$ be a subset of $X$ whose complement is compact. We use the exponential mixing results for diagonalizable flows on $X$ to give upper estimates for the…

Dynamical Systems · Mathematics 2019-08-27 Dmitry Kleinbock , Shahriar Mirzadeh

We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j \le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges…

Combinatorics · Mathematics 2018-03-08 Oliver Cooley , Mihyun Kang , Christoph Koch

We study natural measures on sets of beta-expansions and on slices through self similar sets. In the setting of beta-expansions, these allow us to better understand the measure of maximal entropy for the random beta-transformation and to…

Dynamical Systems · Mathematics 2013-07-09 Tom Kempton

We show that linear inequalities for entropies have a natural geometric interpretation in terms of Hausdorff and packing dimensions, using the point-to-set principle and known results about inequalities for complexities, entropies and the…

Information Theory · Computer Science 2023-05-01 Alexander Shen

We apply the theory of unimodular random rooted graphs to study the metric geometry of large, finite, bounded degree graphs whose diameter is proportional to their volume. We prove that for a positive proportion of the vertices of such a…

Metric Geometry · Mathematics 2020-12-02 Itai Benjamini , Tom Hutchcroft

We determine the Hausdorff dimension for the range of a class of pure jump Markov processes in $\mathbb{R}^d$, which turns out to be random and depends on the trajectories of these processes. The key argument is carried out through the SDE…

Probability · Mathematics 2017-08-22 Xiaochuan Yang

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…

Combinatorics · Mathematics 2022-08-26 Santiago Arenas-Velilla , Octavio Arizmendi

Cantor sets in \(\mathbb{R}\) are common examples of sets for which Hausdorff measures can be positive and finite. However, there exist Cantor sets for which no Hausdorff measure is supported and finite. The purpose of this paper is to try…

Metric Geometry · Mathematics 2017-05-03 Malin Palö Forsström

We examine the dimensions of the intersection of a subset $E$ of an $m$-ary Cantor space $\mathcal{C}^m$ with the image of a subset $F$ under a random isometry with respect to a natural metric. We obtain almost sure upper bounds for the…

Metric Geometry · Mathematics 2015-01-20 Casey Donoven , Kenneth Falconer

We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.

Algebraic Geometry · Mathematics 2018-01-15 Laurent Bonavero , Andreas Höring

For the simple random walks in percolation clusters on hyperbolic groups, we show that the associated harmonic measures are exact dimensional and their Hausdorff dimensions are equal to the entropy over the speed. Our method is inspired by…

Probability · Mathematics 2024-03-19 Kohki Sakamoto

We prove some geometric properties of sets in the first Heisenberg group whose Heisenberg Hausdorff dimension is the minimal or maximal possible in relation to their Euclidean one and the corresponding Hausdorff measures are positive and…

Classical Analysis and ODEs · Mathematics 2017-05-12 Pertti Mattila , Laura Venieri

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

Probability · Mathematics 2014-11-14 Nicolas Curien , Igor Kortchemski

The intersection growth of a group $G$ is the asymptotic behavior of the index of the intersection of all subgroups of $G$ with index at most $n$, and measures the Hausdorff dimension of $G$ in profinite metrics. We study intersection…

Group Theory · Mathematics 2013-12-06 Ian Biringer , Khalid Bou-Rabee , Martin Kassabov , Francesco Matucci