Results 1 
4 of
4
Enumerations Of Trees And Forests Related To Branching Processes And Random Walks
 Microsurveys in Discrete Probability, number 41 in DIMACS Ser. Discrete Math. Theoret. Comp. Sci
, 1997
"... In a GaltonWatson branching process with offspring distribution (p 0 ; p 1 ; : : :) started with k individuals, the distribution of the total progeny is identical to the distribution of the first passage time to \Gammak for a random walk started at 0 which takes steps of size j with probability p ..."
Abstract

Cited by 38 (15 self)
 Add to MetaCart
In a GaltonWatson branching process with offspring distribution (p 0 ; p 1 ; : : :) started with k individuals, the distribution of the total progeny is identical to the distribution of the first passage time to \Gammak for a random walk started at 0 which takes steps of size j with probability p j+1 for j \Gamma1. The formula for this distribution is a probabilistic expression of the Lagrange inversion formula for the coefficients in the power series expansion of f(z) k in terms of those of g(z) for f(z) defined implicitly by f(z) = zg(f(z)). The Lagrange inversion formula is the analytic counterpart of various enumerations of trees and forests which generalize Cayley's formula kn n\Gammak\Gamma1 for the number of rooted forests labeled by a set of size n whose set of roots is a particular subset of size k. These known results are derived by elementary combinatorial methods without appeal to the Lagrange formula, which is then obtained as a byproduct. This approach unifies an...
Individual displacements for linear probing hashing with different insertion policies
 ACM Transactions on Algorithms
, 2005
"... Abstract. We study the distribution of the individual displacements in hashing with linear probing for three different versions: First Come, Last Come and Robin Hood. Asymptotic distributions and their moments are found when the the size of the hash table tends to infinity with the proportion of occ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We study the distribution of the individual displacements in hashing with linear probing for three different versions: First Come, Last Come and Robin Hood. Asymptotic distributions and their moments are found when the the size of the hash table tends to infinity with the proportion of occupied cells converging to some α, 0 < α < 1. (In the case of Last Come, the results are more complicated and less complete than in the other cases.) We also show, using the diagonal Poisson transform studied by Poblete, Viola and Munro, that exact expressions for finite m and n can be obtained from the limits as m, n → ∞. We end with some results, conjectures and questions about the shape of the limit distributions. These have some relevance for computer applications. 1.
SCALING LIMITS OF RANDOM PLANAR MAPS WITH A UNIQUE LARGE FACE
, 2012
"... We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We proof that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps, appears when the maps are large. It is furthermore shown tha ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We proof that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps, appears when the maps are large. It is furthermore shown that as the number of edges n of the planar maps goes to infinity, the profile of distances to a marked vertex rescaled by n −1/2 is described by a Brownian excursion. The planar maps, with the graph metric rescaled by n −1/2, are then shown to converge in distribution towards Aldous’ Brownian tree in the Gromov–Hausdorff topology. In the proofs we rely on the Bouttier–di Francesco–Guitter bijection between maps and labeled trees and recent results on simply generated trees where a unique vertex of a high degree appears when the trees are large.