Affordable Access

Access to the full text

Competition-driven modeling of temporal networks

Authors
  • Zhu, Kaijie1, 2
  • Fletcher, George1
  • Yakovets, Nikolay2
  • 1 TU Eindhoven, Eindhoven, Netherlands , Eindhoven (Netherlands)
  • 2 NDSC, Zhengzhou, China , Zhengzhou (China)
Type
Published Article
Journal
EPJ Data Science
Publisher
Springer Berlin Heidelberg
Publication Date
Jun 03, 2021
Volume
10
Issue
1
Identifiers
DOI: 10.1140/epjds/s13688-021-00287-6
Source
Springer Nature
Keywords
License
Green

Abstract

We study the problem of modeling temporal networks constrained by the size of a concurrent set, a characteristic of temporal networks shown to be important in many application areas, e.g., in transportation, social, process, and other networks. We propose a competition-driven model for the generation of such constrained networks. Our method carries out turns of competitions along the timeline where each node in a network is labeled with a probability to gain outgoing edges in competitions. We present a thorough theoretical analysis to investigate the cardinality and degree distributions of the generated networks. Our experimental results demonstrate that our model simulates real-world networks well and generates networks efficiently and at scale.

Report this publication

Statistics

Seen <100 times