English
Related papers

Related papers: Chain recurrent shifts on trees

200 papers

A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…

Combinatorics · Mathematics 2026-02-27 Helmut Prodinger

We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…

Probability · Mathematics 2018-12-21 Pierre Andreoletti , Roland Diel

We give a condition on weighted mean matrices so that their $l^p$ norms are determined on decreasing sequences when the condition is satisfied. We apply our result to give a proof of a conjecture of Bennett and discuss some related results.

Functional Analysis · Mathematics 2008-10-07 Peng Gao

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…

Probability · Mathematics 2008-05-27 Marco Lenci

A characterization of the tree $T^*$ such that $\mathrm{BP}(T^*)=\overleftrightarrow{\mathrm{DFUDS}(T)}$, the reversal of $\mathrm{DFUDS}(T)$ is given. An immediate consequence is a rigorous characterization of the tree $\hat{T}$ such that…

Data Structures and Algorithms · Computer Science 2018-04-16 Rayan Chikhi , Alexander Schönhuth

A learning algorithm is presented which given the structure of a causal tree, will estimate its link probabilities by sequential measurements on the leaves only. Internal nodes of the tree represent conceptual (hidden) variables…

Artificial Intelligence · Computer Science 2013-04-12 Igor Roizer , Judea Pearl

The effects of link rewiring are considered for the class of directed networks where each node has the same fixed out-degree. We model a network generated by three mechanisms that are present in various networked systems; growth, global…

Physics and Society · Physics 2015-06-22 Ewan R. Colman , Geoff J. Rodgers

It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge…

Combinatorics · Mathematics 2022-03-18 Swetha Ganesh , Sumit Mohanty

We give a set of equivalent conditions for a potential on a Countable Markov Shift to have strong positive recurrence, which is also equivalent to having exponential decay of correlations. A key ingredient of our proofs is quantifying how…

Dynamical Systems · Mathematics 2024-11-28 Mike Todd , Boyuan Zhao

By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…

Combinatorics · Mathematics 2013-10-24 Yury Kochetkov

Causal reversibility blends reversibility and causality for concurrent systems. It indicates that an action can be undone provided that all of its consequences have been undone already, thus making it possible to bring the system back to a…

Logic in Computer Science · Computer Science 2024-02-14 Marco Bernardo , Claudio A. Mezzina

The first motivation of this paper is to study stationarity and ergodic properties for a general class of time series models defined conditional on an exogenous covariates process. The dynamic of these models is given by an autoregressive…

Statistics Theory · Mathematics 2020-07-16 Paul Doukhan , Michael H. Neumann , Lionel Truquet

In this article we present an example of a random oriented tree model on d-dimensional lattice, that is a forest in d=3 with positive probability. This is in contrast with the other random tree models in the literature which are a forest…

Probability · Mathematics 2010-03-23 Siva Athreya , Sreekar Vadlamani

Rooted phylogenetic networks are used by biologists to infer and represent complex evolutionary relationships between species that cannot be accurately explained by a phylogenetic tree. Tree-child networks are a particular class of rooted…

Combinatorics · Mathematics 2024-09-02 Janosch Döcker , Simone Linz

We consider the recurrence and transience problem for a time-homogeneous Markov chain on the real line with transition kernel $p(x,\mathrm{d}y)=f_x(y-x)\,\mathrm{d}y$, where the density functions $f_x(y)$, for large $|y|$, have a power-law…

Probability · Mathematics 2013-12-19 Nikola Sandrić

The notions of chaos and frequent hypercyclicity enjoy an intimate relationship in linear dynamics. Indeed, after a series of partial results, it was shown by Bayart and Rusza in 2015 that for backward weighted shifts on…

Dynamical Systems · Mathematics 2021-07-01 Udayan B. Darji , Benito Pires

The history of gene families -- which are equivalent to event-labeled gene trees -- can to some extent be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes.…

Discrete Mathematics · Computer Science 2019-10-30 Manuel Lafond , Marc Hellmuth

We study periodic wind-tree models, unbounded planar billiards with periodically located rectangular obstacles. For a class of rational parameters we show the existence of completely periodic directions, and recurrence; for another class of…

Dynamical Systems · Mathematics 2012-01-19 Pascal Hubert , Samuel Lelievre , Serge Troubetzkoy

We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem…

Quantitative Methods · Quantitative Biology 2015-05-19 Julien Allali , Cédric Chauve , Pascal Ferraro , Anne-Laure Gaillard

The simple random walk on $\mathbb{Z}^p$ shows two drastically different behaviours depending on the value of $p$: it is recurrent when $p\in\{1,2\}$ while it escapes (with a rate increasing with $p$) as soon as $p\geq3$. This classical…

Data Structures and Algorithms · Computer Science 2023-08-22 Farah Ben Naoum , Christophe Godin , Romain Azaïs
‹ Prev 1 8 9 10 Next ›