Search arXivSearch

arXiv · 1511.07832

Random cyclic dynamical systems

Abstract

For X a finite subset of the circle and for 0 < r <= 1 fixed, consider the function f_r : X -> X which maps each point to the clockwise furthest element of X within angular distance less than 2 pi r. We study the discrete dynamical system on X generated by f_r, and especially its expected behavior when X is a large random set. We show that, as |X| -> infinity, the expected fraction of periodic points of f_r tends to 0 if r is irrational and to 1/q if r = p/q is rational with p and q coprime. These results are obtained via more refined statistics of f_r which we compute explicitly in terms of (generalized) Catalan numbers. The motivation for studying f_r comes from Vietoris-Rips complexes, a geometric construction used in computational topology. Our results determine how much one can expect to simplify the Vietoris-Rips complex of a random sample of the circle by removing dominated vertices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michał Adamaszek, Henry Adams, Francis Motta. 2016-09-16. Random cyclic dynamical systems. https://doi.org/10.1016/j.aam.2016.08.007

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO