AbstractWe study the joint probability distribution of the number of nodes of fan-out k in random recursive circuits. For suitable norming we obtain a limiting multivariate normal distribution for the numbers of node of fan-out at most k, where we compute explicitly the limiting covariance matrix by solving a recurrence satisfied among its entries
AbstractSimple families of increasing trees can be constructed from simply generated tree families, ...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
AbstractA random recursive tree on n vertices is either a single isolated vertex (for n=1) or is a v...
AbstractWe study the joint probability distribution of the number of nodes of fan-out k in random re...
AbstractThe average number of nodes in a stratum of random plane-oriented recursive trees is found. ...
Abstract We study the fringe of random recursive trees, by analyzing the joint distribution of the c...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
AbstractAs models for spread of epidemics, family trees, etc., various authors have used a random tr...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
AbstractWe introduce the bucket recursive tree, a generalization of recursive trees. The tree grows ...
We develop a combinatorial structure to serve as model of random real world networks. Starting with ...
We develop a combinatorial structure to serve as model of random real world networks. Starting with ...
We develop a combinatorial structure to serve as model of random real world networks. Starting with ...
AbstractSimple families of increasing trees can be constructed from simply generated tree families, ...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
AbstractA random recursive tree on n vertices is either a single isolated vertex (for n=1) or is a v...
AbstractWe study the joint probability distribution of the number of nodes of fan-out k in random re...
AbstractThe average number of nodes in a stratum of random plane-oriented recursive trees is found. ...
Abstract We study the fringe of random recursive trees, by analyzing the joint distribution of the c...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
AbstractAs models for spread of epidemics, family trees, etc., various authors have used a random tr...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
AbstractWe introduce the bucket recursive tree, a generalization of recursive trees. The tree grows ...
We develop a combinatorial structure to serve as model of random real world networks. Starting with ...
We develop a combinatorial structure to serve as model of random real world networks. Starting with ...
We develop a combinatorial structure to serve as model of random real world networks. Starting with ...
AbstractSimple families of increasing trees can be constructed from simply generated tree families, ...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
AbstractA random recursive tree on n vertices is either a single isolated vertex (for n=1) or is a v...