Related papers: Continuum limit for interacting systems on adaptiv…
We obtain the large scale limit of the fluctuations around its hydrodynamic limit of the density of particles of a weakly asymmetric exclusion process in dimension up to three. The proof is based upon a sharp estimate on the relative…
Discrete systems with long-range interactions are considered. Continuous medium models as continuous limit of discrete chain system are defined. Long-range interactions of chain elements that give the fractional equations for the medium…
Wasserstein gradient flows on probability measures have found a host of applications in various optimization problems. They typically arise as the continuum limit of exchangeable particle systems evolving by some mean-field interaction…
We consider a rate control problem for an $N$-particle weakly interacting finite state Markov process. The process models the state evolution of a large collection of particles and allows for multiple particles to change state…
The goal of this work is to identify steady-state solutions to dynamical systems defined on large, random families of networks. We do so by passing to a continuum limit where the adjacency matrix is replaced by a non-local operator with…
We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…
For systems of coupled differential equations on a sequence of W-random graphs, we derive the continuum limit in the form of an evolution integral equation. We prove that solutions of the initial value problems (IVPs) for the discrete model…
Irreversible random sequential deposition of interacting particles is widely used to model aggregation phenomena in physical, chemical, and biophysical systems. We show that in one dimension the exact time dependent solution of such…
We study the dynamics of a system composed of interacting units each with a complex internal structure comprising many subunits. We consider the case in which each subunit grows in a multiplicative manner. We propose a model for such…
We consider a system of particles which interact through a jump process. The jump intensities are functions of the proximity rank of the particles, a type of interaction referred to as topological in the literature. Such interactions have…
For interacting particle systems that satisfies the gradient condition, the hydrodynamic limit and the equilibrium fluctuations are well known. We prove that under the presence of a symmetric random environment, these scaling limits also…
The microscopic and macroscopic dynamics of random networks is investigated in the strong-dilution limit (i.e. for sparse networks). By simulating chaotic maps, Stuart-Landau oscillators, and leaky integrate-and-fire neurons, we show that a…
In this paper we investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model very large networks. We show that under some conditions, a sequence of Markov chains…
Graphs are widespread data structures used to model a wide variety of problems. The sheer amount of data to be processed has prompted the creation of a myriad of systems that help us cope with massive scale graphs. The pressure to deliver…
For any system $\{i\}$ of particles with the trajectories $x_{i}(t)$ in $R^{d}$ on a finite time interval $[0,\tau]$ we define the interaction graph $G$. Vertices of $G$ are the particles, there is an edge between two particles $i,j$ iff…
We determine the large size limit of a network of interacting Hawkes Processes on an adaptive network. The flipping of the node variables is taken to have an intensity given by the mean-field of the afferent edges and nodes. The flipping of…
We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we…
We study the problem of synchronizing a general complex network by means of an adaptive strategy in the case where the network topology is slowly time varying and every node receives at each time only one aggregate signal from the set of…
In this paper we consider a class of interacting particle systems on dynamic random networks, in which the joint dynamics of vertices and edges acts as one-way feedback, i.e., edges appear and disappear over time depending on the state of…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…