A Simple and Powerful Framework for Stable Dynamic Network Embedding

• URL: http://arxiv.org/abs/2311.09251v1
• Date: Tue, 14 Nov 2023 15:38:17 GMT
• Title: A Simple and Powerful Framework for Stable Dynamic Network Embedding
• Abstract summary: We propose a wide class of established static network embedding methods to produce interpretable dynamic network embeddings. We provide a theoretical guarantee that, regardless of embedding dimension, these unfolded methods will produce stable embeddings. We additionally define a hypothesis testing framework which can be used to evaluate the quality of a dynamic network embedding.
• Score: 6.171990546748666
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we address the problem of dynamic network embedding, that is, representing the nodes of a dynamic network as evolving vectors within a low-dimensional space. While the field of static network embedding is wide and established, the field of dynamic network embedding is comparatively in its infancy. We propose that a wide class of established static network embedding methods can be used to produce interpretable and powerful dynamic network embeddings when they are applied to the dilated unfolded adjacency matrix. We provide a theoretical guarantee that, regardless of embedding dimension, these unfolded methods will produce stable embeddings, meaning that nodes with identical latent behaviour will be exchangeable, regardless of their position in time or space. We additionally define a hypothesis testing framework which can be used to evaluate the quality of a dynamic network embedding by testing for planted structure in simulated networks. Using this, we demonstrate that, even in trivial cases, unstable methods are often either conservative or encode incorrect structure. In contrast, we demonstrate that our suite of stable unfolded methods are not only more interpretable but also more powerful in comparison to their unstable counterparts.

Related papers

• Testing for correlation between network structure and high-dimensional node covariates [47.791962198275066]
  In many application domains, networks are observed with node-level features.<n>In such settings, a common problem is to assess whether or not nodal covariates are correlated with the network structure itself.<n>We present four novel methods for addressing this problem.
  arXiv  Detail & Related papers  (2025-09-03T23:33:17Z)
• PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis [75.14189839277928]
  We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
  arXiv  Detail & Related papers  (2025-08-29T01:47:27Z)
• Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation [1.4747234049753448]
  A common approach is to learn time-varying node embeddings, whose effectiveness depends on satisfying key stability properties.<n>We propose Unfolded Laplacian Spectral Embedding, a new method that extends the Unfolded Adjacency Spectral Embedding framework to normalized Laplacians.<n>As a bonus, we establish a new Cheeger-style inequality that connects the embeddings to the conductance of the underlying dynamic graphs.
  arXiv  Detail & Related papers  (2025-08-18T07:13:53Z)
• Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding [1.6044444452278062]
  This paper proposes a novel unifying dynamic network embedding method that simultaneously preserves both structural proximity and equivalence. We then introduce a temporal-structural random walk to flexibly sample time-respecting sequences of nodes, considering both their temporal proximity and similarity in evolving structures. The proposed method is evaluated using five real-world networks on node classification where it outperforms benchmark methods.
  arXiv  Detail & Related papers  (2025-03-14T08:40:05Z)
• Unsupervised Attributed Dynamic Network Embedding with Stability Guarantees [1.7261860761946977]
  We present attributed unfolded adjacency spectral embedding (AUASE), a stable unsupervised representation learning framework for dynamic networks. We quantify the benefits of our dynamic embedding by comparing with state-of-the-art network representation learning methods on three real attributed networks.
  arXiv  Detail & Related papers  (2025-03-04T18:34:55Z)
• Enhancing lattice kinetic schemes for fluid dynamics with Lattice-Equivariant Neural Networks [79.16635054977068]
  We present a new class of equivariant neural networks, dubbed Lattice-Equivariant Neural Networks (LENNs) Our approach develops within a recently introduced framework aimed at learning neural network-based surrogate models Lattice Boltzmann collision operators. Our work opens towards practical utilization of machine learning-augmented Lattice Boltzmann CFD in real-world simulations.
  arXiv  Detail & Related papers  (2024-05-22T17:23:15Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Fast inference of latent space dynamics in huge relational event networks [0.0]
  We propose a likelihood-based algorithm that can deal with huge event networks. In this work we propose a hierarchical strategy for inferring network community dynamics embedded into an interpretable latent space. To make the framework feasible for large networks we borrow from machine learning optimization methodology.
  arXiv  Detail & Related papers  (2023-03-29T15:18:56Z)
• Robustness Certificates for Implicit Neural Networks: A Mixed Monotone Contractive Approach [60.67748036747221]
  Implicit neural networks offer competitive performance and reduced memory consumption. They can remain brittle with respect to input adversarial perturbations. This paper proposes a theoretical and computational framework for robustness verification of implicit neural networks.
  arXiv  Detail & Related papers  (2021-12-10T03:08:55Z)
• Embedding Node Structural Role Identity Using Stress Majorization [8.485373271217606]
  We present a novel framework to transform the high-dimensional role identities in networks directly. Our method is flexible, in that it does not rely on specific structural similarity definitions. Our experiments show that our framework achieves superior results than existing methods in learning node role representations.
  arXiv  Detail & Related papers  (2021-09-14T23:48:16Z)
• DynACPD Embedding Algorithm for Prediction Tasks in Dynamic Networks [6.5361928329696335]
  We present novel embedding methods for a dynamic network based on higher order tensor decompositions for tensorial representations of the dynamic network. We demonstrate the power and efficiency of our approach by comparing our algorithms' performance on the link prediction task against an array of current baseline methods.
  arXiv  Detail & Related papers  (2021-03-12T04:36:42Z)
• Manifold Regularized Dynamic Network Pruning [102.24146031250034]
  This paper proposes a new paradigm that dynamically removes redundant filters by embedding the manifold information of all instances into the space of pruned networks. The effectiveness of the proposed method is verified on several benchmarks, which shows better performance in terms of both accuracy and computational cost.
  arXiv  Detail & Related papers  (2021-03-10T03:59:03Z)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• A general framework for defining and optimizing robustness [74.67016173858497]
  We propose a rigorous and flexible framework for defining different types of robustness properties for classifiers. Our concept is based on postulates that robustness of a classifier should be considered as a property that is independent of accuracy. We develop a very general robustness framework that is applicable to any type of classification model.
  arXiv  Detail & Related papers  (2020-06-19T13:24:20Z)
• Link Prediction for Temporally Consistent Networks [6.981204218036187]
  Link prediction estimates the next relationship in dynamic networks. The use of adjacency matrix to represent dynamically evolving networks limits the ability to analytically learn from heterogeneous, sparse, or forming networks. We propose a new method of canonically representing heterogeneous time-evolving activities as a temporally parameterized network model.
  arXiv  Detail & Related papers  (2020-06-06T07:28:03Z)
• An algorithm for reconstruction of triangle-free linear dynamic networks with verification of correctness [2.28438857884398]
  We present a method that either exactly recovers the topology of a triangle-free network certifying its correctness or outputs a graph that is sparser than the topology of the actual network. We prove that, even in the limit of infinite data, any reconstruction method is susceptible to inferring edges that do not exist in the true network.
  arXiv  Detail & Related papers  (2020-03-05T19:10:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.