The Iterated Local Transitivity Model for Tournaments
Abstract
A key generative principle within social and other complex networks is transitivity, where friends of friends are more likely friends. We propose a new model for highly dense complex networks based on transitivity, called the Iterated Local Transitivity Tournament (or ILTT) model. In ILTT and a dual version of the model, we iteratively apply the principle of transitivity to form new tournaments. The resulting models generate tournaments with small average distances as observed in real-world complex networks. We explore properties of small subtournaments or motifs in the ILTT model and study its graph-theoretic properties, such as Hamilton cycles, spectral properties, and domination numbers. We finish with a set of open problems and the next steps for the ILTT model.
Cite
@article{arxiv.2301.08777,
title = {The Iterated Local Transitivity Model for Tournaments},
author = {Anthony Bonato and Ketan Chaudhary},
journal= {arXiv preprint arXiv:2301.08777},
year = {2023}
}