Cyclic products and optimal traps in cyclic birth and death chains

DOI10.37236/11494zbMath1522.90158arXiv2203.02443OpenAlexW4382776029MaRDI QIDQ6115507

No author found.

Publication date: 10 August 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02443

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• The need for speed: maximizing the speed of random walk in fixed environments
• A combinatorial result with applications to self-interacting random walks
• Local limit theorem for random walk in periodic environment.
• On strict monotonicity of the speed for excited random walks in one dimension
• The increase of sums and products dependent on \((y_ 1,\;ldots, y_ n)\) by rearrangement of this set
• Random walks on periodic graphs
• Shorter Notes: An Elementary Proof of Steinhaus's Theorem
• Circular rearrangement inequality
• Rearrangements and Jensen type inequalities related to convexity, superquadracity, strong convexity and 1-quasiconvexity
• Random walks in a random environment

This page was built for publication: Cyclic products and optimal traps in cyclic birth and death chains