A Generic Mean Field Convergence Result for Systems of Interacting Objects
- 1 September 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We consider a model for interacting objects, where the evolution of each object is given by a finite state Markov chain, whose transition matrix depends on the present and the past of the distribution of states of all objects. This is a general model of wide applicability; we mention as examples: TCP connections, HTTP flows, robot swarms, reputation systems. We show that when the number of objects is large, the occupancy measure of the system converges to a deterministic dynamical system (the "mean field") with dimension the number of states of an individual object. We also prove a fast simulation result, which allows to simulate the evolution of a few particular objects imbedded in a large system. We illustrate how this can be used to model the determination of reputation in large populations, with various liar strategies.Keywords
This publication has 11 references indexed in Scilit:
- Integrating streaming and file-transfer Internet traffic: fluid and diffusion approximationsQueueing Systems, 2007
- Analysis of a robust reputation system for self‐organised networksEuropean Transactions on Telecommunications, 2005
- Analysis of a Reputation System for Mobile Ad-Hoc Networks with LiarsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Balancing Queues by Mean Field InteractionQueueing Systems, 2005
- Modeling Swarm Robotic Systems: a Case Study in Collaborative Distributed ManipulationThe International Journal of Robotics Research, 2004
- Deterministic Approximation of Stochastic Evolution in GamesEconometrica, 2003
- Limit behavior of ECN/RED gateways under a large number of TCP flowsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Performance analysis of the CONFIDANT protocolPublished by Association for Computing Machinery (ACM) ,2002
- Models for transporation networksJournal of Mathematical Sciences, 1997
- Dobrushin's approach to queueing network theoryJournal of Applied Mathematics and Stochastic Analysis, 1996