Related papers: The Hilbert-Galton board
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
In this brief note, we find formulas for the distribution and the transition probability matrices of a stochastic process described as a time-reversion in a finite time window of a Markov chain, with cluster observation of the Markov state…
In a balls-in-bins process with feedback, balls are sequentially thrown into bins so that the probability that a bin with n balls obtains the next ball is proportional to f(n) for some function f. A commonly studied case where there are two…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
Building on previous work by four of us (ABCN), we consider further generalizations of Warrington's juggling Markov chains. We first introduce "multispecies" juggling, which consist in having balls of different weights: when a ball is…
We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from…
We study numerically and analytically the dynamics of particles on the Galton board, a regular lattice of disc scatters, in the presence of a constant external force and friction. It is shown that under certain conditions friction leads to…
The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or…
Consider a real hyperplane arrangement and let $\mathcal{C}$ denote the occurring chambers. Bidigare, Hanlon and Rockmore introduced a Markov chain on $\mathcal{C}$ which is a generalization of some card shuffling models used in computer…
The time evolution of a bounded quantum system is considered in the framework of the orthogonal, unitary and symplectic circular ensembles of random matrix theory. For an $N$ dimensional Hilbert space we prove that in the large $N$ limit…
We consider the higher-order Markov Chain, and characterize the second order Markov chains admitting every probability distribution vector as a stationary vector. The result is used to construct Markov chains of higher-order with the same…
We study a generalized P\'{o}lya urn model with two types of ball. If the drawn ball is red, it is replaced together with a black ball, but if the drawn ball is black it is replaced and a red ball is thrown out of the urn. When only black…
We introduce a deterministic analogue of Markov chains that we call the hunger game. Like rotor-routing, the hunger game deterministically mimics the behavior of both recurrent Markov chains and absorbing Markov chains. In the case of…
Semiclassical spectra beyond the Gutzwiller and Berry-Tabor approximation for chaotic and regular systems, respectively, are obtained by harmonic inversion of the hbar expansion of the periodic orbit signal. The method is illustrated for…
In this paper, we present results of simulations of a model of the Galton board for various degrees of elasticity of the ball-to-nail collision.
The paper establishes the property of splittability of billiard boundary sequences in n dimensional cube into subsequences of fractional parts. This reveals a new property of integrable and weak perturbated Hamilton systems: under a simple…
We consider a special case of the generalized P\'{o}lya's urn model introduced by Benaim et al (2013). 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…
A diffusion taking value in probability measures on a graph with a vertex set $V$, $\sum_{i\in V}x_i\delta_i$, is studied. The masses on each vertices satisfy the stochastic differential equation of the form $dx_i=\sum_{j\in…
We calculate exact convergence times to reach random bipartite entanglement for various random protocols. The eigenproblem of a Markovian chain governing the process is mapped to a spin chain, thereby obtaining exact expression for the gap…
We present an Arakelov theoretic version of the deformation to the normal cone. In particular, the geometric data is enriched with a deformation of a Hermitian line bundle. We introduce numerical invariants called arithmetic Hilbert…