Spline tie-decay temporal networks

Abstract

Increasing amounts of data are available on temporal, or time-varying, networks. There have been various representations of temporal network data each of which has different advantages for downstream tasks such as mathematical analysis, visualizations, agent-based and other dynamical simulations on the temporal network, and discovery of useful structure. The tie-decay network is a representation of temporal networks whose advantages include the capability of generating continuous-time networks from discrete time-stamped contact event data with mathematical tractability and a low computational cost. However, the current framework of tie-decay networks is limited in terms of how each discrete contact event can affect the time-dependent tie strength (which we call the kernel). Here we extend the tie-decay network model in terms of the kernel. Specifically, we use a cubic spline function for modeling short-term behavior of the kernel and an exponential decay function for long-term behavior, and graft them together. This spline version of tie-decay network enables delayed and $C^1$-continuous interaction rates between two nodes while it only marginally increases the computational and memory burden relative to the conventional tie-decay network. We show mathematical properties of the spline tie-decay network and numerically showcase it with three tasks: network embedding, a deterministic opinion dynamics model, and a stochastic epidemic spreading model.

References in corpus (23)

• Community detection in graphs
• Link Prediction in Complex Networks: A Survey
• Temporal Networks
• Quantifying social group evolution
• High-resolution measurements of face-to-face contact patterns in a primary school
• Robust dynamic classes revealed by measuring the response function of a social system
• Modern temporal network theory: A colloquium
• The fundamental advantages of temporal networks
• Mitigation of infectious disease at school: targeted class closure vs school closure
• Modeling complex systems with adaptive networks
• A Gillespie algorithm for non-Markovian stochastic processes
• Detecting sequences of system states in temporal networks
• Randomized reference models for temporal networks
• Modeling the spread of fake news on Twitter
• Two-state Markov-chain Poisson nature of individual cellphone call statistics
• Gillespie algorithms for stochastic multiagent dynamics in populations and network
• Small inter-event times govern epidemic spreading on temporal networks
• Long-tailed distributions of inter-event times as mixtures of exponential distributions
• Embedding and trajectories of temporal networks
• Opinion dynamics on tie-decay networks
• Models of Continuous-Time Networks with Tie Decay, Diffusion, and Convection
• Predicting Relationship Labels and Individual Personality Traits from Telecommunication History in Social Networks using Hawkes Processes
• Online landmark replacement for out-of-sample dimensionality reduction methods