Saved in:
Bibliographic Details
Main Authors: Almasan, Anton-David, Shvydun, Sergey, Scholtes, Ingo, Van Mieghem, Piet
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.08690
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929499537408000
author Almasan, Anton-David
Shvydun, Sergey
Scholtes, Ingo
Van Mieghem, Piet
author_facet Almasan, Anton-David
Shvydun, Sergey
Scholtes, Ingo
Van Mieghem, Piet
contents We study human mobility networks through timeseries of contacts between individuals. Our proposed Random Walkers Induced temporal Graph (RWIG) model generates temporal graph sequences based on independent random walkers that traverse an underlying graph in discrete time steps. Co-location of walkers at a given node and time defines an individual-level contact. RWIG is shown to be a realistic model for temporal human contact graphs, which may place RWIG on a same footing as the Erdos-Renyi (ER) and Barabasi-Albert (BA) models for fixed graphs. Moreover, RWIG is analytically feasible: we derive closed form solutions for the probability distribution of contact graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2409_08690
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Generating Temporal Contact Graphs Using Random Walkers
Almasan, Anton-David
Shvydun, Sergey
Scholtes, Ingo
Van Mieghem, Piet
Social and Information Networks
Dynamical Systems
We study human mobility networks through timeseries of contacts between individuals. Our proposed Random Walkers Induced temporal Graph (RWIG) model generates temporal graph sequences based on independent random walkers that traverse an underlying graph in discrete time steps. Co-location of walkers at a given node and time defines an individual-level contact. RWIG is shown to be a realistic model for temporal human contact graphs, which may place RWIG on a same footing as the Erdos-Renyi (ER) and Barabasi-Albert (BA) models for fixed graphs. Moreover, RWIG is analytically feasible: we derive closed form solutions for the probability distribution of contact graphs.
title Generating Temporal Contact Graphs Using Random Walkers
topic Social and Information Networks
Dynamical Systems
url https://arxiv.org/abs/2409.08690