# A Hierarchy of Network Models Giving Bistability Under Triadic Closure

Source: [A Hierarchy of Network Models Giving Bistability Under Triadic Closure](<https://www.sota2.com/research/paper/68fa58ad1e209131ce9b05ec>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T05:19:44.543Z

Authors: Stefano Di Giovacchino, Desmond J. Higham, Konstantinos C. Zygalakis

Published: 2021-11-10T14:49:28.000Z

## Abstract

Triadic closure describes the tendency for new friendships to form between individuals who already have friends in common. It has been argued heuristically that the triadic closure effect can lead to bistability in the formation of large-scale social interaction networks. Here, depending on the initial state and the transient dynamics, the system may evolve towards either of two long-time states. In this work, we propose and study a hierarchy of network evolution models that incorporate triadic closure, building on the work of Grindrod, Higham, and Parsons \[Internet Mathematics, 8, 2012, 402--423\]. We use a chemical kinetics framework, paying careful attention to the reaction rate scaling with respect to the system size. In a macroscale regime, we show rigorously that a bimodal steady-state distribution is admitted. This behavior corresponds to the existence of two distinct stable fixed points in a deterministic mean-field ODE. The macroscale model is also seen to capture an apparent metastability property of the microscale system.   Computational simulations are used to support the analysis.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2111.05715>)

[PDF](<https://arxiv.org/pdf/2111.05715.pdf>)
