Related papers: Mean field systems on networks, with singular inte…
We present a unified framework, with quantitative estimates, for deterministic interacting particle systems whose pairwise interactions may depend on heterogeneous labels. Heterogeneity is kept at every level by adding a frozen label…
We study an interacting particle system whose dynamics depends on an interacting random environment. As the number of particles grows large, the transition rate of the particles slows down (perhaps because they share a common resource of…
We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…
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 consider a finite number of $N$ statistically equal agents, each moving on a finite set of states according to a continuous-time Markov Decision Process (MDP). Transition intensities of the agents and generated rewards depend not only on…
The framework of Mean-field Games (MFGs) is used for modelling the collective dynamics of large populations of non-cooperative decision-making agents. We formulate and analyze a kinetic MFG model for an interacting system of non-cooperative…
Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic traffic assignment problem modeled by a flow over time game, in which every particle tries to reach its…
We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the…
We introduce and study a nonlinear discrete dynamical system describing the evolution of a resource distribution among interacting agents. The model generalizes several classical mean-field and opinion-dynamics frameworks and is defined on…
Trail interactions occur when past particle trajectories bias future motion, rendering the system out of thermodynamic equilibrium. While such systems are abundant in nature, their understanding is limited to the single-particle level or…
We introduce a framework to prove propagation of chaos for interacting particle systems with singular, density-dependent interactions, a classical challenge in mean-field theory. Our approach is to define the dynamics implicitly via a…
We provide a detailed multiscale analysis of a system of particles interacting through a dynamical network of links. Starting from a microscopic model, via the mean field limit, we formally derive coupled kinetic equations for the particle…
We study a dynamical system motivated by our earlier work on the statistical physics of social balance on graphs that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a…
We develop a continuum limit and mean-field theory for interacting particle systems (IPS) on self-similar networks, a new class of discrete models whose large-scale behavior gives rise to nonlocal evolution equations on fractal domains.…
We study discrete-time, finite-state mean-field games (MFGs) under model uncertainty, where agents face ambiguity about the state transition probabilities. Each agent maximizes its expected payoff against the worst-case transitions within…
This note is a companion article to the recent paper L\"ocherbach, Loukianova, Marini (2024). We consider mean field systems of interacting particles. Each particle jumps with a jump rate depending on its position. When jumping, a…
Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…
Most networks are not static objects, but instead they change over time. This observation has sparked rigorous research on temporal graphs within the last years. In temporal graphs, we have a fixed set of nodes and the connections between…
We study the dynamics of a spin-flip model with a mean field interaction. The system is non reversible, spacially inhomogeneous, and it is designed to model social interactions. We obtain the limiting behavior of the empirical averages in…
The theory of Mean-Field Games is interested in the behaviour of interacting particle systems in which the individual interaction between particles (players) decreases as the size of the population increases. In recent years, it was…