Related papers: A new method for computing the expected hitting ti…
In this paper, we consider the N-urn Ehrenfest model. By utilizing an auxiliary continuous-time Markov chain, we obtain the explicit formula for the Laplace transform of the hitting time from a single state to a set A of states where A…
We consider a version of the classical Ehrenfest urn model with two urns and two types of balls: regular and heavy. Each ball is selected independently according to a Poisson process having rate $1$ for regular balls and rate…
We propose a generalized Ehrenfest urn model of many urns arranged periodically along a circle. The evolution of the urn model system is governed by a directed stochastic operation. Method for solving an $N$-ball, $M$-urn problem of this…
We introduce a deterministic, time-reversible version of the Ehrenfest urn model. The distribution of first-passage times from equilibrium to non-equilibrium states and vice versa is calculated. We find that average times for transition to…
The Ehrenfest urn process, also known as the dogs and fleas model, is realistically simulated by molecular dynamics of the Lennard-Jones fluid. The key variable is Delta z, i.e. the absolute value of the difference between the number of…
A model based on the classic non-interacting Ehrenfest urn model with two-urns is generalized to $M$ urns with the introduction of interactions for particles within the same urn. As the inter-particle interaction strength is varied, phases…
Ehrenfest's diffusion model is a well-known classical physical model consisting of two urns and n balls. A group theoretical interpretation of the model by using the Gelfand pair (Z/2Zwr S_{n},S_{n}) is provided by Diaconis-Shahshahani.…
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls…
Since its inception in 1907, the Ehrenfest urn model (EUM) has served as a test bed of key concepts of statistical mechanics. Here we employ this model to study large deviations of a time-additive quantity. We consider two continuous-time…
We consider a generalization of the Bernoulli-Laplace model in which there are two urns and $n$ total balls, of which $r$ are red and $n - r$ white, and where the left urn holds $m$ balls. At each time increment, $k$ balls are chosen…
We study the mixing time of the $(n,k)$ Bernoulli--Laplace urn model, where $k\in\{0,1,\ldots,n\}$. Consider two urns, each containing $n$ balls, so that when combined they have precisely $n$ red balls and $n$ white balls. At each step of…
Though widely used in applications, reinforced random walk on graphs have never been the subject of a valid statistical inference. We develop in this paper a statistical framework for a general two-colored urn model. The probability to draw…
We study an urn process with two urns, initialized with a ball each. Balls are added sequentially, the urn being chosen independently with probability proportional to the $\alpha^{th}$ power $(\alpha >1)$ of the existing number of balls. We…
A random walk on a $N$-dimensional hypercube is a discrete time stochastic process whose state space is the set $\{-1,+1\}^{N}$, which has uniform probability of reaching any neighbour state, and probability zero of reaching a non-neighbour…
The stochastic models investigated in this paper describe the evolution of a set of $F_N$ identical balls scattered into $N$ urns connected by an underlying symmetrical graph with constant degree $h_N$. After some random amount of time {\em…
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the…
We study an urn model introduced in the paper of Chen and Wei, where at each discrete time step $m$ balls are drawn at random from the urn containing colors white and black. Balls are added to the urn according to the inspected colors,…
In this paper we are concerned with a generalized $N$-urn Ehrenfest model, where balls keeps independent random walks between $N$ boxes uniformly laid on $[0, 1]$. After a proper scaling of the transition rates function of the aforesaid…
This paper studies a very general urn model stimulated by designs in clinical trials, where the number of balls of different types added to the urn at trial n depends on a random outcome directed by the composition at trials 1,2,...,n-1.…