Related papers: From Hammersley's lines to Hammersley's trees
We study the distribution of prime chains, which are sequences p_1,...,p_k of primes for which p_{j+1}\equiv 1\pmod{p_j} for each j. We give estimates for the number of chains with p_k\le x (k variable), and the number of chains with p_1=p…
When modeling network data using a latent position model, it is typical to assume that the nodes' positions are independently and identically distributed. However, this assumption implies the average node degree grows linearly with the…
Without access to large compute clusters, building random forests on large datasets is still a challenging problem. This is, in particular, the case if fully-grown trees are desired. We propose a simple yet effective framework that allows…
In this paper we investigate networks whose evolution is governed by the interaction of a random assembly process and an optimization process. In the first process, new nodes are added one at a time and form connections to randomly selected…
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…
The main goal of this paper is to provide an algorithm for the random sampling of Butcher trees and the probabilistic numerical solution of ordinary differential equations (ODEs). This approach complements and simplifies a recent approach…
We analyse a maximum-likelihood approach for combining phylogenetic trees into a larger `supertree'. This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description…
Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…
We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
The problem of selecting a small, yet high quality subset of patterns from a larger collection of itemsets has recently attracted lot of research. Here we discuss an approach to this problem using the notion of decomposable families of…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds…
We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…