Open AccessBook
Interacting Particle Systems
Reads0
Chats0
TLDR
The construction, and other general results are given in this paper, with values in [0, ] s. The voter model, the contact process, the nearest-particle system, and the exclusion process.Abstract:
The Construction, and Other General Results.- Some Basic Tools.- Spin Systems.- Stochastic Ising Models.- The Voter Model.- The Contact Process.- Nearest-Particle Systems.- The Exclusion Process.- Linear Systems with Values in [0, ?)s.read more
Citations
More filters
Proceedings ArticleDOI
Maximizing the spread of influence through a social network
TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Journal ArticleDOI
Statistical physics of social dynamics
TL;DR: In this article, a wide list of topics ranging from opinion and cultural and language dynamics to crowd behavior, hierarchy formation, human dynamics, and social spreading are reviewed and connections between these problems and other, more traditional, topics of statistical physics are highlighted.
Journal ArticleDOI
Traffic and related self-driven many-particle systems
Dirk Helbing,Dirk Helbing +1 more
TL;DR: This article considers the empirical data and then reviews the main approaches to modeling pedestrian and vehicle traffic, including microscopic (particle-based), mesoscopic (gas-kinetic), and macroscopic (fluid-dynamic) models.
Journal ArticleDOI
Evolutionary games on graphs
György Szabó,Gábor Fáth +1 more
TL;DR: The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Journal ArticleDOI
Statistical physics of vehicular traffic and some related systems
TL;DR: In this paper, a critical review of particle-hopping models of vehicular traffic is presented, focusing on the results obtained mainly from the so-called "particle hopping" models, particularly emphasizing those formulated in recent years using the language of cellular automata.