arXiv subjects
Publications and source records attributed to Philippe Chassaing.
We consider four examples of combinatorial triangles $\left(T(n,k)\right)_{0\le k\le n}$ (Pascal, Stirling of both types, Euler) : through saddle-point asymptotics, their \emph{Pascal's formulas} define four vector fields, together with their field lines that turn out to be the conjectured limit of sample paths of four well known Markov chains. We prove this asymptotic behaviour in three of the four cases.
In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution, we prove that the limit law of the normalized lengths of the smallest Lyndon factors is a variant of the stickbreaking process. Convergence of the distribution of the lengths of the longest factors to a Poisson-Dirichlet distribution follows. Secondly we consider the \emph{standard factorization} of random \emph{Lyndon word} : we prove that the distribution of the normalized length of the standard right factor of a random $n$-letters long Lyndon word, derived from such an alphabet, converges, when $n$ is large, to: $$μ(dx)=p_1 δ_{1}(dx) + (1-p_1) \mathbf{1}_{[0,1)}(x)dx,$$ in which $p_1$ denotes the probability of the smallest letter of the alphabet.
In the coupon collector problem with $n$ items, the collector needs a random number of tries $T_n\simeq n\ln n$ to complete the collection. Also, after $nt$ tries, the collector has secured approximately a fraction $ζ_\infty(t)=1-e^{-t}$ of the complete collection, so we call $ζ_\infty$ the (asymptotic) \emph{completion curve}. In this paper, for $ν>0$, we address the asymptotic shape $ζ(ν,.) $ of the completion curve under the condition $T_n\leq \left( 1+ν\right) n$, i.e. assuming that the collection is \emph{completed unlikely fast}. As an application to the asymptotic study of complete accessible automata, we provide a new derivation of a formula due to Koršunov.
We exhibit a Probabilistic Cellular Automaton (PCA) on the integers with an alphabet and a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether uniqueness of the invariant measure implies ergodicity for a PCA.
F.Giroire has recently proposed an algorithm which returns the approximate number of distincts elements in a large sequence of words, under strong constraints coming from the analysis of large data bases. His estimation is based on statistical properties of uniform random variables in $[0,1]$. In this note we propose an optimal estimation, using Kullback information and estimation theory.
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement. A population protocol corresponds to a collection of anonymous agents, modeled by finite automata, that interact with one another to carry out computations, by updating their states, using some rules. Their computational power has been investigated under several hypotheses but always when restricted to finite size populations. In particular, predicates stably computable in the original model have been characterized as those definable in Presburger arithmetic. We study mathematically the convergence of population protocols when the size of the population goes to infinity. We do so by giving general results, that we illustrate through the example of a particular population protocol for which we even obtain an asymptotic development. This example shows in particular that these protocols seem to have a rather different computational power when a huge population hypothesis is considered.
Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit random surface can be described in terms of a birth and death process and a sequence of multitype Galton--Watson trees. As a consequence, we find that the expected volume of the ball of radius $r$ around a marked point in the limit random surface is $Θ(r^4)$.
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m<n empty places. For a non computer science-minded reader, we shall use the metaphore of n cars parking on m places: each car chooses a place at random, and if this place k is occupied, the car tries successively k+1, k+2, ... until it finds an empty place (with the convention that place m+1 is actually place 1). Pittel [42] proves that when l/m goes to some positive limit a < 1, the size of the largest block of consecutive cars is O(log m). In this paper we examine at which level for n a phase transition occurs for the largest block of consecutive cars between o(m) and O(m). The intermediate case reveals an interesting behaviour of sizes of blocks, related to the standard additive coalescent in the same way as the sizes of connected components of the random graph are related to the multiplicative coalescent.
Starting with a monodisperse configuration with $n$ size-1 particles, an additive Marcus-Lushnikov process evolves until it reaches its final state (a unique particle with mass $n$). At each of the $n-1$ steps of its evolution, a merging cost is incurred, that depends on the sizes of the two particles involved, and on an independent random factor. This paper deals with the asymptotic behaviour of the cumulated costs up to the $k$th clustering, under various regimes for $(n,k)$, with applications to the study of Union--Find algorithms.
We derive the distribution of the center of mass $S$ of the integrated superBrownian excursion (ISE) {from} the asymptotic distribution of the Wiener index for simple trees. Equivalently, this is the distribution of the integral of a Brownian snake. A recursion formula for the moments and asymptotics for moments and tail probabilities are derived.
In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations, and Aldous' Integrated SuperBrownian Excursion (ISE). As a consequence, the radius r_n of a random quadrangulation with n faces is shown to converge, up to scaling, to the width r=R-L of the support of the one-dimensional ISE. More generally the distribution of distances to a random vertex in a random quadrangulation is described in its scaled limit by the random measure ISE shifted to set the minimum of its support in zero. The first combinatorial ingredient is an encoding of quadrangulations by trees embedded in the positive half-line, reminiscent of Cori and Vauquelin's well labelled trees. The second step relates these trees to embedded (discrete) trees in the sense of Aldous, via the conjugation of tree principle, an analogue for trees of Vervaat's construction of the Brownian excursion from the bridge. From probability theory, we need a new result of independent interest: the weak convergence of the encoding of a random embedded plane tree by two contour walks to the Brownian snake description of ISE. Our results suggest the existence of a Continuum Random Map describing in term of ISE the scaled limit of the dynamical triangulations considered in two-dimensional pure quantum gravity.