Related papers: Chain recurrent shifts on trees
Bayart and Ruzsa [Ergodic Theory Dynam. Systems 35 (2015)] have recently shown that every frequently hypercyclic weighted shift on $\ell^p$ is chaotic. This contrasts with an earlier result of Bayart and Grivaux [Proc. London Math. Soc. (3)…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
We present a recurrence-transience classification for discrete-time Markov chains on manifolds with negative curvature. Our classification depends only on geometric quantities associated to the increments of the chain, defined via the…
The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak…
Phylogenetic networks are a type of directed acyclic graph that represent how a set $X$ of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of reticulate evolution,…
Let $I$ be a countably infinite index set, and let $X$ be a Banach sequence space over $I.$ In this article, we characterize disjoint hypercyclic and supercyclic weighted pseudo-shift operators on $X$ in terms of the weights, the OP-basis,…
We study frequently recurrent unilateral and bilateral backward shift operators on Fr\'echet sequence spaces. We prove that if a backward shift admits a non-zero frequently recurrent vector, then it supports a dense set of such vectors, so…
The following note proves that conditional entropy of a sequence is almost time-reversal invariant, specifically they only differ by a small constant factor dependent only upon the forward and backward models that the entropies are being…
It is not known if the inverse of a frequently hypercyclic bilateral weighted shift on $c_0(\mathbb{Z})$ is again frequently hypercyclic. We show that the corresponding problem for upper frequent hypercyclicity has a positive answer. We…
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…
For a given directed tree and weights associated with vertices from a subtree the completion problem is to determine if these weights may be completed in a way to obtain a bounded weighted shift on the whole tree, which possibly satisfies…
This paper describes the Context Tree Switching technique, a modification of Context Tree Weighting for the prediction of binary, stationary, n-Markov sources. By modifying Context Tree Weighting's recursive weighting scheme, it is possible…
This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…
Criteria for subnormality of unbounded injective weighted shifts on leafless directed trees with one branching vertex are proposed. The case of classical weighted shifts is discussed. The relevance of an inductive limit approach to…
We analyze the hypercyclicity, chaoticity, and spectral structure of (bounded and unbounded) weighted backward shifts in a nonclassical sequence space, which the space $l_1$ of summable sequences is both isometrically isomorphic to and…
Assorted weighted shifts over finite rooted directed trees are studied. Their complex symmetry is characterized.
In a paper from 2012 Jab{\l}o\'nski, Jung and Stochel introduced the weighted shifts on directed trees, a generalisation of well known weighted shift operators on $\ell^2$. In the last decade this class has proven itself handy for finding…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…