The lineage process in Galton--Watson trees and globally centered discrete snakes

We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally centered discrete snake'' that extends the usual settings in which the displacements are supposed centered. We show that under some additional moment conditions, when $n$ goes to $+\infty$, ``globally centered discrete snakes'' converge to the Brownian snake. The proof relies on a precise study of the lineage of the nodes in a Galton--Watson tree conditioned by the size, and their links with a multinomial process [the lineage of a node $u$ is the vector indexed by $(k,j)$ giving the number of ancestors of $u$ having $k$ children and for which $u$ is a descendant of the $j$th one]. Some consequences concerning Galton--Watson trees conditioned by the size are also derived.Comment: Published in at http://dx.doi.org/10.1214/07-AAP450 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Directed animals, quadratic and rewriting systems

A directed animal is a percolation cluster in the directed site percolation model. The aim of this paper is to exhibit a strong relation between the problem of computing the generating function \G of directed animals on the square lattice, counted according to the area and the perimeter, and the problem of solving a system of quadratic equations involving unknown matrices. We present some solid evidence that some infinite explicit matrices, the fixed points of a rewriting like system are the natural solutions to this system of equations: some strong evidence is given that the problem of finding \G reduces to the problem of finding an eigenvector to an explicit infinite matrix. Similar properties are shown for other combinatorial questions concerning directed animals, and for different lattices.Comment: 27 page

The combinatorics of the colliding bullets problem

The finite colliding bullets problem is the following simple problem: consider a gun, whose barrel remains in a fixed direction; let $(V_i)_{1\le i\le n}$ be an i.i.d.\ family of random variables with uniform distribution on $[0,1]$; shoot $n$ bullets one after another at times $1,2,\dots, n$, where the $i$th bullet has speed $V_i$. When two bullets collide, they both annihilate. We give the distribution of the number of surviving bullets, and in some generalisation of this model. While the distribution is relatively simple (and we found a number of bold claims online), our proof is surprisingly intricate and mixes combinatorial and geometric arguments; we argue that any rigorous argument must very likely be rather elaborate.Comment: 29 page

Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak in a trajectory is a local maximum. In this paper, we condition the families of trajectories to have a given number of peaks. We show that, asymptotically, the main effect of setting the number of peaks is to change the order of magnitude of the trajectories. The counting process of the peaks, that encodes the repartition of the peaks in the trajectories, is also studied. It is shown that suitably normalized, it converges to a Brownian bridge which is independent of the limiting trajectory. Applications in terms of plane trees and parallelogram polyominoes are also provided

Some families of increasing planar maps

Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under two different distributions. We show that the uniform distribution on this set of maps converges, for a topology of local convergence, to a distribution on the set of infinite maps. In the other hand, we show that rescaled by $n^{1/2}$, they converge for the Gromov-Hausdorff topology on metric spaces to the continuum random tree introduced by Aldous. Under a distribution induced by a natural random construction, the distance between random points rescaled by $(6/11)\log n$ converge to 1 in probability. We obtain similar asymptotic results for a family of increasing quadrangulations