Strata of random mappings - A combinatorial approach
Consider the functional graph of a random mapping from an n-element set into itself. Then the number of nodes in the strata of this graph can be viewed as stochastic process. Using a generating function approach it is shown that a suitable normalization of this process converges weakly to local time of reflecting Brownian bridge.
Year of publication: |
1999
|
---|---|
Authors: | Drmota, Michael ; Gittenberger, Bernhard |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 82.1999, 2, p. 157-171
|
Publisher: |
Elsevier |
Keywords: | Random mappings Brownian bridge Local time |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Reflected Brownian bridge local time conditioned on its local time at the origin
Gittenberger, Bernhard, (2004)
-
On the number of predecessors in constrained random mappings
Gittenberger, Bernhard, (1997)
-
Reinforced weak convergence of stochastic processes
Drmota, Michael, (2005)
- More ...