Trickle-down processes and their boundaries

Details Trickle-down processes and their boundaries Trickle-down processes and their boundaries

2010-10-04

arxiv.org/abs/1010.0453v2

Mathematics

Probability

62 pages, 8 figures, revised to address referee's comments

Scientific paper

It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in one-by-one at a distinguished source vertex, successive particles proceed along directed edges according to an appropriate stochastic mechanism, and each particle comes to rest once it encounters an unoccupied vertex. Examples include the binary and digital search tree processes, the random recursive tree process and generalizations of it arising from nested instances of Pitman's two-parameter Chinese restaurant process, tree-growth models associated with Mallows' phi model of random permutations and with Schuetzenberger's non-commutative q-binomial theorem, and a construction due to Luczak and Winkler that grows uniform random binary trees in a Markovian manner. We introduce a framework that encompasses such Markov chains, and we characterize their asymptotic behavior by analyzing in detail their Doob-Martin compactifications, Poisson boundaries and tail sigma-fields.

Affiliated with

Also associated with

No associations

Rating

Trickle-down processes and their boundaries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Trickle-down processes and their boundaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trickle-down processes and their boundaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273876