GoT-WAVE: Temporal network alignment using graphlet-orbit transitions

08/24/2018
by   David Aparício, et al.
0

Global pairwise network alignment (GPNA) aims to find a one-to-one node mapping between two networks that identifies conserved network regions. GPNA algorithms optimize node conservation (NC) and edge conservation (EC). NC quantifies topological similarity between nodes. Graphlet-based degree vectors (GDVs) are a state-of-the-art topological NC measure. Dynamic GDVs (DGDVs) were used as a dynamic NC measure within the first-ever algorithms for GPNA of temporal networks: DynaMAGNA++ and DynaWAVE. The latter is superior for larger networks. We recently developed a different graphlet-based measure of temporal node similarity, graphlet-orbit transitions (GoTs). Here, we use GoTs instead of DGDVs as a new dynamic NC measure within DynaWAVE, resulting in a new approach, GoT-WAVE. On synthetic networks, GoT-WAVE improves DynaWAVE's accuracy by 25 by 64 superior 50 dynamic EC, only GoT-WAVE can support directed edges. Hence, GoT-WAVE is a promising new temporal GPNA algorithm, which efficiently optimizes dynamic NC. Future work on better incorporating dynamic EC may yield further improvements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2023

Temporal Egonet Subgraph Transitions

How do we summarize dynamic behavioral interactions? We introduce a poss...
research
06/30/2020

Online Dynamic Network Embedding

Network embedding is a very important method for network data. However, ...
research
11/22/2021

WalkingTime: Dynamic Graph Embedding Using Temporal-Topological Flows

Increased attention has been paid over the last four years to dynamic ne...
research
08/05/2020

GloDyNE: Global Topology Preserving Dynamic Network Embedding

Learning low-dimensional topological representation of a network in dyna...
research
08/26/2022

Towards Higher-order Topological Consistency for Unsupervised Network Alignment

Network alignment task, which aims to identify corresponding nodes in di...
research
07/25/2023

A model for efficient dynamical ranking in networks

We present a physics-inspired method for inferring dynamic rankings in d...
research
10/09/2020

Exact p-values for global network alignments via combinatorial analysis of shared GO terms

Network alignment aims to uncover topologically similar regions in the p...

Please sign up or login with your details

Forgot password? Click here to reset