Related papers: Stretch IDLA
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
Self-destructive percolation with parameters $p,\delta$ is obtained by taking a site percolation configuration with parameter $p$, closing all sites belonging to infinite clusters, then opening every closed site with probability $\delta$,…
We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a…
Dense forests are discrete subsets of Euclidean space which are uniformly close to all sufficiently long line segments. The degree of density of a dense forest is measured by its visibility function. We show that cut-and-project…
We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with…
It has long been argued that the continuum limit of the 3D Ising model is equivalent to a string theory. Unfortunately, in the usual starting point for this equivalence -- a certain lattice theory of surfaces -- it is not at all obvious how…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
We introduce a new dynamical system: the wind-tree tiling billiards. This system studies trajectories of a ray in Euclidean space which has a negative refractive index when encountering rectangular obstacles located at lattice points. We…
We study an equilibrium statistical mechanical model of tree graphs which are made up of a linear subgraph (the spine) to which leaves are attached. We prove that the model has two phases, a generic phase where the spine becomes infinitely…
For the exactly solvable model of exponential last passage percolation on $\mathbb{Z}^2$, it is known that given any non-axial direction, all the semi-infinite geodesics starting from points in $\mathbb{Z}^2$ in that direction almost surely…
Consider the following forest-fire model on the upper half-plane of the triangular lattice: Each site can be "vacant" or "occupied by a tree". At time 0 all sites are vacant. Then the process is governed by the following random dynamics:…
The periodic wind-tree model is an infinite billiard in the plane with identical rectangular scatterers disposed at each integer point. We prove that independently of the size of the scatterers, generically with respect to the angle, the…
We present evidence that the number of string/$M$ theory vacua consistent with experiments is a finite number. We do this both by explicit analysis of infinite sequences of vacua and by applying various mathematical finiteness theorems.
Tree Regular Model Checking (TRMC) is the name of a family of techniques for analyzing infinite-state systems in which states are represented by terms, and sets of states by Tree Automata (TA). The central problem in TRMC is to decide…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…
We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…