Related papers: A note on uniform in time mean-field limit in grap…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
We study the large-population convergence of a consensus-based algorithm for the saddle point problem proposed by ArXiv: 2212.12334, establishing the uniform-in-time propagation of chaos using a coupling method. Our work shows that the…
We rigorously derive non-equilibrium space-time fluctuation for the particle density of a system of reflected diffusions in bounded Lipschitz domains in $\mathbb R^d$. The particles are independent and are killed by a time-dependent…
The epidemic process on a graph is considered for which infectious contacts occur at rate which depends on whether a susceptible is infected for the first time or not. We show that the Vasershtein coupling extends if and only if secondary…
We consider a one-dimensional diffusion process with coefficients that are periodic outside of a finite 'interface region'. The question investigated in this article is the limiting long time / large scale behaviour of such a process under…
We study the stabilization time of a wide class of processes on graphs, in which each node can only switch its state if it is motivated to do so by at least a $\frac{1+\lambda}{2}$ fraction of its neighbors, for some $0 < \lambda < 1$. Two…
Interacting particle systems are known for their ability to generate large-scale self-organized structures from simple local interaction rules between each agent and its neighbors. In addition to studying their emergent behavior, a main…
We numerically study a billiard system with a time-dependent force, and our results suggest the existence of a limitation on possible transitions between steady states in Hamiltonian chaos, in analogy to the limitation on transitions…
Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
In this paper we propose a method of proving impossibility results based on applying strong data-processing inequalities to estimate mutual information between sets of variables forming certain Markov random fields. The end result is that…
We consider the spinless Pauli-Fierz Hamiltonian which describes a quantum system of non-relativistic identical particles coupled to the quantized electromagnetic field. We study the time evolution in a mean-field limit where the number $N$…
We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…
In this paper we obtain uniform propagation estimates for systems of interacting diffusions. We adopt a general model, satisfying various conditions which ensure that the decay resulting from the internal dynamics term dominates the…
The random batch method [J. Comput. Phys. 400 (2020) 108877] is not only an efficient algorithm for simulation of classical $N$-particle systems and their mean-field limit, but also a new model for interacting particle system that could be…
We derive explicit central moment inequalities for random variables that admit a Stein coupling, such as exchangeable pairs, size--bias couplings or local dependence, among others. The bounds are in terms of moments (not necessarily…
Consensus of autonomous agents is a benchmark problem in cooperative control. In this paper, we consider standard continuous-time averaging consensus policies (or Laplacian flows) over time-varying graphs and focus on robustness of…
We study 1-Wasserstein propagation of chaos for "McKean-type" nonlinear Markov chains and their associated interacting particle systems. This paper is organized into two parts: the first part combines arguments from various areas of…
In the context of interacting particle systems, we study the influence of the action of the semigroup on the concentration property of Lipschitz functions. As an application, this gives a new approach to estimate the relaxation speed to…
By using coupling by change of conditional probability measure, the log-Harnack inequality for path dependent McKean-Vlasov SDEs with distribution dependent diffusion coefficients is established, which together with the exponential…