Rigorous Results for the Distribution of Money on Connected Graphs

Nicolas Lanchier, Stephanie Reed

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

This paper is concerned with general spatially explicit versions of three stochastic models for the dynamics of money that have been introduced and studied numerically by statistical physicists: the uniform reshuffling model, the immediate exchange model and the model with saving propensity. All three models consist of systems of economical agents that consecutively engage in pairwise monetary transactions. Computer simulations performed in the physics literature suggest that, when the number of agents and the average amount of money per agent are large, the limiting distribution of money as time goes to infinity approaches the exponential distribution for the first model, the gamma distribution with shape parameter two for the second model and a distribution similar but not exactly equal to a gamma distribution whose shape parameter depends on the saving propensity for the third model. The main objective of this paper is to give rigorous proofs of these conjectures and also extend these conjectures to generalizations of the first two models and a variant of the third model that include local rather than global interactions, i.e., instead of choosing the two interacting agents uniformly at random from the system, the agents are located on the vertex set of a general connected graph and can only interact with their neighbors.

Original languageEnglish (US)
Pages (from-to)727-743
Number of pages17
JournalJournal of Statistical Physics
Volume171
Issue number4
DOIs
StatePublished - May 1 2018

Keywords

  • Distribution of money
  • Econophysics
  • Immediate exchange model
  • Interacting particle systems
  • Uniform reshuffling
  • Uniform saving

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Mathematical Physics

Fingerprint

Dive into the research topics of 'Rigorous Results for the Distribution of Money on Connected Graphs'. Together they form a unique fingerprint.

Cite this