Related papers: The simple harmonic urn

We study the evolution of a system of free fermions in one dimension under the simultaneous effects of coherent tunneling and stochastic Markovian noise. We identify a class of noise terms where a hierarchy of decoupled equations for the…

* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…

Each vertex of the infinite $2$-dimensional square lattice graph is assigned, independently, a label that reads trap with probability $p$, target with probability $q$, and open with probability $(1-p-q)$, and each edge is assigned,…

Motivated by its relevance for the study of perturbations of one-dimensional voter models, including stochastic Potts models at low temperature, we consider diffusively rescaled coalescing random walks with branching and killing. Our main…

We introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, and then chooses a colour $i$ from this subset with…

Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the…

We study P\'olya urns on hypergraphs and prove that, when the incidence matrix of the hypergraph is injective, there exists a point $v=v(H)$ such that the random process converges to $v$ almost surely. We also provide a partial result when…

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…

We introduce a general Bayesian framework for graph matching grounded in a new theory of exchangeable random permutations. Leveraging the cycle representation of permutations and the literature on exchangeable random partitions, we define,…

In a paper entitled singularities of invariant densities for random switching between two linear odes in 2D, Bakhtin et al [5], consider a Markov process obtained by random switching between two stable linear vector fields in the plane and…

We consider the recurrence and transience problem for a time-homogeneous Markov chain on the real line with transition kernel $p(x,\mathrm{d}y)=f_x(y-x)\,\mathrm{d}y$, where the density functions $f_x(y)$, for large $|y|$, have a power-law…

Consider $N$ balls initially placed in $L$ bins. At each time step take a ball from each non-empty bin and \emph{randomly} reassign the balls into the bins.We call this finite Markov chain \emph{General Repeated Balls into Bins} process. It…

We consider different Markovian embedding schemes of non-Markovian stochastic processes that are described by generalized Langevin equations (GLE) and obey thermal detailed balance under equilibrium conditions. At thermal equilibrium…

It has recently been shown that there are substantial differences in the regularity behavior of the empirical process based on scalar diffusions as compared to the classical empirical process, due to the existence of diffusion local time.…

We consider a stochastic process in which independent identically distributed random matrices are multiplied and where the Lyapunov exponent of the product is positive. We continue multiplying the random matrices as long as the norm,…

This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…

We consider predictive inference using a class of temporally dependent Dirichlet processes driven by Fleming--Viot diffusions, which have a natural bearing in Bayesian nonparametrics and lend the resulting family of random probability…

A deck of $n$ cards are shuffled by repeatedly taking off the top card, flipping it with probability $1/2$, and inserting it back into the deck at a random position. This process can be considered as a Markov chain on the group $B_n$ of…