# Dynamic Network Embeddings for Network Evolution Analysis

arXiv: https://arxiv.org/abs/1906.09860 · HTML: https://mlsanity.com/paper/1906.09860/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Jun 2019.

## Built on by (most cited first, 3 of 3)

- [A Survey on Embedding Dynamic Graphs](https://mlsanity.com/paper/2101.01229/) (2021)
- [Alignment and stability of embeddings: measurement and inference improvement](https://mlsanity.com/paper/2101.07251/) (2021)
- [Trust in Motion: Capturing Trust Ascendancy in Open-Source Projects using Hybrid AI](https://mlsanity.com/paper/2210.02656/) (2022)

## Abstract (arXiv)

Network embeddings learn to represent nodes as low-dimensional vectors to preserve the proximity between nodes and communities of the network for network analysis. The temporal edges (e.g., relationships, contacts, and emails) in dynamic networks are important for network evolution analysis, but few existing methods in network embeddings can capture the dynamic information from temporal edges. In this paper, we propose a novel dynamic network embedding method to analyze evolution patterns of dynamic networks effectively. Our method uses random walk to keep the proximity between nodes and applies dynamic Bernoulli embeddings to train discrete-time network embeddings in the same vector space without alignments to preserve the temporal continuity of stable nodes. We compare our method with several state-of-the-art methods by link prediction and evolving node detection, and the experiments demonstrate that our method generally has better performance in these tasks. Our method is further verified by two real-world dynamic networks via detecting evolving nodes and visualizing their temporal trajectories in the embedded space.