Related papers: A Simpler Proof of Kakutani's Conjecture on Random…

Kakutani's random interval-splitting process iteratively divides, via a uniformly random splitting point, the largest sub-interval in a partition of the unit interval. The length of the longest sub-interval after $n$ steps, suitably centred…

Substitution schemes provide a classical method for constructing tilings of Euclidean space. Allowing multiple scales in the scheme, we introduce a rich family of sequences of tile partitions generated by the substitution rule, which…

The interest for uniformly distributed (u.d.) sequences of points, in particular for sequences with small discrepancy, arises from various applications. For instance, low-discrepancy sequences, which are sequences with a discrepancy of…

We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according…

We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…

We consider a Markovian evolution on point processes, the $\Psi$--process, on the unit interval in which points are added according to a rule that depends only on the spacings of the existing point configuration. Having chosen a spacing, a…

We propose and analyze a generalized splitting method to sample approximately from a distribution conditional on the occurrence of a rare event. This has important applications in a variety of contexts in operations research, engineering,…

We study statistics of tiles in random incommensurable Kakutani sequences of partitions in $\mathbb{R}^d$. We provide explicit formulas that illustrate the dependence on the combinatorial structure, the volumes of the participating tiles…

We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…

In this paper we will study uniformly distributed sequences of partitions of [0,1], a concept which has been introduced by Kakutani in 1976. We will construct new families of u.d. sequences of partitions and study relations with the…

We consider a random interval splitting process, in which the splitting rule depends on the empirical distribution of interval lengths. We show that this empirical distribution converges to a limit almost surely as the number of intervals…

Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…

We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…

We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to…

Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…

We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

We investigate a class of stochastic fragmentation processes involving stable and unstable fragments. We solve analytically for the fragment length density and find that a generic algebraic divergence characterizes its small-size tail.…

We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…

As predictive algorithms grow in popularity, using the same dataset to both train and test a new model has become routine across research, policy, and industry. Sample-splitting attains valid inference on model properties by using separate…