Hypergraph Coloring Games and Voter Models

DOI10.1080/15427951.2013.833676zbMath1461.05140OpenAlexW3032273647MaRDI QIDQ4985349

Alexander Tsiatas, Fan R. K. Chung

Publication date: 23 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2013.833676

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Games involving graphs (91A43) Voting theory (91B12) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Related Items (3)

Networks beyond pairwise interactions: structure and dynamics ⋮ The structure and dynamics of networks with higher order interactions ⋮ A Bounded-Confidence Model of Opinion Dynamics on Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Edge flipping in graphs
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Random walks and hyperplane arrangements
• Semigroups, rings, and Markov chains
• Laplacians and the Cheeger inequality for directed graphs
• An exact formula for the move-to-front rule for self-organizing lists
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Über eine weitere Verallgemeinerung des Verbandsbegriffes
• Learning, Local Interaction, and Coordination
• Consensus Over Ergodic Stationary Graph Processes
• A model for spatial conflict
• Learning, Mutation, and Long Run Equilibria in Games
• The Evolution of Conventions

This page was built for publication: Hypergraph Coloring Games and Voter Models