Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Breadth first search coding of multitype forests with application to Lamperti representation

Abstract : We obtain a bijection between some set of multidimensional sequences and this of $d$-type plane forests which is based on the breadth first search algorithm. This coding sequence is related to the sequence of population sizes indexed by the generations, through a Lamperti type transformation. The same transformation in then obtained in continuous time for multitype branching processes with discrete values. We show that any such process can be obtained from a $d^2$ dimensional compound Poisson process time changed by some integral functional. Our proof bears on the discretisation of branching forests with edge lengths.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01070585
Contributor : Loïc Chaumont <>
Submitted on : Wednesday, October 1, 2014 - 5:09:08 PM
Last modification on : Monday, March 9, 2020 - 6:15:54 PM
Document(s) archivé(s) le : Friday, January 2, 2015 - 11:32:15 AM

File

L-Chaumont.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01070585, version 1

Collections

Citation

Loïc Chaumont. Breadth first search coding of multitype forests with application to Lamperti representation. 2014. ⟨hal-01070585⟩

Share

Metrics

Record views

264

Files downloads

196