Related papers: Mixing time for the Repeated Balls into Bins dynam…
We consider reinforcement learning (RL) for a class of problems with bagged decision times. A bag contains a finite sequence of consecutive decision times. The transition dynamics are non-Markovian and non-stationary within a bag. All…
Let $P$ be a bistochastic matrix of size $n$, and let $\Pi$ be a permutation matrix of size $n$. In this paper, we are interested in the mixing time of the Markov chain whose transition matrix is given by $Q=P\Pi$. In other words, the chain…
We introduce a novel multivariate random process producing Bernoulli outputs per dimension, that can possibly formalize binary interactions in various graphical structures and can be used to model opinion dynamics, epidemics, financial and…
We consider the sequential allocation of $m$ balls (jobs) into $n$ bins (servers) by allowing each ball to choose from some bins sampled uniformly at random. The goal is to maintain a small gap between the maximum load and the average load.…
We study the stochastic dynamics of a system of interacting species in a stochastic environment by means of a continuous-time Markov chain with transition rates depending on the state of the environment. Models of gene regulation in systems…
We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…
Resonant chains are groups of planets for which each pair is in resonance, with an orbital period ratio locked at a rational value (2/1, 3/2, etc.). Such chains naturally form as a result of convergent migration of the planets in the…
Markov chains are one of the well-known tools for modeling and analyzing stochastic systems. At the same time, they are used for constructing random walks that can achieve a given stationary distribution. This paper is concerned with…
The main subject of the study in this paper is the simultaneous renewal time for two time-inhomogeneous Markov chains which start with arbitrary initial distributions. By a simultaneous renewal we mean the first time of joint hitting the…
The bead process is the particle system defined on parallel lines, with underlying measure giving constant weight to all configurations in which particles on neighbouring lines interlace, and zero weight otherwise. Motivated by the…
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time \Theta(n^3 \log n) in the uniform case and time \Theta(n^2) in the constant…
A 1-2 model configuration is a subset of edges of a hexagonal lattice satisfying the constraint that each vertex is incident to 1 or 2 edges. We introduce Markov chains to sample the 1-2 model configurations on 2D hexagonal lattice and…
The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random…
We consider finite configurations of particles and holes sampled according to Bernoulli product measure and with a second class particle added to a random position. The stabilization time is the number of steps needed to reach an ordered…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
We construct stationary max-infinitely divisible (max-id) processes from systems of randomly time-changed L\'evy particles. Classical examples without time change, such as the Brown-Resnick process, are, up to marginal transformations,…
We consider the problem of non degenerate in energy metastable states forming a series in the framework of reversible finite state space Markov chains. We assume that starting from the state at higher energy the system necessarily visits…
In this thesis, branching Brownian motion (BBM) is a random particle system where the particles diffuse on the real line according to Brownian motions and branch at constant rate into a random number of particles with expectation greater…
Restricted Boltzmann Machines (RBMs) offer a versatile architecture for unsupervised machine learning that can in principle approximate any target probability distribution with arbitrary accuracy. However, the RBM model is usually not…