Function Series, Catalan Numbers, and Random Walks on Trees
نویسندگان
چکیده
منابع مشابه
Function Series, Catalan Numbers, and Random Walks on Trees
The delight of finding unexpected connections is one of the rewards of studying mathematics. In this talk, based on joint work with Ibtesam Bajunaid, Joel Cohen, and David Singman, I will discuss the connections that link the following seven superficially unrelated entities: (A) A function of the sort that calculus textbooks often use to show that a continuous function need not have a derivativ...
متن کاملRandom Walks and Catalan Factorization
In the theory of random walks, it is notable that the central bi-nomial coeecients ? 2n n count the number of walks of three diierent special types, which may be described as`balanced', `non-negative' and`non-zero'. One of these coincidences is equivalent to the well-known convolution identity X p+q=n 2p p 2q q = 2 2n : This article brings together several proofs of thisùbiquity of central bino...
متن کاملRandom walks on complex trees.
We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) display...
متن کاملRandom Walks on Rooted Trees
For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...
متن کاملRandom Walks and Trees
These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Mathematical Monthly
سال: 2005
ISSN: 0002-9890
DOI: 10.2307/30037599