Related papers: A note on uniform in time mean-field limit in grap…

This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…

Discoveries of fundamental limits for the rates of physical processes, from the speed of light to the Lieb-Robinson bound for information propagation, often lead to breakthroughs in the our understanding of the underlying physics. Here we…

We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each…

We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…

This paper develops a non-asymptotic approach to mean field approximations for systems of $n$ diffusive particles interacting pairwise. The interaction strengths are not identical, making the particle system non-exchangeable. The marginal…

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…

In this article, we establish exponential contraction results for the diameter and variance of general first-order multiagent systems. Our approach is based on compactification techniques, and works under rather mild assumptions. Namely, we…

Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…

Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…

The Ornstein-Uhlenbeck process of diffusion in the harmonic potential is re-examined in the context of the first-passage time problem. We investigate this problem to the extent that it has not yet been fully resolved and demonstrate exact…

We investigate an effective model of proximity modified graphene (or symmetrylike materials) with broken time-reversal symmetry. We predict the appearance of quantum anomalous Hall phases by computing bulk band gap and Chern numbers for…

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

Graph-theoretic tools and techniques have seen wide use in the multi-agent systems literature, and the unpredictable nature of some multi-agent communications has been successfully modeled using random communication graphs. Across both…

The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…

After reexamining the above barrier diffusion problem where we notice that the wave packet collision implies the existence of {\em multiple} reflected and transmitted wave packets, we analyze the way of obtaining phase times for…

We study stochastic particle systems on a complete graph and derive effective mean-field rate equations in the limit of diverging system size, which are also known from cluster aggregation models. We establish the propagation of chaos under…

We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes…

We study an approximation by time-discretized geodesic random walks of a diffusion process associated with a family of time-dependent metrics on manifolds. The condition we assume on the metrics is a natural time-inhomogeneous extension of…

The phenomena of synchronization and nontrivial collective behavior are studied in a model of coupled chaotic maps with random global coupling. The mean field of the system is coupled to a fraction of elements randomly chosen at any given…

We review recent quantitative results on the approximation of mean field diffusion equations by large systems of interacting particles, obtained by optimal coupling methods. These results concern a larger range of models, more precise…