Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Alessandra Caraceni"'
The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for this class.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69149685ab77448f712203d71306125d
Publikováno v:
Electron. J. Probab.
We consider a natural local dynamic on the set of all rooted planar maps with $n$ edges that is in some sense analogous to “edge flip” Markov chains, which have been considered before on a variety of combinatorial structures (triangulations of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::247d7754e9d1427e4f36ba2bdbd762a7
http://arxiv.org/abs/2001.04166
http://arxiv.org/abs/2001.04166
Autor:
Alessandra Caraceni, Nicolas Curien
Publikováno v:
Sojourns in Probability Theory and Statistical Physics-III
Sojourns in Probability Theory and Statistical Physics-III, pp.138-165, 2019, ⟨10.1007/978-981-15-0302-3_5⟩
Springer Proceedings in Mathematics & Statistics ISBN: 9789811503016
Sojourns in Probability Theory and Statistical Physics-III, pp.138-165, 2019, ⟨10.1007/978-981-15-0302-3_5⟩
Springer Proceedings in Mathematics & Statistics ISBN: 9789811503016
We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite quadrangulations of the h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d0732a952bcf802fb5e99223d777098
https://hal-universite-paris-saclay.archives-ouvertes.fr/hal-03287399
https://hal-universite-paris-saclay.archives-ouvertes.fr/hal-03287399
We establish the first polynomial upper bound for the mixing time of random edge flips on rooted quadrangulations: we show that the spectral gap of the edge flip Markov chain on quadrangulations with $n$ faces admits, up to constants, an upper bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92cc812c4aa4bcdd1fde90e9bb90ba9c
https://ora.ox.ac.uk/objects/uuid:1d9cf656-3abd-46c8-b08f-a3eb2bea68e2
https://ora.ox.ac.uk/objects/uuid:1d9cf656-3abd-46c8-b08f-a3eb2bea68e2
Autor:
Alessandra Caraceni
Publikováno v:
Ann. Inst. H. Poincaré Probab. Statist. 52, no. 4 (2016), 1667-1686
A planar map is outerplanar if all its vertices belong to the same face. We show that random uniform outerplanar maps with $n$ vertices suitably rescaled by a factor $1/ \sqrt{n}$ converge in the Gromov-Hausdorff sense to $\displaystyle{\frac{7 \sqrt