37 citations · 78 across the 20 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.PR2012★ 16 cited
Depth properties of scaled attachment random recursive trees
Luc Devroye, Omar Fawzi, Nicolas Fraiman
We study depth properties of a general class of random recursive trees where each node i attaches to the random node iX_i and X_0, ..., X_n is a sequence of i.i.d. random variables…
math.PR2012★ 2 cited
Connectivity of inhomogeneous random graphs
Luc Devroye, Nicolas Fraiman
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We dr…
math.CO2012★ 6 cited
A De Bruijn-Erdos theorem for chordal graphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal…