Related papers: Chain recurrent shifts on trees
Given a unilateral shift $B_w$ (determined by a bounded sequence $w$), a sequence $x \in \ell^2$ is "hypercyclic" for $w$ iff the forward iterates of $x$ under $B_w$ are dense in $\ell^2$. We show that it is possible to make the set of $x…
Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set $X$ of sampled species. In contrast to phylogenetic trees which show only speciation events, networks can also accommodate reticulate…
We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the…
In this paper, we consider the linearly reinforced and the once-reinforced random walk models in the transient phase on trees. We show the large deviations for the upper tails for both models. We also show the exponential decay for the…
Rooted phylogenetic networks are rooted acyclic digraphs. They are used to model complex evolution where hybridization, recombination and other reticulation events play important roles. A rigorous definition of network compression is…
Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…
In this paper, we study the independence of shifts defined on $\mathbb{N}^d$ ($\mathbb{N}^d$ shift) and trees (tree-shift). Firstly, for the completeness of the article, we provide a proof that an $\mathbb{N}^d$ shift has positive…
We classify the possible behaviors of a class of one-dimensional stochastic recurrent growth models. In our main result, we obtain nearly optimal bounds for the tail of hitting times of some compact sets. If the process is an aperiodic…
Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…
We consider families of discrete time birth and death chains on trees, and show that in presence of a drift towards the root of the tree, the chains exhibit cut-off behavior along the drift and escape behavior in the opposite direction.
Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These…
In this article we develop a general technique which takes a known characterization of a property for weighted backward shifts and lifts it up to a characterization of that property for a large class of operators on $L^p(X)$. We call these…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in constant time. Moreover, we extend our data structure such…
The weighted ancestor problem is a well-known generalization of the predecessor problem to trees. It is known to require $\Omega(\log\log n)$ time for queries provided $O(n\mathop{\mathrm{polylog}} n)$ space is available and weights are…
We extend a result of B\`{e}s, Martin, Peris and Shkarin by stating: $B_w$ is $\mathscr{F}$-weighted backward shift if and only if $(B_w,\dots, B_w^r)$ is $d$-$\mathscr{F}$, for any $r\in \mathbb{N}$, where $\mathscr{F}$ runs along some…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
We introduce and study certain type of variable exponent \ell^p spaces. These spaces will typically not be rearrangement-invariant but instead they enjoy a good local control of some geometric properties. We obtain some interesting examples…
We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…