Results 11 
15 of
15
On the local time density of the reflecting Brownian bridge
 MR MR1768499 (2001h:60134
, 2000
"... Expressions for the multidimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac’s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Expressions for the multidimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac’s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings.
On The Number Of Predecessors In Constrained Random Mappings
 Stat. Probab. Letters
, 1997
"... We consider random mappings from an nelement set into itself with constraints on coalescence as introduced by Arney and Bender. A local limit theorem for the distribution of the number of predecessors of a random point in such a mapping is presented by using a generating function approach and sing ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We consider random mappings from an nelement set into itself with constraints on coalescence as introduced by Arney and Bender. A local limit theorem for the distribution of the number of predecessors of a random point in such a mapping is presented by using a generating function approach and singularity analysis. 1.
A Poisson * geometric convolution law for the number of components in unlabelled combinatorial structures
 COMBIN., PROBAB. AND COMPUT
, 1995
"... Given a class of combinatorial structures C, we consider the quantity N(n; m), the number of multiset constructions P (of C) of size n having exactly m Ccomponents. Under general ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Given a class of combinatorial structures C, we consider the quantity N(n; m), the number of multiset constructions P (of C) of size n having exactly m Ccomponents. Under general
The Number Of Descendants In Simply Generated Random Trees
, 1999
"... We derive asymptotic results on the distribution of the number of descendants in simply generated trees. Our method is based on a generating function approach and complex contour integration. 1. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We derive asymptotic results on the distribution of the number of descendants in simply generated trees. Our method is based on a generating function approach and complex contour integration. 1.
Journal of Applied Mathematics and Stochastic Analysis, 13:2 (2000), 125136. ON THE LOCAL TIME DENSITY OF THE REFLECTING BROWNIAN BRIDGE
, 1999
"... Expressions for the multidimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac’s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings. ..."
Abstract
 Add to MetaCart
Expressions for the multidimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac’s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings.