Social

The registered models of skcomplex.models.social. The page of each shows its factory, its component types with their states, parameters, and laws as written, and, for the forms that have them, its equations as SymbolicAnalysis returns them, so it serves as the pattern for a model of your own.

Cooperation

• Iterated prisoner's dilemma tournament: The evolution of strategies of the iterated prisoner's dilemma from random genomes.
• Public goods game: The spatial public goods game in groups of five neighbours, with Fermi imitation.
• Public goods game on hypergraphs: The public goods game on a hypergraph, played in every hyperedge, with Fermi imitation.
• Spatial prisoner's dilemma with best-neighbour and Fermi imitation: The spatial prisoner's dilemma of Nowak and May, with best-neighbour or Fermi imitation.
• Two-player games on links and three-body games on 2-simplices: The social dilemmas of Guo et al. on the links and the 2-simplices of a simplicial complex.

Crowds

• Criminality and security: The kinetic model of criminality in a society and the security forces that act against it.
• Crowd dynamics and evacuation: The kinetic model of the evacuation of a building whose rooms form a network.
• Social force pedestrians: Two crowds walking in opposite directions along a periodic corridor, which form lanes.

Language

• Mandelbrot least-effort word frequencies: The word frequencies that minimise the mean cost of a language over its entropy, a power law of rank.

Opinion dynamics

• Axelrod culture dissemination: Axelrod's culture dissemination model on a full grid with von Neumann neighbourhoods.
• Belief diffusion with influentials: The belief diffusion model with influentials who care passionately and weigh more with their neighbours.
• Coevolving voter: The coevolving voter model, which fragments into consensual components when rewiring is fast.
• Cognitive consistency agents: Agents whose attitudes spread by conversation and settle in a belief network that seeks consistency.
• Complex agents with internal states and standardization: Complex agents whose interactions make them standardized, all showing one characteristic, and ordered.
• Deffuant bounded confidence: The Deffuant bounded confidence model, whose opinions settle into about 1 / (2 * confidence) clusters.
• Galam majority: The Galam majority model, where random groups adopt their majority until one opinion wins.
• Hegselmann-Krause: The Hegselmann-Krause model, whose opinions freeze within a few steps into clusters about 2 ε apart.
• Join-a-club spins: Join-a-club spins, agents who join a club with their acquaintances while acquaintances follow the club.
• Kinetic opinion formation: The kinetic model of opinion formation over a discrete grid of opinions.
• Majority rule automaton: Voters that take the majority opinion of their neighbourhood, which coarsens into domains.
• Naming game: The minimal naming game, where agents with empty inventories agree on one word.
• Nonlinear three-body consensus on temporal hypergraphs: The nonlinear three-body consensus model on a random hypergraph of triangles that switch on and off.
• Social impact theory: The social impact model on a full grid, with random persuasiveness and supportiveness.
• Sznajd: The Sznajd model, where agreeing pairs of agents convince their neighbours.
• Threshold adoption: The threshold adoption model in social circles, started by the 2.5% of agents with the lowest thresholds.
• Voter model: A voter model with one voter per node of a network.
• Voter variants: Voter model variants on a network, with threshold voters and a share of contrarians.

Organizations

• Barabási priority queues: The Barabási priority queue, whose waiting times follow a power law as the choice becomes greedy.
• Bonabeau hierarchies: The Bonabeau model, where a hierarchy of strengths emerges above a critical density of agents.
• Brothel movement model: The brothel movement model, where victims moved between brothels leave traces in bills and train trips.
• Employment takeover: The employment takeover model on a periodic checkerboard, with half of each kind coloured at random.
• Escalation: Meadows' escalation trap, two parties that each want to exceed the other's stock by a margin.
• Gravity interaction model of urban scaling: The residents of a city at uniform positions in a disc, each interacting with the others as r^-gamma.
• Insider sabotage: The insider sabotage model of employees whose risk of sabotage builds up over the days of a year.
• Obesity model: The obesity model of adults who eat near home and work, one step per day.
• Shifting the burden: Meadows' shifting the burden trap, a quick fix that relieves a symptom and erodes the system's capability.
• Success to the successful: Meadows' success to the successful trap, two competitors that share a budget by their past success.

Segregation

• Schelling: A Schelling segregation model on a grid with at most one resident per cell.
• Stochastic Schelling: The stochastic Schelling model of agents moving between blocks, which segregates above beta = 2.

Spreading

• Maki-Thompson rumours: The Maki-Thompson rumour model started by one spreader, which leaves about 20% of people ignorant.
• SIS on hypergraphs with heterogeneous exposure and a nonlinear infection kernel: The SIS contagion of St-Onge et al. in the environments of a hypergraph, with a nonlinear kernel.
• Simon-Yule growth: The Simon model of a text that grows from one word, whose word counts follow a power law.
• Simplicial contagion: The simplicial contagion of Iacopini et al., an SIS process on the links and triangles of a complex.
• Watts threshold cascades: The Watts threshold model of global cascades started by a few random seeds.