Showing math.PRShow all
3 papers · 1 filter
math.PR2024
The critical Karp--Sipser core of Erdős--Rényi random graphs
Thomas Budzinski, Alice Contat
The Karp--Sipser algorithm consists in removing recursively the leaves as well their unique neighbours and all isolated vertices of a given graph. The remaining graph obtained when…
math.PR2024
Parking on supercritical geometric Bienaymé--Galton--Watson trees
Linxiao Chen, Alice Contat
Consider a supercritical Bienaymé--Galton--Watson tree with geometric offspring distribution. Each vertex of this tree represents a parking spot which can accommodat…
math.PR2023
Eve, Adam and the Preferential Attachment Tree
Alice Contat, Nicolas Curien, Perrine Lacroix +2
We consider the problem of finding the initial vertex (Adam) in a Barabási--Albert tree process at large times. More precisely, given …