Extremal linkage networks
Probability
2020-06-02 v1
Abstract
We demonstrate how sophisticated graph properties, such as small distances and scale-free degree distributions, arise naturally from a reinforcement mechanism on layered graphs. Every node is assigned an a-priori i.i.d. fitness with max-stable distribution. The fitness determines the node attractiveness w.r.t. incoming edges as well as the spatial range for outgoing edges. For max-stable fitness distributions, we thus obtain complex spatial network, which we coin extremal linkage network.
Cite
@article{arxiv.2006.00747,
title = {Extremal linkage networks},
author = {Markus Heydenreich and Christian Hirsch},
journal= {arXiv preprint arXiv:2006.00747},
year = {2020}
}
Comments
16 pages, 3 figures