Related papers: Locally interacting diffusions as space-time Marko…

In order to study the stochastic Markov processes conditioned on a specific value of a time-integrated observable, the concept of ensembles of trajectories has been recently used extensively. In this paper, we consider a generic…

We study the limiting behaviour of the empirical measure of a system of diffusions interacting through their ranks when the number of diffusions tends to infinity. We prove that the limiting dynamics is given by a McKean-Vlasov evolution…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

In this paper we study macroscopic density equations in which the diffusion coefficient depends on a weighted spatial average of the density itself. We show that large differences (not present in the local density-dependence case) appear…

We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…

This paper provides an introduction to some stochastic models of lattice gases out of equilibrium and a discussion of results of various kinds obtained in recent years. Although these models are different in their microscopic features, a…

We study the stochastic dynamics of a system of interacting species in a stochastic environment by means of a continuous-time Markov chain with transition rates depending on the state of the environment. Models of gene regulation in systems…

We analyse diffusion dynamics on weakly-coupled networks (interconnected networks) by means of separation of time scales. Using an adiabatic approximation we reduced the system dynamics to a Markov chain with aggregated variables and…

Conditional independence and graphical models are crucial concepts for sparsity and statistical modeling in higher dimensions. For L\'evy processes, a widely applied class of stochastic processes, these notions have not been studied. By the…

Sticky diffusion processes on bounded domains spend finite time (and finite mean time) on the lower-dimensional space given by the boundary. Once the process hits the boundary, then it starts again after a random amount of time. While on…

In this paper, we are interested in investigating the perturbation bounds for the stationary distributions for discrete-time or continuous-time Markov chains on a countable state space. For discrete-time Markov chains, two new norm-wise…

Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…

We construct a planar diffusion process whose infinitesimal generator depends only on the order of the components of the process. Speaking informally and a bit imprecisely for the moment, imagine you run two Brownian-like particles on the…

Using the method of Krylov's estimates, we prove the existence of weak solutions of stochastic differential equations driven by purely discontinuous Levy processes satisfying an additional assumption. The diffusion coefficient is assumed to…

We consider a sequence of systems of Hawkes processes having mean field interactions in a diffusive regime. The stochastic intensity of each process is a solution of a stochastic differential equation driven by N independent Poisson random…

Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…

The analysis of local minima in time series data and random landscapes is essential across numerous scientific disciplines, offering critical insights into system dynamics. Recently, Kundu, Majumdar, and Schehr derived the exact…

We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graphs and a modified version of the Metropolis MCMC algorithm on…

Maximum entropy (maxEnt) inference of state probabilities using state-dependent constraints is popular in the study of complex systems. In stochastic dynamical systems, the effect of state space topology and path-dependent constraints on…

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…