اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA refined mean field approximation of synchronous discrete-time population models
381
0
0.0
(
0
)
تأليف
Nicolas Gast
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Mean field approximation is a popular method to study the behaviour of stochastic models composed of a large number of interacting objects. When the objects are asynchronous, the mean field approximation of a population model can be expressed as an ordinary differential equation. When the objects are (clock-) synchronous the mean field approximation is a discrete time dynamical system. We focus on the latter.We study the accuracy of mean field approximation when this approximation is a discrete-time dynamical system. We extend a result that was shown for the continuous time case and we prove that expected performance indicators estimated by mean field approximation are $O(1/N)$-accurate. We provide simple expressions to effectively compute the asymptotic error of mean field approximation, for finite time-horizon and steady-state, and we use this computed error to propose what we call a emph{refined} mean field approximation. We show, by using a few numerical examples, that this technique improves the quality of approximation compared to the classical mean field approximation, especially for relatively small population sizes.
قيم البحث
اقرأ أيضاً
Gossip protocols form the basis of many smart collective adaptive systems. They are a class of fully decentralised, simple but robust protocols for the distribution of information throughout large scale networks with hundreds or thousands of nodes. M
ean field analysis methods have made it possible to approximate and analyse performance aspects of such large scale protocols in an efficient way. Taking the gossip shuffle protocol as a benchmark, we evaluate a recently developed refined mean field approach. We illustrate the gain in accuracy this can provide for the analysis of medium size models analysing two key performance measures. We also show that refined mean field analysis requires special attention to correctly capture the coordination aspects of the gossip shuffle protocol.
In this paper, we consider discrete-time partially observed mean-field games with the risk-sensitive optimality criterion. We introduce risk-sensitivity behaviour for each agent via an exponential utility function. In the game model, each agent is we
akly coupled with the rest of the population through its individual cost and state dynamics via the empirical distribution of states. We establish the mean-field equilibrium in the infinite-population limit using the technique of converting the underlying original partially observed stochastic control problem to a fully observed one on the belief space and the dynamic programming principle. Then, we show that the mean-field equilibrium policy, when adopted by each agent, forms an approximate Nash equilibrium for games with sufficiently many agents. We first consider finite-horizon cost function, and then, discuss extension of the result to infinite-horizon cost in the next-to-last section of the paper.
IIn this paper we study a general class of hybrid mathematical models of collective motions of cells under the influence of chemical stimuli. The models are hybrid in the sense that cells are discrete entities given by ODE, while the chemoattractant
is considered as a continuous signal which solves a diffusive equation. For this model we prove the mean-field limit in the Wasserstein distance to a system given by the coupling of a Vlasov-type equation with the chemoattractant equation. Our approach is not based on empirical measures and we show the limit with explicit bounds, by proving also existence and uniqueness for the limit system. In the monokinetic case we derive pressureless nonlocal Euler-type model with chemotaxis.
We develop a general technique for proving convergence of repeated quantum interactions to the solution of a quantum stochastic differential equation. The wide applicability of the method is illustrated in a variety of examples. Our main theorem, whi
ch is based on the Trotter-Kato theorem, is not restricted to a specific noise model and does not require boundedness of the limit coefficients.
This paper studies a general class of stochastic population processes in which agents interact with one another over a network. Agents update their behaviors in a random and decentralized manner based only on their current state and the states of the
ir neighbors. It is well known that when the number of agents is large and the network is a complete graph (has all-to-all information access), the macroscopic behavior of the population converges to a differential equation called a {it mean-field approximation}. When the network is not complete, it is unclear in general whether there exists a suitable mean-field approximation for the macroscopic behavior of the population. This paper provides general conditions on the network and policy dynamics for which a suitable mean-field approximation exists. First, we show that as long as the network is well-connected, the macroscopic behavior of the population concentrates around the {it same} mean-field system as the complete-graph case. Next, we show that as long as the network is sufficiently dense, the macroscopic behavior of the population concentrates around a mean-field system that is, in general, {it different} from the mean-field system obtained in the complete-graph case. Finally, we provide conditions under which the mean-field approximation is equivalent to the one obtained in the complete-graph case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
