Search

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1 appears. Then, we use these martingales to define new probability measures via a Girsanov transformation and describe the distribution of the random trees under these new probabilities.

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of subgraph sampling converge. The edge-weights are taken from a general Polish space, which also covers the case of decorated graphs. Here, graphs can be either directed or undirected. Starting from a distance $d_m$ inducing the weak topology on measures, we define a cut distance on probability-graphons, making it a Polish space, and study the properties of this cut distance. In particular, we exhibit a tightness criterion for probability-graphons related to relative compactness in the cut distance. We also prove that under some conditions on the distance $d_m$, which are satisfied for some well-know distances like the Prohorov distance, and the Fortet-Mourier and Kantorovitch-Rubinstein norms, the topology induced by the cut distance on the spaceof probability-graphons is independent from the choice of $d_m$. Eventually, we prove that this topology coincides with the topology induced by the convergence in distribution of the sampled subgraphs.

We study the maximal degree of (sub)critical L{\'e}vy trees which arise as the scaling limits of Bienaym{\'e}-Galton-Watson trees. We determine the genealogical structure of large nodes and establish a Poissonian decomposition of the tree along those nodes. Furthermore, we make sense of the distribution of the L{\'e}vy tree conditioned to have a fixed maximal degree. In the case where the L{\'e}vy measure is diffuse, we show that the maximal degree is realized by a unique node whose height is exponentially distributed and we also prove that the conditioned L{\'e}vy tree can be obtained by grafting a L{\'e}vy forest on an independent size-biased L{\'e}vy tree with a degree constraint at a uniformly chosen leaf. Finally, we show that the L{\'e}vy tree conditioned on having large maximal degree converges locally to an immortal tree (which is the continuous analogue of the Kesten tree) in the critical case and to a condensation tree in the subcritical case. Our results are formulated in terms of the exploration process which allows to drop the Grey condition.

We consider a Feller diffusion (Zs, s $\ge$ 0) (with diffusion coefficient $\sqrt$ 2$\beta$ and drift $\theta$ $\in$ R) that we condition on {Zt = at}, where at is a deterministic function, and we study the limit in distribution of the conditioned process and of its genealogical tree as t $\rightarrow$ +$\infty$. When at does not increase too rapidly, we recover the standard size-biased process (and the associated genealogical tree given by the Kesten's tree). When at behaves as $\alpha$$\beta$ 2 t 2 when $\theta$ = 0 or as $\alpha$ e 2$\beta$|$\theta$|t when $\theta$ = 0, we obtain a new process whose distribution is described by a Girsanov transformation and equivalently by a SDE with a Poissonian immigration. Its associated genealogical tree is described by an infinite discrete skeleton (which does not satisfy the branching property) decorated with Brownian continuum random trees given by a Poisson point measure. As a by-product of this study, we introduce several sets of trees endowed with a Gromovtype distance which are of independent interest and which allow here to define in a formal and measurable way the decoration of a backbone with a family of continuum random trees.

We give an invariance principle for very general additive functionals of conditioned Bienaym{\'e}-Galton-Watson trees in the global regime when the offspring distribution lies in the domain of attraction of a stable distribution, the limit being an additive functional of a stable L{\'e}vy tree. This includes the case when the offspring distribution has finite variance (the L{\'e}vy tree being then the Brownian tree). We also describe, using an integral test, a phase transition for toll functions depending on the size and height.

We consider the genealogical tree of a stationary continuous state branching process with immigration. For a sub-critical stable branching mechanism, we consider the genealogical tree of the extant population at some fixed time and prove that, up to a deterministic time-change, it is distributed as a continuous-time Galton-Watson process with immigration. We obtain similar results for a critical stable branching mechanism when only looking at immigrants arriving in some fixed time-interval. For a general sub-critical branching mechanism, we consider the number of individuals that give descendants in the extant population. The associated processes (forward or backward in time) are pure-death or pure-birth Markov processes, for which we compute the transition rates., Comment: 31 pages, 1 figure

We apply the penalization technique introduced by Roynette, Vallois, Yor for Brownian motion to Galton-Watson processes with a penalizing function of the form $P (x)s^x$ where P is a polynomial of degree p and s $\in$ [0, 1]. We prove that the limiting martingales obtained by this method are most of the time classical ones, except in the super-critical case for s = 1 (or s $\rightarrow$ 1) where we obtain new martingales. If we make a change of probability measure with this martingale, we obtain a multi-type Galton-Watson tree with p distinguished infinite spines.

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We identify the possible local limits of $\tau$n as n goes to infinity according to the growth rate of an. In the low regime, the local limit $\tau$ 0 is the Kesten tree, in the moderate regime the family of local limits, $\tau$ $\theta$ for $\theta$ $\in$ (0, +$\infty$), is distributed as $\tau$ conditionally on {W = $\theta$}, where W is the (non-trivial) limit of the renormalization of Zn. In the high regime, we prove the local convergence towards $\tau$ $\infty$ in the Harris case (finite support of the offspring distribution) and we give a conjecture for the possible limit when the offspring distribution has some exponential moments. When the offspring distribution has a fat tail, the problem is open. The proof relies on the strong ratio theorem for Galton-Watson processes. Those latter results are new in the low regime and high regime, and they can be used to complete the description of the (space-time) Martin boundary of Galton-Watson processes. Eventually, we consider the continuity in distribution of the local limits ($\tau$ $\theta$ , $\theta$ $\in$ [0, $\infty$]).

We consider the Brownian tree introduced by Aldous and the associated Q-process which consists in an infinite spine on which are grafted independent Brownian trees. We present a reversal procedure on these trees that consists in looking at the tree downward from its top: the branching points becoming leaves and leaves becoming branching points. We prove that the distribution of the tree is invariant under this reversal procedure, which provides a better understanding of previous results from Bi and Delmas (2016)., Comment: This is the second version of the preprint arXiv:1612.03715 that has been splitted into two papers

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study the local limit of these trees $\tau$n as n $\rightarrow$ $\infty$ and observe three distinct regimes: if (an, n $\in$ N *) grows slowly, the limit consists in an infinite spine decorated with finite trees (which corresponds to the size-biased tree for critical or subcritical offspring distributions), in an intermediate regime, the limiting tree is composed of an infinite skeleton (that does not satisfy the branching property) still decorated with finite trees and, if the sequence (an, n $\in$ N *) increases rapidly, a condensation phenomenon appears and the root of the limiting tree has an infinite number of offspring.

We consider a model of stationary population with random size given by a continuous state branching process with immigration with a quadratic branching mechanism. We give an exact elementary simulation procedure of the genealogical tree of $n$ individuals randomly chosen among the extant population at a given time. Then, we prove the convergence of the renormalized total length of this genealogical tree as $n$ goes to infinity, see also Pfaffelhuber, Wakolbinger and Weisshaupt (2011) in the context of a constant size population. The limit appears already in Bi and Delmas (2016) but with a different approximation of the full genealogical tree. The proof is based on the ancestral process of the extant population at a fixed time which was defined by Aldous and Popovic (2005) in the critical case.

Under minimal condition, we prove the local convergence of a critical multi-type Galton-Watson tree conditioned on having a large total progeny by types towards a multi-type Kesten's tree. We obtain the result by generalizing Neveu's strong ratio limit theorem for aperiodic random walks on Z^d .

We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a large number of marked vertices converges in distribution to the associated size-biased tree. We then apply this result to give the limit in distribution of a critical Galton-Watson tree conditioned on having a large number of protected nodes.

The main object of this course given in Hammamet (December 2014) is the so-called Galton-Watson process.We introduce in the first chapter of this course the framework of discrete random trees. We then use this framework to construct GW trees that describe the genealogy of a GW process. It is very easy to recover the GW process from theGW tree as it is just the number of individuals at each generation. We then give alternativeproofs of classical results on GW processes using the tree formalism. We focus in particular onthe extinction probability (which was the first question of F. Galton) and on the description ofthe processes conditioned on extinction or non extinction.In a second chapter, we focus on local limits of conditioned GW trees. In the critical andsub-critical cases, the population becomesa.s. extinct and the associated genealogical tree is finite. However, it has a small but positiveprobability of being large (this notion must be precised). The question that arises is to describethe law of the tree conditioned of being large, and to say what exceptional event has occurredso that the tree is not typical. A first answer to this question is due to H. Kesten whoconditioned a GW tree to reach height n and look at the limit in distribution when n tends toinfinity. There are however other ways of conditioning a tree to be large: conditioning on havingmany vertices, or many leaves... We present here very recent general results concerning this kindof problems due to the authors of this course and completed by results of X. He., Comment: Lecture given in Hammamet, December 2014

We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with an infinite spine has been treated in a previous paper. We focus here on the non-generic case, where the limit is a random tree with a node with infinite out-degree. This case corresponds to the so-called condensation phenomenon.

We give a necessary and sufficient condition for the convergence in distribution of a conditioned Galton-Watson tree to Kesten's tree. This yields elementary proofs of Kesten's result as well as other known results on local limit of conditioned Galton-Watson trees. We then apply this condition to get new results, in the critical and sub-critical cases, on the limit in distribution of a Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set.

Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the $\beta(3/2,1/2)$-coalescent. By considering a pruning procedure on stable Galton-Watson tree with $n$ labeled leaves, we give a representation of the discrete $\beta(1+\alpha,1-\alpha)$-coalescent, with $\alpha\in [1/2,1)$ starting from the trivial partition of the $n$ first integers. The construction can also be made directly on the stable continuum L{\'e}vy tree, with parameter $1/\alpha$, simultaneously for all $n$. This representation allows to use results on the asymptotic number of coalescence events to get the asymptotic number of cuts in stable Galton-Watson tree (with infinite variance for the reproduction law) needed to isolate the root. Using convergence of the stable Galton-Watson tree conditioned to have infinitely many leaves, one can get the asymptotic distribution of blocks in the last coalescence event in the $\beta(1+\alpha,1-\alpha)$-coalescent.

We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton-Watson sub-trees of the L\'{e}vy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate $\lambda$, see Duquesne and Le Gall (2002). The tree-valued process, as $\lambda$ increases, has been studied by Duquesne and Winkel (2007). Notice that we have a tree-valued process indexed by two parameters the pruning parameter $\theta$ and the intensity $\lambda$. Our main results are: construction and marginals of the pruning process, representation of the pruning process (forward in time that is as $\theta$ increases) and description of the growing process (backward in time that is as $\theta$ decreases) and distribution of the ascension time (or explosion time of the backward process) as well as the tree at the ascension time. A by-product of our result is that the super-critical L\'{e}vy trees independently introduced by Abraham and Delmas (2012) and Duquesne and Winkel (2007) coincide. This work is also related to the pruning of discrete Galton-Watson trees studied by Abraham, Delmas and He (2012).

Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous's continuum random tree, to construct a continuous state space process that has the same structure as the $\beta$-coalescent process up to some time change. These two constructions unable us to obtain results on the coalescent process such as the asymptotics on the number of coalescent events or the law of the blocks involved in the last coalescent event.

We perform a pruning procedure on a L\'evy tree and instead of throwing away the removed sub-tree, we regraft it on a given branch (not related to the L\'evy tree). We prove that the tree constructed by regrafting is distributed as the original L\'evy tree, generalizing a result where only Aldous's tree is considered. As a consequence, we obtain that the quantity which represents in some sense the number of cuts needed to isolate the root of the tree, is distributed as the height of a leaf picked at random in the L\'evy tree.

We give an explicit construction of the increasing tree-valued process introduced by Abraham and Delmas using a random point process of trees and a grafting procedure. This random point process will be used in companion papers to study record processes on L\'evy trees. We use the Poissonian structure of the jumps of the increasing tree-valued process to describe its behavior at the first time the tree grows higher than a given height. We also give the joint distribution of this exit time and the ascension time which corresponds to the first infinite jump of the tree-valued process.

We present an extension of the Gromov-Hausdorff metric on the set of compact metric spaces: the Gromov-Hausdorff-Prokhorov metric on the set of compact metric spaces endowed with a finite measure. We then extend it to the non-compact case by describing a metric on the set of rooted complete locally compact length spaces endowed with a locally finite measure. We prove that this space with the extended Gromov-Hausdorff-Prokhorov metric is a Polish space. This generalization is needed to define L\'evy trees, which are (possibly unbounded) random real trees endowed with a locally finite measure.

By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $\Theta$ which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit distribution of the number of cuts needed to isolate the root in a critical Galton-Watson tree. We also prove that this random variable can be obtained as the a.s. limit of the number of cuts needed to cut down the subtree of the continuum tree spanned by $n$ leaves.

We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous process $\{{\cal G}^*(u)\}$ by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that the process $\{{\cal G}(u)\}$ run until its ascension time has a representation in terms of $\{{\cal G}^*(u)\}$. A similar result was obtained by Aldous and Pitman (1998) in the special case of Poisson offspring distributions where they considered uniform pruning of Galton-Watson trees by adding marks on the edges of trees.

We present a construction of a L\'evy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov's theorem. We also extend the pruning procedure to this super-critical case. Let $\psi$ be a critical branching mechanism. We set $\psi_\theta(\cdot)=\psi(\cdot+\theta)-\psi(\theta)$. Let $\Theta=(\theta_\infty,+\infty)$ or $\Theta=[\theta_\infty,+\infty)$ be the set of values of $\theta$ for which $\psi_\theta$ is a branching mechanism. The pruning procedure allows to construct a decreasing L\'evy-CRT-valued Markov process $(\ct_\theta,\theta\in\Theta)$, such that $\mathcal{T}_\theta$ has branching mechanism $\psi_\theta$. It is sub-critical if $\theta>0$ and super-critical if $\theta<0$. We then consider the explosion time $A$ of the CRT: the smaller (negative) time $\theta$ for which $\mathcal{T}_\theta$ has finite mass. We describe the law of $A$ as well as the distribution of the CRT just after this explosion time. The CRT just after explosion can be seen as a CRT conditioned not to be extinct which is pruned with an independent intensity related to $A$. We also study the evolution of the CRT-valued process after the explosion time. This extends results from Aldous and Pitman on Galton-Watson trees. For the particular case of the quadratic branching mechanism, we show that after explosion the total mass of the CRT behaves like the inverse of a stable subordinator with index 1/2. This result is related to the size of the tagged fragment for the fragmentation of Aldous' CRT.

Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated L\'evy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using L\'evy snake techniques. We then prove that the resulting sub-tree after pruning is still a L\'evy continuum random tree. This last result is proved using the exploration process that codes the CRT, a special Markov property and martingale problems for exploration processes. We finally give the joint law under the excursion measure of the lengths of the excursions of the initial exploration process and the pruned one.

We consider an initial Eve-population and a population of neutral mutants, such that the total population dies out in finite time. We describe the evolution of the Eve-population and the total population with continuous state branching processes, and the neutral mutation procedure can be seen as an immigration process with intensity proportional to the size of the population. First we establish a Williams' decomposition of the genealogy of the total population given by a continuous random tree, according to the ancestral lineage of the last individual alive. This allows us give a closed formula for the probability of simultaneous extinction of the Eve-population and the total population.

We construct a continuous state branching process with immigration (CBI) whose immigration depends on the CBI itself and we recover a continuous state branching process (CB). This provides a dual construction of the pruning at nodes of CB introduced by the authors in a previous paper. This construction is a natural way to model neutral mutation. Using exponential formula, we compute the probability of extinction of the original type population in a critical or sub-critical quadratic branching, conditionally on the non extinction of the total population.

This paper deals with a method of tomographic reconstruction of radially symmetric objects from a single radiograph, in order to study the behavior of shocked material. The usual tomographic reconstruction algorithms such as generalized inverse or filtered back-projection cannot be applied here because data are very noisy and the inverse problem associated to single view tomographic reconstruction is highly unstable. In order to improve the reconstruction, we propose here to add some a priori assumptions on the looked after object. One of these assumptions is that the object is binary and consequently, the object may be described by the curves that separate the two materials. We present a model that lives in BV space and leads to a non local Hamilton-Jacobi equation, via a level set strategy. Numerical experiments are performed (using level sets methods) on synthetic objects.

In this paper, we propose an edge detection technique based on some local smoothing of the image followed by a statistical hypothesis testing on the gradient. An edge point being defined as a zero-crossing of the Laplacian, it is said to be a significant edge point if the gradient at this point is larger than a threshold $s(\eps)$ defined by: if the image $I$ is pure noise, then $\P(\norm{\nabla I}\geq s(\eps) \bigm| \Delta I = 0) \leq\eps$. In other words, a significant edge is an edge which has a very low probability to be there because of noise. We will show that the threshold $s(\eps)$ can be explicitly computed in the case of a stationary Gaussian noise. In images we are interested in, which are obtained by tomographic reconstruction from a radiograph, this method fails since the Gaussian noise is not stationary anymore. But in this case again, we will be able to give the law of the gradient conditionally on the zero-crossing of the Laplacian, and thus compute the threshold $s(\eps)$. We will end this paper with some experiments and compare the results with the ones obtained with some other methods of edge detection.

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in $\theta$ and discontinuous. In the $\alpha$-stable case the fragmentation is self-similar with index $1/\alpha$, with $\alpha \in (1,2)$ and the results are close to those Bertoin obtained for general self-similar fragmentations but with an additional assumtion which is not fulfilled here.

We consider the exploration process associated to the continuous random tree (CRT) built using a Levy process with no negative jumps. This process has been studied by Duquesne, Le Gall and Le Jan. This measure-valued Markov process is a useful tool to study CRT as well as super-Brownian motion with general branching mechanism. In this paper we prove this process is Feller, and we compute its infinitesimal generator on exponential functionals and give the corresponding martingale.

We consider the height process of a Levy process with no negative jumps, and its associated continuous tree representation. Using Levy snake tools developed by Duquesne and Le Gall, with an underlying Poisson process, we construct a fragmentation process, which in the stable case corresponds to the self-similar fragmentation described by Miermont. For the general fragmentation process we compute a family of dislocation measures as well as the law of the size of a tagged fragment. We also give a special Markov property for the snake which is interesting in itself.