Related papers: A New Construction of Forests with Low Visibility
An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\in\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow…
The dynamics of a rain forest is extremely complex involving births, deaths and growth of trees with complex interactions between trees, animals, climate, and environment. We consider the patterns of recruits (new trees) and dead trees…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
We study systems of particles on a line which have a maximum, are locally finite and evolve with independent increments. ``Quasi-stationary states'' are defined as probability measures, on the \sigma-algebra generated by the gap variables,…
For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…
Set prediction is about learning to predict a collection of unordered variables with unknown interrelations. Training such models with set losses imposes the structure of a metric space over sets. We focus on stochastic and underdefined…
In Random Forests, proximity distances are a metric representation of data into decision space. By observing how changes in input map to the movement of instances in this space we are able to determine the independent contribution of each…
Using the Newman and Penrose spin coefficient (NP) formalism, we examine the full Bianchi identities of general relativity in the context of gravitational lensing, where the matter and space-time curvature are projected into a lens plane…
Motivated by the universal obstruction to the deformation quantization of Poisson structures in infinite dimensions we introduce the notion of quantizable odd Lie bialgebra. The main result of the paper is a construction of a highly…
A basic question about the directed landscape is how much of it can be reconstructed simply by knowing the shapes of its geodesics. We prove that the directed landscape can be reconstructed from the shapes of its semi-infinite geodesics. In…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
We propose methods for density estimation and data synthesis using a novel form of unsupervised random forests. Inspired by generative adversarial networks, we implement a recursive procedure in which trees gradually learn structural…
Let X(t) be a Gaussian random field R d $\rightarrow$ R. Using the notion of (d -- 1)-integral geometric measures, we establish a relation between (a) the volume of the level set (b) the number of crossings of the restriction of the random…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…
When light from a distant source object, like a galaxy or a supernova, travels towards us, it is deflected by massive objects that lie on its path. When the mass density of the deflecting object exceeds a certain threshold, multiple, highly…
Let $M$ be a smooth closed orientable manifold and $\mathcal{P}(M)$ the space of Poisson structures on $M$. We construct a Poisson bracket on $\mathcal{P}(M)$ depending on a choice of volume form. The Hamiltonian flow of the bracket acts on…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
We construct a natural discrete random field on $\mathbb{Z}^{d}$, $d\geq 5$ that converges weakly to the bi-Laplacian Gaussian field in the scaling limit. The construction is based on assigning i.i.d. Bernoulli random variables on each…
In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…