Related papers: Mean field interaction on random graphs with dynam…
We address a system of weakly interacting particles where the heterogenous connections among the particles are described by a graph sequence and the number of particles grows to infinity. Our results extend the existing law of large numbers…
Consider a finite system of diffusing particles coupled through a reactive boundary. Each particle is reflected, but may react with the boundary according to a killing mechanism which depends on the current reactivity of the boundary and…
We analyse the stability of linear dynamical systems defined on sparse, random graphs with predator-prey, competitive, and mutualistic interactions. These systems are aimed at modelling the stability of fixed points in large systems defined…
We consider an SIR-type (Susceptible $\to$ Infected $\to$ Recovered) stochastic epidemic process with multiple modes of transmission on a contact network. The network is given by a random graph following a multilayer configuration model…
We use probabilistic methods to study properties of mean-field models, arising as large-scale limits of certain particle systems with mean-field interaction. The underlying particle system is such that $n$ particles move forward on the real…
We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose…
We consider Mckean-Vlasov type stochastic differential equations with multiplicative noise arising from the random vortex method. Such an equation can be viewed as the mean-field limit of interacting particle systems with singular…
We study the stochastic system of interacting neurons introduced in De Masi et al. (2015) and in Fournier and L\"ocherbach (2016) in a diffusive scaling. The system consists of $N$ neurons, each spiking randomly with rate depending on its…
We study a system of reflected Brownian motions on the positive half-line in which each particle has a drift toward the origin determined by the local times at the origin of all the particles. If this local time drift is too strong, such…
We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…
We consider a multilevel continuous time Markov chain $X(s;N) = (X_i^j(s;N): 1 \leq i \leq j \leq N)$, which is defined by means of Jack symmetric functions and forms a certain discretization of the multilevel Dyson Brownian motion. The…
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to randomly chosen nodes. A matching is chosen, and the load is…
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
This paper addresses the bipartite consensus-control problem in open multi-agent systems containing both cooperative and antagonistic interactions. In these systems, new agents can join and new interactions can be formed over time.…
We address the long time behaviour of weakly interacting diffusive particle systems on the d-dimensional torus. Our main result is to show that, under certain regularity conditions, the weak error between the empirical distribution of the…
We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr\"odinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
The work treats systems combining slow and fast motions depending on each other where fast motions are perturbations of families of either dynamical systems or Markov processes with freezed slow variable. In the first case we consider…
The goal of this paper is to approximate several kinds of {\it Mckean-Vlasov SDEs} with {\it irregular coefficients} via weakly interacting particle systems. More precisely, propagation of chaos and convergence rate of Euler-Maruyama scheme…