Jean-François Marckert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jean-François Marckert has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Abdelkader Mokkadem
1 shared publication- Abdelkader Mokkadem
Université de Versailles Saint-Quentin Département de Mathématiques 45, Avenue des Etats-Unis 78035 Versailles Cedex France
1 shared publication
Latest Publications
- 5 January 2004
- Published by Wiley in Random Structures & Algorithms
- Vol. 24 (2) , 118-132
The rotation correspondence is asymptotically a dilatation
- 5 January 2004
- Published by Wiley in Random Structures & Algorithms
- Vol. 24 (2) , 118-132
The rotation correspondence is asymptotically a dilatation
- 1 October 2003
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 16 (4) , 1015-1046
States Spaces of the Snake and Its Tour—Convergence of the Discrete Snake
- 1 October 2003
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 16 (4) , 1015-1046
States Spaces of the Snake and Its Tour—Convergence of the Discrete Snake
- 1 September 2003
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 40 (3) , 671-689
Ladder variables, internal structure of Galton–Watson trees and finite branching random walks
In this paper, we consider Galton–Watson trees conditioned by size. We show that the number ofk-ancestors (ancestors that havekchildren) of a nodeuis (almost) proportional to its depth. Thek,j-ancestors are also studied. The methods rely on the study of ladder variables on an associated random walk. We also give an application to finite branching random walks.
- 1 September 2003
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 40 (3) , 671-689
Ladder variables, internal structure of Galton–Watson trees and finite branching random walks
In this paper, we consider Galton–Watson trees conditioned by size. We show that the number ofk-ancestors (ancestors that havekchildren) of a nodeuis (almost) proportional to its depth. Thek,j-ancestors are also studied. The methods rely on the study of ladder variables on an associated random walk. We also give an application to finite branching random walks.
- 20 June 2001
- Published by Wiley in Random Structures & Algorithms
- Vol. 18 (4) , 364-380
Parking with density
- 20 June 2001
- Published by Wiley in Random Structures & Algorithms
- Vol. 18 (4) , 364-380
Parking with density