相关论文: The Hilbert-Galton board

We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters…

We consider Markov chains with random transition probabilities which, moreover, fluctuate randomly with time. We describe such a system by a product of stochastic matrices, $U(t)=M_t\cdots M_1$, with the factors $M_i$ drawn independently…

Concentration bounds are given for throwing balls into bins independently according to a distribution $p$. The probability of a $k$-loaded bin after $m$ balls is shown to be controlled on both sides by $\rho_{m,k} := m \|p\|_k / k$. This…

Let L be a Galois extension of a countable Hilbertian field K. Although L need not be Hilbertian, we prove that an abundance of large Galois subextensions of L/K are.

Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…

We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In these extensions, we introduce load-balancing constraints…

We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…

We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…

Predicting nonequilibrium fluctuations requires a knowledge of nonequilibrium distribution functions. Despite the distributions' fractal character some theoretical results, "Fluctuation Theorems", reminiscent of but distinct from, Gibbs'…

We study the diffusion phenomena on the negatively curved surface made up of congruent heptagons. Unlike the usual two-dimensional plane, this structure makes the boundary increase exponentially with the distance from the center, and hence…

The statistical distribution of the ratio of two normal random variables is characterized by its heavy-tailed nature and absence of finite moments. The shape of its density function is highly variable, capable of exhibiting unimodal or…

The distribution of the "mixing time" or the "time to stationarity" in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the…

Computational procedures for the stationary probability distribution, the group inverse of the Markovian kernel and the mean first passage times of an irreducible Markov chain, are developed using perturbations. The derivation of these…

We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric…

This paper is concerned with stochastic processes that model multiple (or iterated) scattering in classical mechanical systems of billiard type, defined below. From a given (deterministic) system of billiard type, a random process with…

The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is…

Billiards tables - a minimal model for particles moving in a confined region - are known to present classical (and quantum) different features according to their shape, ranging from strongly chaotic to integrable dynamics. Here we consider…

Galperin introduced an interesting method to learn the digits of $\pi $ by counting the collisions of two billiard balls and a hard wall. This paper studies two quantum versions of the Galperin billiards. It is shown that the digits of $\pi…

Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move:…

The Weibull function is widely used to describe skew distributions observed in nature. However, the origin of this ubiquity is not always obvious to explain. In the present paper, we consider the well-known Galton-Watson branching process…