1 citations · 1 across the 13 of their papers we have counts for
Showing 2024Show all
2 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…