Iterated Global Models for Complex Networks
Discrete Mathematics
2020-02-21 v1 Combinatorics
Abstract
We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set of nodes of a prescribed cardinality, we add a new node that is adjacent to every node in . We focus on the case where the size of is approximately half the number of nodes at each time-step, and we refer to this as the half-model. The half-model provably generate graphs that densify over time, have bad spectral expansion, and low diameter. We derive the clique, chromatic, and domination numbers of graphs generated by the model.
Cite
@article{arxiv.2002.08739,
title = {Iterated Global Models for Complex Networks},
author = {Anthony Bonato and Erin Meger},
journal= {arXiv preprint arXiv:2002.08739},
year = {2020}
}