Counting subsets of the random partition and the 'Brownian Bridge' process

J. M. DeLaurentis and B. G. Pittel

Stochastic Processes and their Applications, 1983, vol. 15, issue 2, 155-167

Abstract: Let [Omega]m be the set of partitions, [omega], of a finite m-element set; induce a uniform probability distribution on [Omega]m, and define Xms([omega]) as the number of s-element subsets in [omega]. We alow the existence of an integer-valued function n=n(m)(t), t[epsilon][0, 1], and centering constants bms, 0[less-than-or-equals, slant]s[less-than-or-equals, slant] m, such that converges to the 'Brownian Bridge' process in terms of its finite-dimensional distributions.

Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(83)90053-4
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:15:y:1983:i:2:p:155-167

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().