Add to ORKGIn a recent paper, Neuts, Rauschenberg and Li [10] examined, by computer experimentation, four different procedures to randomly partition the interval [0,1] into m intervals. The present paper presents some new theoretical results on one of the partitioning schemes. That scheme is called Random Interval (RI); it starts with a first random point in [0,1] and places the kth point at random in a subinterval randomly picked from the current k subintervals (1<k<m)
International audienceAn interval of a permutation is a consecutive substring consisting of consecut...
There are many randomness notions. On the classical account, many of them are about whether a given ...
AbstractOnline interval selection is a problem in which intervals arrive one by one, sorted by their...
Abstract[0, 1] is partitioned by randomly splitting the longest subinterval, of length L, into two i...
We consider the following fragmentation model of the unit interval $\QTR{Bbb}{I}$: we start fragment...
The well-known relation between random division of an interval and the Poisson process is interprete...
Given an interval we choose a point in the interval and one of the two subintervals thus obtained in...
Baake M, Shamsara E. The recombination equation for interval partitions. Monatshefte für Mathematik....
The paper deals with the distribution of certain functions of distances between any two points of a ...
This is the first of a series of papers treating randomly sampled random processes. Spectral analysi...
AbstractThree random fragmentation of an interval processes are investigated. For each of them, ther...
This paper presents some general formulas for random partitions of a finite set derived by Kingman’s...
In the original Renyi statement of the “parking” problem open intervals of unit length fill a segmen...
The problem of partitioning a sequence of n real numbers into p intervals is considered. The goal is...
Let X1, X2,…, be i.i.d. random variables, which are uniformly distributed on [0,1]. Further let I1(0...
International audienceAn interval of a permutation is a consecutive substring consisting of consecut...
There are many randomness notions. On the classical account, many of them are about whether a given ...
AbstractOnline interval selection is a problem in which intervals arrive one by one, sorted by their...
Abstract[0, 1] is partitioned by randomly splitting the longest subinterval, of length L, into two i...
We consider the following fragmentation model of the unit interval $\QTR{Bbb}{I}$: we start fragment...
The well-known relation between random division of an interval and the Poisson process is interprete...
Given an interval we choose a point in the interval and one of the two subintervals thus obtained in...
Baake M, Shamsara E. The recombination equation for interval partitions. Monatshefte für Mathematik....
The paper deals with the distribution of certain functions of distances between any two points of a ...
This is the first of a series of papers treating randomly sampled random processes. Spectral analysi...
AbstractThree random fragmentation of an interval processes are investigated. For each of them, ther...
This paper presents some general formulas for random partitions of a finite set derived by Kingman’s...
In the original Renyi statement of the “parking” problem open intervals of unit length fill a segmen...
The problem of partitioning a sequence of n real numbers into p intervals is considered. The goal is...
Let X1, X2,…, be i.i.d. random variables, which are uniformly distributed on [0,1]. Further let I1(0...
International audienceAn interval of a permutation is a consecutive substring consisting of consecut...
There are many randomness notions. On the classical account, many of them are about whether a given ...
AbstractOnline interval selection is a problem in which intervals arrive one by one, sorted by their...