Related papers: Generalized (c,d)-entropy and aging random walks

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…

The classical Maximum-Entropy Principle (MEP) based on Shannon entropy is widely used to construct least-biased probability distributions from partial information. However, the Shore-Johnson axioms that single out the Shannon functional…

Random walks cannot, in general, be pushed forward by quasi-isometries. Tame Markov chains were introduced as a `quasi-isometry invariant' are a generalization of random walks. In this paper, we construct several examples of tame Markov…

We consider the Shannon-Khinchin axiomatic systems for the characterization of generalized entropies such as Sharma-Mital and Frank-Daffertshofer entropy. We provide the generalization of Shannon-Khinchin axioms and give the corresponding…

Given a DFA we consider the random walk that starts at the initial state and at each time step moves to a new state by taking a random transition from the current state. This paper shows that for typical DFA this random walk induces an…

We consider a model, introduced by Boldrighini, Minlos and Pellegrinotti, of random walks in dynamical random environments on the integer lattice Z^d with d>=1. In this model, the environment changes over time in a Markovian manner,…

The branching rule is one of the most fundamental properties of the Macdonald symmetric polynomials. It expresses a Macdonald polynomial as a nonnegative linear combination of Macdonald polynomials with smaller number of variables. Taking a…

Coined discrete-time quantum walks are studied using simple deterministic dynamical systems as coins whose classical limit can range from being integrable to chaotic. It is shown that a Loschmidt echo like fidelity plays a central role and…

We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…

Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…

Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…

We introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence of probability spaces and a sequence of measure-preserving maps between these spaces. This notion generalizes the classical concept of metric…

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

In the framework of statistical mechanics the properties of macroscopic systems are deduced starting from the laws of their microscopic dynamics. One of the key assumptions in this procedure is the ergodic property, namely the equivalence…

Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…

We study quenched distributions on random walks in a random potential on integer lattices of arbitrary dimension and with an arbitrary finite set of admissible steps. The potential can be unbounded and can depend on a few steps of the walk.…

Surprisingly the looking natural random walk leading to Brownian motion occurs to be often biased in a very subtle way: usually refers to only approximate fulfillment of thermodynamical principles like maximizing uncertainty. Recently, a…