Metraipolis › archive › dc_8685013ff618

When a Few Misfits Trigger Digital Adoption Cascades: Network Reach, Threshold Heterogeneity, and Performance-Conditioned Complex Contagion in an Agent-Based Model of… — arXiv:2609.30269

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30269
License (as archived)
CC0-1.0
Archived
2026-10-08T02:08:16.739Z
SHA-256 of the archived text
169ce271c2c94c9b02fcb67395c475d63ab46cb3a6632b61f5c0fa3c776789a8
Stable URL of this page
https://metraipolis.com/documento/dc_8685013ff618

How to cite

When a Few Misfits Trigger Digital Adoption Cascades: Network Reach, Threshold Heterogeneity, and Performance-Conditioned Complex Contagion in an Agent-Based Model of… — arXiv:2609.30269 — arXiv (en), https://arxiv.org/abs/2609.30269 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8685013ff618 (Metraipolis archive dc_8685013ff618, sha256 169ce271c2c94c9b02fcb67395c475d63ab46cb3a6632b61f5c0fa3c776789a8)
BibTeX
@misc{dc8685013ff618,
  title = {When a Few Misfits Trigger Digital Adoption Cascades: Network Reach, Threshold Heterogeneity, and Performance-Conditioned Complex Contagion in an Agent-Based Model of… — arXiv:2609.30269},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30269},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8685013ff618; sha256 169ce271c2c94c9b02fcb67395c475d63ab46cb3a6632b61f5c0fa3c776789a8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30269. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Why does a superior technology sometimes spread and sometimes stall, even when its expected returns are much higher? We develop an agent-based model in which firms adopt a digital technology by imitating successful neighbours through a fast-and-frugal heuristic. We compare frequency-based imitation, where firms follow the local majority, with performance-conditioned imitation, where they follow better-performing neighbours. We define a cascade as high final adoption reached through rapid, accelerating takeoff rather than slow accumulation. In the calibrated regime, four results emerge. First, dynamic cascades arise under performance-conditioned imitation, but not under an exogenous adoption hazard or frequency-based imitation. Second, on degree-controlled networks, adoption tips once the network provides sufficient reach, at a small-world rewiring threshold near 0.41, with a 95 percent bootstrap confidence interval of 0.39 to 0.43. This reflects short paths, low clustering, and high-reach nodes rather than one graph statistic. Third, at a fixed mean threshold, concentrating receptiveness in the lower tail can generate cascades that homogeneous thresholds cannot. Fourth, cascade probability depends strongly on the positions of initial adopters and low-threshold pioneers. At human-scale observation degrees, the mechanism is genuine complex contagion: adoption requires reinforcement from multiple successful exemplars, survives a requirement of at least two successful digital neighbours when seeded by a clustered critical mass, and weakens beyond Dunbar-scale neighbourhoods. The model identifies where interventions may have leverage rather than forecasting industries. Broad cultural change is not required for system-wide adoption: a small minority of receptive firms, positioned where the network can transmit success, can be enough. In short, a few misfits can change the world.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-28 in econ.GN).
Categorie arXiv: General Economics (econ.GN).
Pagina del lavoro: https://arxiv.org/abs/2609.30269 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T01:41:39.675Z dalla pagina https://arxiv.org/catchup/econ.GN/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).