惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

C
Check Point Blog
有赞技术团队
有赞技术团队
博客园 - 三生石上(FineUI控件)
博客园_首页
博客园 - 【当耐特】
WordPress大学
WordPress大学
月光博客
月光博客
博客园 - 叶小钗
S
SegmentFault 最新的问题
雷峰网
雷峰网
H
Help Net Security
宝玉的分享
宝玉的分享
A
About on SuperTechFans
IT之家
IT之家
J
Java Code Geeks
Hugging Face - Blog
Hugging Face - Blog
D
DataBreaches.Net
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 聂微东
T
The Blog of Author Tim Ferriss
B
Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Y
Y Combinator Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Topological traps in evolutionary games
Jose Segovia-Martin · 2026-01-25 · via math.CO updates on arXiv.org

How cooperation originates and persists among self-interested individuals is a central question in the social and behavioural sciences. In the canonical two-dimensional spatial Prisoner's Dilemma with unconditional imitation introduced by Nowak and May (1992), simulations on a Moore lattice show an abrupt drop in cooperation near the temptation $T\approx5/3$, yet even under these harsh conditions cooperative structures can still arise. However, the nucleation rates of these motifs, and their contribution along the full cooperation curve had not been quantified. Here we show, using large-scale Monte Carlo simulations combined with automatic cluster classification, that on the Moore lattice for $T\ge5/3$ residual cooperation is sustained exclusively by $3\times3$ (or larger) rectangular cooperator bricks, whereas on degree-8 random-regular graphs for $T\gtrsim1.5$ it is dominated by star-like motifs (1 hub + 8 leaves). Once the dynamics becomes nucleation limited, the macroscopic cooperation level is therefore governed by the statistics of a few exceptionally resilient shapes, rather than by many different cooperator motifs. Furthermore, we show that the lattice cooperation collapse near $T=5/3$ is kinetic rather than critical: the reduction in cooperation is not due to a loss of growth capacity of rectangular bricks, but to the progressive destabilisation of the subcritical motifs that dominate just below this threshold. Our results show that residual cooperation at high temptation is a rare-event nucleation phenomenon governed by a small set of topological traps, and highlight the value of motif-level analysis for explaining and engineering cooperation in spatial, social, and technological networks.