• Corpus ID: 243938619

A Hierarchy of Network Models Giving Bistability Under Triadic Closure

  title={A Hierarchy of Network Models Giving Bistability Under Triadic Closure},
  author={Stefano Di Giovacchino and Desmond J. Higham and Konstantinos C. Zygalakis},
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… 

Figures from this paper



Bistability through Triadic Closure

This work proposes and analyzes a class of evolving network models suitable for describing a dynamic topological structure and develops a mean field theory for describing network evolution.

Infering and calibrating triadic closure in a dynamic network

In the social sciences, the hypothesis of triadic closure contends that new links in a social contact network arise preferentially between those who currently share neighbours. Here, in a

Measuring directed triadic closure with closure coefficients

This work proposes a family of eight directed closure coefficients that measure the frequency of triadic closure in directed graphs from the perspective of the node initiating closure, and illustrates an underlying connection between the closure coefficients and moments of the joint in- and out-degree distributions of the network.

Predicting Triadic Closure in Networks Using Communicability Distance Functions

We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the

Hybrid framework for the simulation of stochastic chemical kinetics

Over-time measurement of triadic closure in coauthorship networks

It is shown how calculating triadic closure based on prior operationalizations of closure, namely Newman's measure for one-mode networks (NCC) and Opsahl’s measure for two- mode networks (OCC) may lead to higher amounts of closure compared to measuring closure over time via a metric that is introduced and test in this paper.

Higher-order organization of complex networks

A generalized framework for clustering networks on the basis of higher-order connectivity patterns provides mathematical guarantees on the optimality of obtained clusters and scales to networks with billions of edges.

Learning to predict reciprocity and triadic closure in social networks

It is demonstrated that it is possible to accurately infer 90% of reciprocal relationships in a Twitter network, and a learning framework is proposed to formulate the problems of predicting reciprocity and triadic closure into a graphical model.

Simplicial closure and higher-order link prediction

It is shown that there is a rich variety of structure in the authors' datasets but datasets from the same system types have consistent patterns of higher-order structure, and it is found that tie strength and edge density are competing positive indicators ofhigher-order organization.

The chemical Langevin equation

The stochastic dynamical behavior of a well-stirred mixture of N molecular species that chemically interact through M reaction channels is accurately described by the chemical master equation. It is