Extremal linkage networks

Markus Heydenreich, Christian Hirsch*

*Corresponding author for this work

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

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 a complex spatial network, which we coin extremal linkage network.

Original languageEnglish
JournalExtremes
Volume25
Issue2
Pages (from-to)229-255
Number of pages27
ISSN1386-1999
DOIs
Publication statusPublished - Jun 2022

Keywords

  • Spatial network
  • Random tree
  • Max-stable fitnesses
  • Coalescence
  • Small-world graph

Fingerprint

Dive into the research topics of 'Extremal linkage networks'. Together they form a unique fingerprint.

Cite this