pith. sign in

arxiv: 1211.7343 · v1 · pith:4QAE3WJDnew · submitted 2012-11-30 · ⚛️ physics.data-an · cs.SI· physics.soc-ph

Persistence and periodicity in a dynamic proximity network

classification ⚛️ physics.data-an cs.SIphysics.soc-ph
keywords dynamicnetworknetworkstimedatasequenceconversionhighly
0
0 comments X
read the original abstract

The topology of social networks can be understood as being inherently dynamic, with edges having a distinct position in time. Most characterizations of dynamic networks discretize time by converting temporal information into a sequence of network "snapshots" for further analysis. Here we study a highly resolved data set of a dynamic proximity network of 66 individuals. We show that the topology of this network evolves over a very broad distribution of time scales, that its behavior is characterized by strong periodicities driven by external calendar cycles, and that the conversion of inherently continuous-time data into a sequence of snapshots can produce highly biased estimates of network structure. We suggest that dynamic social networks exhibit a natural time scale \Delta_{nat}, and that the best conversion of such dynamic data to a discrete sequence of networks is done at this natural rate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Maximizing Reachability via Shifting of Temporal Paths

    cs.DS 2026-05 unverdicted novelty 6.0

    Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.