English
Related papers

Related papers: The Hilbert-Galton board

200 papers

The typicality approach and the Hilbert space averaging method as its technical manifestation are important concepts of quantum statistical mechanics. Extensively used for expectation values we extend them in this paper to transition…

Quantum Physics · Physics 2020-08-25 Nico Hahn , Thomas Guhr , Daniel Waltner

Perturbing the arrangements of pegs on a static Galton board can result in non-trivial stationary distributions, which in the continuum limit correspond to departure from regular gaussian behavior. Two such distributions are obtained.…

Statistical Mechanics · Physics 2024-07-03 Dhruv Shah , R. K. Shishir , Manjaree , Shreya Pithva , T. Y. Booritth Balaji , Rahul Agarwal Singh

Recently, Diaconis, Ram and I created Markov chains out of the coproduct-then-product operator on combinatorial Hopf algebras. These chains model the breaking and recombining of combinatorial objects. Our motivating example was the…

Combinatorics · Mathematics 2015-03-31 C. Y. Amy Pang

We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…

Combinatorics · Mathematics 2018-08-28 C. Y. Amy Pang

We call a system bouncing ball billiard if it consists of a particle that is subjected to a constant vertical force and bounces inelastically on a one-dimendional vibrating periodically corrugated floor. Here we choose circular scatterers…

Chaotic Dynamics · Physics 2007-05-23 L. Matyas , R. Klages

A discrete-time stochastic process derived from a model of basketball is used to generalize any discrete distribution. The generalized distributions can have one or two more parameters than the parent distribution. Those derived from…

Applications · Statistics 2020-06-25 Rose Baker

In this paper we propose algorithms for allocating $n$ sequential balls into $n$ bins that are interconnected as a $d$-regular $n$-vertex graph $G$, where $d\ge3$ can be any integer.Let $l$ be a given positive integer. In each round $t$,…

Data Structures and Algorithms · Computer Science 2016-03-01 Ali Pourmiri

We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…

Probability · Mathematics 2026-04-28 Serik Sagitov

We study recurrence and transience for a particle that moves at constant velocity in the interior of an unbounded planar domain, with random reflections at the boundary governed by a Markov kernel producing outgoing angles from incoming…

Probability · Mathematics 2024-07-12 Conrado da Costa , Mikhail V. Menshikov , Andrew R. Wade

We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$. Our methods use geometric finite semigroup theory via the…

Probability · Mathematics 2019-03-11 John Rhodes , Anne Schilling

Polygonal billiards exhibit a rich and complex dynamical behavior. In recent years polygonal billiards have attracted great attention due to their application in the understanding of anomalous transport, but also at the fundamental level,…

Chaotic Dynamics · Physics 2024-05-14 Jordan Orchard , Federico Frascoli , Lamberto Rondoni , Carlos Mejía-Monasterio

Here, we present a variant of the sliding coins game. Two coins are placed on distinct squares of a semi-infinite linear board with squares numbered $0, 1, 2, dots, $. Two players take turns and move a coin to a lower unoccupied square.…

Combinatorics · Mathematics 2025-04-29 Ryohei Miyadera , Hikaru Manabe , Unchon Lee

We propose a model of card shuffling where a pack of cards, spread as points on a square table, are repeatedly gathered locally at random spots and then spread towards a random direction. A shuffling of the cards is then obtained by…

Probability · Mathematics 2021-06-14 Persi Diaconis , Soumik Pal

At high levels, the asymptotic distribution of a stationary, regularly varying Markov chain is conveniently given by its tail process. The latter takes the form of a geometric random walk, the increment distribution depending on the sign of…

Methodology · Statistics 2014-12-11 Holger Drees , Johan Segers , Michał Warchoł

We consider the stochastic sandpile model with uniform toppling rule on the integer line. During a uniform toppling, with probability $1/3$ one particle is sent to the right of the toppled vertex, with probability $1/3$ one particle is sent…

Probability · Mathematics 2026-03-18 David Beck-Tiefenbach , Robin Kaiser

Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…

Probability · Mathematics 2020-04-21 Michel Benaim , Itai Benjamini , Jun Chen , Yuri Lima

We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…

Probability · Mathematics 2014-12-04 Shaun McKinlay , Konstantin Borovkov

The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural…

Combinatorics · Mathematics 2015-03-20 Persi Diaconis , C. Y. Amy Pang , Arun Ram

For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…

Statistical Mechanics · Physics 2015-06-12 Yukio Hayashi , Takayuki Komaki , Yusuke Ide , Takuya Machida , Norio Konno

We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set.…

Discrete Mathematics · Computer Science 2014-01-03 Amanda Redlich