activity
20112022
most citedDepth properties of scaled attachment random recursive trees

16 citations · 18 across the 5 of their papers we have counts for

collaborators
Showing math.PRShow all

7 papers · 1 filter

math.PR2020

Approximating Quasi-Stationary Distributions with Interacting Reinforced Random Walks

Amarjit Budhiraja, Nicolas Fraiman, Adam Waterbury

We propose two numerical schemes for approximating quasi-stationary distributions (QSD) of finite state Markov chains with absorbing states. Both schemes are described in terms of…

math.PR2020

Community modulated recursive trees and population dependent branching processes

Shankar Bhamidi, Ruituo Fan, Nicolas Fraiman +1

We consider random recursive trees that are grown via community modulated schemes that involve random attachment or degree based attachment. The aim of this paper is to derive gene…

math.PR2019

Asymptotics of Quasi-Stationary Distributions of Small Noise Stochastic Dynamical Systems in Unbounded Domains

Amarjit Budhiraja, Nicolas Fraiman, Adam Waterbury

We consider a collection of Markov chains that model the evolution of multitype biological populations. The state space of the chains is the positive orthant, and the boundary of t…

math.PR2018

Recursive functions on conditional Galton--Watson trees

Nicolas Broutin, Luc Devroye, Nicolas Fraiman

A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of t…

math.PR201216 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.PR20122 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…