Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Contat Alice"'
Publikováno v:
ESAIM: Proceedings and Surveys, Vol 74, Pp 19-37 (2023)
The first talk at the session Random trees and random forests “Journée MAS” (27/08/2021) was presented by I. Kortchemski. After a general up-to-date introduction to local and scaling limits of Bienaymé trees (which are discrete branching trees)
Externí odkaz:
https://doaj.org/article/7cc7b41e308f41839f23e1473d2d760d
Autor:
Chen, Linxiao, Contat, Alice
Consider a supercritical Bienaym\'e--Galton--Watson tree $ \mathcal{T}$ with geometric offspring distribution. Each vertex of this tree represents a parking spot which can accommodate at most one car. On the top of this tree, we add $(A_u : u \in \ma
Externí odkaz:
http://arxiv.org/abs/2402.05612
Autor:
Contat, Alice
Consider a rooted tree on the top of which we let cars arrive on its vertices. Each car tries to park on its arriving vertex but if it is already occupied, it drives towards the root of the tree and parks as soon as possible. In this article, we esta
Externí odkaz:
http://arxiv.org/abs/2312.04472
We consider the problem of finding the initial vertex (Adam) in a Barab\'asi--Albert tree process $(\mathcal{T}(n) : n \geq 1)$ at large times. More precisely, given $ \varepsilon>0$, one wants to output a subset $ \mathcal{P}_{ \varepsilon}(n)$ of v
Externí odkaz:
http://arxiv.org/abs/2303.04752
We study the Karp--Sipser core of a random graph made of a configuration model with vertices of degree $1,2$ and $3$. This core is obtained by recursively removing the leaves as well as their unique neighbors in the graph. We settle a conjecture of B
Externí odkaz:
http://arxiv.org/abs/2212.02463
Let $(A_u : u \in \mathbb{B})$ be i.i.d.~non-negative integers that we interpret as car arrivals on the vertices of the full binary tree $ \mathbb{B}$. Each car tries to park on its arrival node, but if it is already occupied, it drives towards the r
Externí odkaz:
http://arxiv.org/abs/2205.15932
Autor:
Contat, Alice
We give new equations which characterize the generating functions of planar quadrangulations and planar triangulations, with zero, one or two boundaries. The proof is inspired by the Lackner--Panholzer last car decomposition of parking trees (arXiv:1
Externí odkaz:
http://arxiv.org/abs/2205.10285
Autor:
Contat, Alice, Curien, Nicolas
Consider a uniform rooted Cayley tree $T_{n}$ with $n$ vertices and let $m$ cars arrive sequentially, independently, and uniformly on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives towards the
Externí odkaz:
http://arxiv.org/abs/2107.02116
Autor:
Contat, Alice
We prove a surprising symmetry between the law of the size $G_n$ of the greedy independent set on a uniform Cayley tree $ \mathcal{T}_n$ of size $n$ and that of its complement. We show that $G_n$ has the same law as the number of vertices at even hei
Externí odkaz:
http://arxiv.org/abs/2103.03800
Autor:
Contat, Alice
Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and H\'enard on general Galton--Watson trees and allow different car arrival distributions depending on the vertex outdegrees. W
Externí odkaz:
http://arxiv.org/abs/2012.00607