Related papers: Graphon Quantum Filtering Systems
In this paper, we consider a system of heterogeneously interacting quantum particles subject to indirect continuous measurement. The interaction is assumed to be of the mean-field type. We derive a new limiting quantum graphon system, prove…
We consider heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with weights characterized by an underlying graphon. A law of large numbers result is established as…
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…
We consider a system of $N$ particles whose interactions are characterized by a (weighted) graph $G^N$. Each particle is a node of the graph with an internal state. The state changes according to Markovian dynamics that depend on the states…
We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e., two particles are interacting if and only if they are connected in the underlying…
This paper studies linear quadratic graphon mean field games (LQ-GMFGs) with common noise, in which a large number of agents are coupled via a weighted undirected graph. One special feature, compared with the well-studied graphon mean field…
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…
We derive the stochastic master equations, that is to say, quantum filters, and master equations for an arbitrary quantum system probed by a continuous-mode bosonic input field in two types of non-classical states. Specifically, we consider…
In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…
We study a nonlinear graphon particle system driven by both idiosyncratic and common noise, where interactions are governed by a graphon and represented as positive finite measures. Each particle evolves via a McKean-Vlasov-type SDE with…
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 study heterogeneously interacting diffusive particle systems with mean-field type interaction characterized by an underlying graphon and their finite particle approximations. Under suitable conditions, we obtain exponential concentration…
This paper builds upon the methods developed in [22] and [15] to investigate the large population behavior of non exchangeable systems of N diffusive particles when the interaction matrix converges (in some sense) to a graphon. We first…
In this work, we consider one-dimensional particles interacting in mean-field type through a bounded kernel. In addition, when particles hit some barrier (say zero), they are removed from the system. This absorption of particles is…
The purpose of this paper is to determine quantum master and filter equations for systems coupled to fields in certain non-classical continuous-mode states. Specifically, we consider two types of field states (i) single photon states, and…
We present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
We introduce a mean field game for a family of filtering problems related to the classic sequential testing of the drift of a Brownian motion. To the best of our knowledge this work presents the first treatment of mean field filtering games…
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…
This paper studies stochastic games on large graphs and their graphon limits. We propose a new formulation of graphon games based on a single typical player's label-state distribution. In contrast, other recently proposed models of graphon…
In this paper, we study graphon mean field games using a system of forward-backward stochastic differential equations. We establish the existence and uniqueness of solutions under two different assumptions and prove the stability with…