Continuum-sites stepping-stone models, coalescing exchangeable partitions and random trees
نویسندگان
چکیده
منابع مشابه
N ov 1 99 8 CONTINUUM – SITES STEPPING – STONE MODELS , COALESCING EXCHANGEABLE PARTITIONS , AND RANDOM TREES
Analogues of stepping–stone models are considered where the site– space is continuous, the migration process is a general Markov process, and the type–space is infinite. Such processes were defined in previous work of the second author by specifying a Feller transition semigroup in terms of expectations of suitable functionals for systems of coalescing Markov processes. An alternative represent...
متن کاملContinuum{sites Stepping{stone Models, Coalescing Exchangeable Partitions, and Random Trees
Analogues of stepping-stone models are considered where the sitespace is continuous, the migration process is a general Markov process, and the type-space is infinite. Such processes were defined in previous work of the second author by specifying a Feller transition semigroup in terms of expectations of suitable functionals for systems of coalescing Markov processes. An alternative representat...
متن کاملRestricted exchangeable partitions and embedding of associated hierarchies in continuum random trees
We introduce the notion of a restricted exchangeable partition of N. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In particular, we deduce from the general theory developed here a limit result conjectured previously for Ford’s alpha model and its extension, the alpha-gamma model, where restric...
متن کاملExchangeable and partially exchangeable random partitions
Call a random partition of the positive integers partially exchangeable if for each finite sequence of positive integers n l , . . . , nk, the probability that the partition breaks the first nl + . . . § nk integers into k particular classes, of sizes nl . . . . , nk in order of their first elements, has the same value p(na . . . . . nk) for every possible choice of classes subject to the sizes...
متن کاملPartially Exchangeable Random Partitions
A random partition of the positive integers is called partially exchangeable if for each finite sequence of positive integers n,, ... , nk, the probability that the partition breaks the first n1 + + nk integers into k particular classes, of sizes nl,.. . ., nk in order of their first elements, has the same value p(nl,...,nk) for every possible choice of classes subject to the sizes constraint. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2000
ISSN: 0091-1798
DOI: 10.1214/aop/1019160326