Related papers: Burnside process on parking functions and Dyck pat…

We study the Markov chain on $\mathbf{F}_p$ obtained by applying a function $f$ and adding $\pm\gamma$ with equal probability. When $f$ is a linear function, this is the well-studied Chung--Diaconis--Graham process. We consider two cases:…

In this paper we consider a large class of symmetric Markov processes $X=(X_t)_{t\ge0}$ on $\R^d$ generated by non-local Dirichlet forms, which include jump processes with small jumps of $\alpha$-stable-like type and with large jumps of…

The aim of this work is to extend to a general $S_m\times S_n$-module context the Grossman-Bizley paradigm that allows the enumeration of Dyck paths in a $m\times n$-rectangle. We obtain an explicit formula for the the "bi-Frobenius"…

We construct an infinitely exchangeable process on the set $\cate$ of subsets of the power set of the natural numbers $\mathbb{N}$ via a Poisson point process with mean measure $\Lambda$ on the power set of $\mathbb{N}$. Each $E\in\cate$…

We use a random pinning procedure to study amorphous order in two glassy spin models. On increasing the concentration of pinned spins at constant temperature, we find a sharp crossover (but no thermodynamic phase transition) from bulk…

We provide a geometric representation of the Poisson and Martin boundaries of a transient, bounded degree triangulation of the plane in terms of its circle packing in the unit disc. (This packing is unique up to M\"obius transformations.)…

In this paper, we study one dimensional Markov processes with spatial delay. Since the seminal work of Feller, we know that virtually any one dimensional, strong, homogeneous, continuous Markov process can be uniquely characterized via its…

Motivated by L\'{e}vy's characterization of Brownian motion on the line, we propose an analogue of Brownian motion that has as its state space an arbitrary closed subset of the line that is unbounded above and below: such a process will be…

The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…

Consider a continuous time Markov chain with rates Q in the state space \Lambda\cup\{0\} with 0 as an absorbing state. In the associated Fleming-Viot process N particles evolve independently in \Lambda with rates Q until one of them…

To reduce automobile exhaust pollution, traffic congestion and parking difficulties, bike-sharing systems are rapidly developed in many countries and more than 500 major cities in the world over the past decade. In this paper, we discuss a…

We study the convergence to equilibrium of the Dyson-Jacobi process, a system of n interacting particles on the segment [0, 1] arising from Random Matrix Theory. We establish the occurence of a cutoff phenomenon for the intrinsic…

Let $X_n$ be independent random elements in the Skorohod space $D([0,1];E)$ of c\`{a}dl\`{a}g functions taking values in a separable Banach space $E$. Let $S_n=\sum_{j=1}^nX_j$. We show that if $S_n$ converges in finite dimensional…

We introduce and study a family of Markov processes on partitions. The processes preserve the so-called z-measures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the…

Let $(G,\mu)$ be a uniformly elliptic random conductance graph on $\mathbb{Z}^d$ with a Poisson point process of particles at time $t=0$ that perform independent simple random walks. We show that inside a cube $Q_K$ of side length $K$, if…

We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…

We describe a Markov-Chain-Monte-Carlo algorithm which can be used to generate naturally labeled n-element posets at random with a probability distribution of one's choice. Implementing this algorithm for the uniform distribution, we…

Modeling stochastic traffic behaviors at the microscopic level, such as car-following and lane-changing, is a crucial task to understand the interactions between individual vehicles in traffic streams. Leveraging a recently developed theory…

In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts…

The Ornstein-Uhlenbeck process is interpreted as Brownian motion in a harmonic potential. This Gaussian Markov process has a bounded variance and admits a stationary probability distribution, in contrast to the standard Brownian motion. It…