16 citations · 18 across the 2 of their papers we have counts for
3 papers
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.PR2011
Connectivity threshold for Bluetooth graphs
Nicolas Broutin, Luc Devroye, Nicolas Fraiman +1
We study the connectivity properties of random Bluetooth graphs that model certain "ad hoc" wireless networks. The graphs are obtained as "irrigation subgraphs" of the well-known r…