Related papers: Nearest neighbor Markov dynamics on Macdonald proc…
Macdonald processes are probability measures on sequences of partitions defined in terms of nonnegative specializations of the Macdonald symmetric functions and two Macdonald parameters q,t in [0,1). We prove several results about these…
Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…
We study approximations of evolving probability measures by an interacting particle system. The particle system dynamics is a combination of independent Markov chain moves and importance sampling/resampling steps. Under global regularity…
We introduce and study q-randomized Robinson-Schensted-Knuth (RSK) correspondences which interpolate between the classical (q=0) and geometric (q->1) RSK correspondences (the latter ones are sometimes also called tropical). For 0<q<1 our…
We prove a intertwining relation (or Markov duality) between the $(q,\mu,\nu)$-Boson process and $(q,\mu,\nu)$-TASEP, two discrete time Markov chains introduced by Povolotsky. Using this and a variant of the coordinate Bethe ansatz we…
The dynamics of an infinite system of point particles in $\mathbb{R}^d$, which hop and interact with each other, is described at both micro- and mesoscopic levels. The states of the system are probability measures on the space of…
The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…
We define the concept of an `open' Markov process, a continuous-time Markov chain equipped with specified boundary states through which probability can flow in and out of the system. External couplings which fix the probabilities of…
For a series of Markov processes we prove stochastic duality relations with duality functions given by orthogonal polynomials. This means that expectations with respect to the original process (which evolves the variable of the orthogonal…
We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…
An infinite system of point particles placed in $\mathds{R}^d$ is studied. Its constituents perform random jumps with mutual repulsion described by a translation-invariant jump kernel and interaction potential, respectively. The pure states…
Integrable probability has emerged as an active area of research at the interface of probability/mathematical physics/statistical mechanics on the one hand, and representation theory/integrable systems on the other. Informally, integrable…
In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…
The aim of this note is to give an alternative construction of interlacements - as introduced by Sznitman - which makes use of classical probabilistic potential theory. In particular, we outline that the intensity measure of an…
We define nearest-neighbour point processes on graphs with Euclidean edges and linear networks. They can be seen as the analogues of renewal processes on the real line. We show that the Delaunay neighbourhood relation on a tree satisfies…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
We introduce a space inhomogeneous generalization of the dynamics on interlacing arrays considered by Borodin and Ferrari. We show that for a certain class of initial conditions the point process associated to the dynamics has determinantal…
Weakly stationary random processes of $k$-dimensional affine subspaces (flats) in $\mathbb{R}^n$ are considered. If $2k\geq n$, then intersection processes are investigated, while in the complementary case $2k<n$ a proximity process is…
We describe some recently discovered connections between one-dimensional interacting particle models and Macdonald polynomials. The first such model is the multispecies asymmetric simple exclusion process (ASEP) on a ring, linked to the…
The limits of scaled relative entropies between probability distributions associated with N-particle weakly interacting Markov processes are considered. The convergence of such scaled relative entropies is established in various settings.…