English
Related papers

Related papers: A New Construction of Forests with Low Visibility

200 papers

Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point…

Probability · Mathematics 2017-11-06 Matthias Schulte , Christoph Thaele

A macroscopic characterization of fractals showing up a structural transition from dense to multibranched growth is made using optical diffraction theory. Such fractals are generated via the numerical solution of the 2D Poisson and…

Condensed Matter · Physics 2009-10-22 F. Perez-Rodriguez , Wei Wang , E. Canessa

Representations of population models in terms of countable systems of particles are constructed, in which each particle has a `type', typically recording both spatial position and genetic type, and a level. For finite intensity models, the…

Probability · Mathematics 2018-06-05 Alison M. Etheridge , Thomas G. Kurtz

Given i.i.d samples from some unknown continuous density on hyper-rectangle $[0, 1]^d$, we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a…

Machine Learning · Statistics 2015-09-24 Kun Yang , Hao Su , Wing Hung Wang

We give a construction of an infinite set of points $A$ in $\mathbb{R}^2$ such that any subset $P\subseteq A$ has a constant density subset $P'$ with no three points collinear and yet $A$ cannot be separated into finitely many subsets such…

Combinatorics · Mathematics 2026-02-26 Moe Putterman , Mehtaab Sawhney , Gregory Valiant

On a locally finite point set, a navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a tree known as the navigation tree. In this article, we analyze the properties of…

Probability · Mathematics 2009-09-29 Charles Bordenave

Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…

Combinatorics · Mathematics 2018-02-16 Steve Butler , Misa Hamanaka , Marie Hardt

Project a collection of points on the high-dimensional sphere onto a random direction. If most of the points are sufficiently far from one another in an appropriate sense, the projection is locally close in distribution to the Poisson point…

Probability · Mathematics 2011-06-27 Itai Benjamini , Oded Schramm , Sasha Sodin

Let $P$ be a simple polygon with $n$ vertices, and let $A$ be a set of $m$ points or line segments inside $P$. We develop data structures that can efficiently count the number of objects from $A$ that are visible to a query point or a query…

Computational Geometry · Computer Science 2022-01-11 Kevin Buchin , Bram Custers , Ivor van der Hoog , Maarten Löffler , Aleksandr Popov , Marcel Roeloffzen , Frank Staals

The z > 2 Lyman-alpha (Lya) forest traces the underlying dark-matter distribution on large scales and, given sufficient sightlines, can be used to create 3D maps of large-scale structure. We examine the observational requirements to…

Cosmology and Nongalactic Astrophysics · Physics 2014-05-23 Khee-Gan Lee , Joseph F. Hennawi , Martin White , Rupert Croft , Melih Ozbek

Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a…

Combinatorics · Mathematics 2017-09-12 Zhanar Berikkyzy , Steve Butler , Jay Cummings , Kristin Heysse , Paul Horn , Ruth Luo , Brent Moran

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

Classical Analysis and ODEs · Mathematics 2026-04-21 Vjekoslav Kovač , Adian Anibal Santos Sepčić

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…

Statistical Mechanics · Physics 2014-12-25 Z. Kalay , E. Ben-Naim

For any countable group with infinite conjugacy classes we construct a family of forests on the group. For each of them there is a random walk on the group with the property that its sample paths almost surely converge to the geometric…

Group Theory · Mathematics 2019-03-07 Anna Erschler , Vadim Kaimanovich

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

We study a pinned variant of Bourgain's theorem, concerning the occurrence of affine copies of $k$-point patterns in $\mathbb{R}^d$. Focusing on the case $k=2$, which corresponds to pinned distances, we show that the classical conclusion…

Classical Analysis and ODEs · Mathematics 2025-09-03 Chenjian Wang

I discuss and illustrate the development of large-scale structure in the Universe, emphasising in particular the physical processes and cosmological parameters that most influence the observationally accessible aspects of structure at large…

Astrophysics · Physics 2007-05-23 Simon D. M. White

Bennett, Iosevich and Taylor proved that compact subsets of ${\Bbb R}^d$, $d \ge 2$, of Hausdorff dimensions greater than $\frac{d+1}{2}$ contain chains of arbitrary length with gaps in a non-trivial interval. In this paper we generalize…

Classical Analysis and ODEs · Mathematics 2019-03-08 Alex Iosevich , Krystal Taylor

The aim of this article is to study the forest composed by point-to-line geodesics in the last-passage percolation model with exponential weights. We will show that the location of the root can be described in terms of the maxima of a…

Probability · Mathematics 2015-10-07 Sergio I. Lopez , Leandro P. R. Pimentel

We construct a function on the real line supported on a set of finite measure whose spectrum has density zero.

Classical Analysis and ODEs · Mathematics 2017-02-01 Fedor Nazarov , Alexander Olevskii