Jean-François Marckert
University of Bordeaux
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Jean-François Marckert.
Annals of Probability | 2006
Jean-François Marckert; Abdelkader Mokkadem
Consider qn a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with n faces. In this paper we show that, when n goes to +∞, qn suitably normalized converges weakly in a certain sense to a random limit object, which is continuous and compact, and that we name the Brownian map. The same result is shown for a model of rooted quadrangulations and for some models of rooted quadrangulations with random edge lengths. A metric space of rooted (resp. pointed) abstract maps that contains the model of discrete rooted (resp. pointed) quadrangulations and the model of the Brownian map is defined. The weak convergences hold in these metric spaces.
Annals of Probability | 2007
Jean-François Marckert; Grégory Miermont
It is conjectured in the Physics literature that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a limiting surface whose law does not depend, up to scaling factors, on details of the class of maps that are sampled. Previous works on the topic, starting with Chassaing & Schaeffer, have shown that the radius of a random quadrangulation with
Random Structures and Algorithms | 2004
Jean-François Marckert
n
Random Structures and Algorithms | 2011
Jean-François Marckert; Grégory Miermont
faces converges in distribution once rescaled by
Mathematics in Computer Science | 2000
Philippe Chassaing; Jean-François Marckert; Marc Yor
n^{1/4}
Random Structures and Algorithms | 2014
Nicolas Broutin; Jean-François Marckert
to the diameter of the Brownian snake, up to a scaling constant. Using a bijection due to Bouttier, di Francesco \&\ Guitter between bipartite planar maps and a family of labeled trees, we show the corresponding invariance principle for a class of random maps that follow a Boltzmann distribution: the radius of such maps, conditioned to have
Random Structures and Algorithms | 2002
Jean-François Marckert; Alois Panholzer
n
Information & Computation | 2007
Christian Lavault; Jean-François Marckert; Vlady Ravelomanana
faces (or
Discrete and Computational Geometry | 2013
Imre Bárány; Jean-François Marckert; Matthias Reitzner
n
Electronic Journal of Statistics | 2008
Jean-François Marckert
vertices) and under a criticality assumption, converges in distribution once rescaled by