Related papers: Exchangeable Markov processes on graphs: Feller ca…
We study a class of strongly irreducible, multidimensional, topological Markov shifts, comparing two notions of "symmetric measure": exchangeability and the Gibbs (or conformal) property. We show that equilibrium measures for such shifts…
A class of Fleming-Viot processes with decaying sampling rates and $\alpha$-stable motions that correspond to distributions with growing populations are introduced and analyzed. Almost sure long-time scaling limits for these processes are…
This work focuses on a class of functional stochastic Hamiltonian systems with singular coefficients and state-dependent switching, in which the switching process has a countably infinite state space. First, by Girsanov's transformation, we…
We derive the exact solution of a one-dimensional Markov functional model with log-normally distributed interest rates in discrete time. The model is shown to have two distinct limiting states, corresponding to small and asymptotically…
In this work, we consider, in a general setting, multiparameter multidimensional Markov processes that are time-changed by an independent additive subordinator. By extending Phillips theorem, we show that the resulting process is a Feller…
We consider piecewise deterministic Markov processes with degenerate transition kernels of the "house-of-cards"-type. We use a splitting scheme based on jump times to prove the absolute continuity, as well as some regularity, of the…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
We study two equivalent characterizations of the strong Feller property for a Markov process and of the associated sub-Markovian semigroup. One is described in terms of locally uniform absolute continuity, whereas the other uses local…
In this paper, we consider a long-time behavior of stable-like processes. A stable-like process is a Feller process given by the symbol $p(x,\xi)=-i\beta(x)\xi+\gamma(x)|\xi|^{\alpha(x)},$ where $\alpha(x)\in(0,2)$, $\beta(x)\in\R$ and…
Flip processes, introduced in [Garbe, Hladk\'y, \v{S}ileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule which is just a function…
By constructing jointly a random graph and an associated exploration process, we define the dynamics of a "parking process" on a class of uniform random graphs as a measure-valued Markov process, representing the empirical degree…
We study Markov processes with values in the space of general two-dimensional arrays whose distribution is exchangeable. The results of this paper are inspired by the theory of exchangeable dynamical random graphs developed by H. Crane…
This paper studies three ways to construct a nonhomogeneous jump Markov process: (i) via a compensator of the random measure of a multivariate point process, (ii) as a minimal solution of the backward Kolmogorov equation, and (iii) as a…
Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or…
We consider a nonequilibrium process on a timeline with discrete sites which evolves by a non-Markovian update rule in such a way that an active site at time t activates one or several sites in the future at time t+dt. The time intervals dt…
Consider a system $X = ((x_\xi(t)), \xi \in \Omega_N)_{t \geq 0}$ of interacting Fleming-Viot diffusions with mutation and selection which is a strong Markov process with continuous paths and state space $(\CP(\I))^{\Omega_N}$, where $\I$…
Exchangeability -- in which the distribution of an infinite sequence is invariant to reorderings of its elements -- implies the existence of a simple conditional independence structure that may be leveraged in the design of statistical…
We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of…
We propose a new generalisation of jump-telegraph process with variable velocities and jumps. Amplitude of the jumps and velocity values are random, and they depend on the time spent by the process in the previous state of the underlying…
We show that any finitely dependent invariant process on a transitive amenable graph is a finitary factor of an i.i.d. process. With an additional assumption on the geometry of the graph, namely that no two balls with different centers are…