getdoc742a. 171KB Jun 04 2011 12:04:31 AM
Teks penuh
Garis besar
Dokumen terkait
Recall the standard “walk-around” bijection from full binary trees on 2 n edges to Dyck n -paths: a worm crawls counterclockwise around the tree starting just west of the root and
There are the extreme cases of unlimited resources leading to a branching rate independent of the population at the site (classical branching random walk) and the other case of
This article contains an investigation of simple random walks on Galton-Watson trees conditioned to survive, and we will start by introducing some relevant branching process and
A central limit theorem for random walk in a random environment on marked Galton-Watson trees.. Gabriel
Key words: Gaussian processes, processes indexed by trees, bounded processes, summation on trees, metric entropy.. AMS 2000 Subject Classification: Primary 60G15; Secondary:
Key words: bifurcating autoregressive process ; tree-indexed times series; martingales ; least squares estimation ; almost sure convergence ; quadratic strong law; central
Keywords: Local time, favourite site, random walk, Wiener process AMS subject classification: 60J55, 60J15, 60J65.. Submitted to EJP on March
Abstract We give sharp rates of convergence for a natural Markov chain on the space of phylogenetic trees and dually for the natural random walk on the set of perfect matchings in
