Search arXivSearch

arXiv · 1210.2236

Stochastic stability of traffic maps

Abstract

We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using connections to topological Markov chains we obtain nontrivial invariant measures, prove their stochastic stability, and calculate the topological entropy. Technically these results in the deterministic setting are related to the construction of measures of maximal entropy via measures uniformly distributed on periodic points of a given period, while in the random setting we directly construct (spatially) Markov invariant measures. In distinction to conventional results the limiting measures in non-lattice case are non-ergodic. Average velocity of individual ``vehicles'' as a function of their density and its stochastic stability is studied as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Blank. 2012-10-08. Stochastic stability of traffic maps. https://doi.org/10.1088/0951-7715%2F25%2F12%2F3389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS