Related papers: The pilgrim process
A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its transpose allows us to show that for a more complicated network,…
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…
This paper presents mathematical results in support of the methodology of the probabilistic learning on manifolds (PLoM) recently introduced by the authors, which has been used with success for analyzing complex engineering systems. The…
We consider a distributionally robust Partially Observable Markov Decision Process (DR-POMDP), where the distribution of the transition-observation probabilities is unknown at the beginning of each decision period, but their realizations…
Clustered observations are ubiquitous in controlled and observational studies and arise naturally in multi-centre trials or longitudinal surveys. We present a novel model for the analysis of clustered observations where the marginal…
We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…
We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
We consider a non-conserving zero-range process with hopping rate proportional to the number of particles at each site. Particles are added to the system with a site-dependent creation rate, and removed from the system with a uniform…
Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…
Models of bacterial growth tend to be `irreversible', allowing for the number of bacteria in a colony to increase but not to decrease. By contrast, models of molecular self-assembly are usually `reversible', allowing for addition and…
We extend the peeling exploration introduced in arxiv:1506.01590 to the setting of Boltzmann planar maps coupled to a rigid $O(n)$ loop model. Its law is related to a class of discrete Markov processes obtained by confining random walks to…
We study a mass transport model on a ring with parallel update, where a continuous mass is randomly redistributed along distinct links of the lattice, choosing at random one of the two partitions at each time step. The redistribution…
We explore the impact of long-range memory on the properties of a family of quantum walks in a one-dimensional lattice and discrete time, which can be understood as the quantum version of the classical "Elephant Random Walk" non-Markovian…
Analogues of stepping--stone models are considered where the site--space is continuous, the migration process is a general Markov process, and the type--space is infinite. Such processes were defined in previous work of the second author by…
The proposal and study of dependent prior processes has been a major research focus in the recent Bayesian nonparametric literature. In this paper, we introduce a flexible class of dependent nonparametric priors, investigate their…
We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…
We cast episodic Markov decision process (MDP) planning as Bayesian inference over policies. A policy is treated as the latent variable and is assigned an unnormalized probability of optimality that is monotone in its expected return,…
This paper studies the workload distribution of a finite-capacity queue driven by a spectrally one-sided Markov additive process (MAP). Our main result provides the Laplace-Stieltjes transform of the workload at an exponentially distributed…
When the \textit{martingale representation property} holds, we call any local martingale which realizes the representation a \textit{representation process}. There are two properties of the \textit{representation process} which can greatly…