Measuring dynamical systems on directed hyper-graphs

• URL: http://arxiv.org/abs/2202.12810v3
• Date: Tue, 6 Sep 2022 09:53:54 GMT
• Title: Measuring dynamical systems on directed hyper-graphs
• Authors: Mauro Faccin
• Abstract summary: We analyze the interplay between the structure of a directed hypergraph and a linear dynamical system, a random walk, defined on it. We apply known measures to pairwise structures, such as the transition matrix, and determine a family of measures that are amenable to such procedure.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Networks and graphs provide a simple but effective model to a vast set of systems which building blocks interact throughout pairwise interactions. Unfortunately, such models fail to describe all those systems which building blocks interact at a higher order. Higher order graphs provide us the right tools for the task, but introduce a higher computing complexity due to the interaction order. In this paper we analyze the interplay between the structure of a directed hypergraph and a linear dynamical system, a random walk, defined on it. How can one extend network measures, such as centrality or modularity, to this framework? Instead of redefining network measures through the hypergraph framework, with the consequent complexity boost, we will measure the dynamical system associated to it. This approach let us apply known measures to pairwise structures, such as the transition matrix, and determine a family of measures that are amenable of such procedure.

Related papers

• Discovering Message Passing Hierarchies for Mesh-Based Physics Simulation [61.89682310797067]
  We introduce DHMP, which learns Dynamic Hierarchies for Message Passing networks through a differentiable node selection method. Our experiments demonstrate the effectiveness of DHMP, achieving 22.7% improvement on average compared to recent fixed-hierarchy message passing networks.
  arXiv  Detail & Related papers  (2024-10-03T15:18:00Z)
• Topological Deep Learning with State-Space Models: A Mamba Approach for Simplicial Complexes [4.787059527893628]
  We propose a novel architecture designed to operate with simplicial complexes, utilizing the Mamba state-space model as its backbone. Our approach generates sequences for the nodes based on the neighboring cells, enabling direct communication between all higher-order structures, regardless of their rank.
  arXiv  Detail & Related papers  (2024-09-18T14:49:25Z)
• Network Alignment with Transferable Graph Autoencoders [79.89704126746204]
  We propose a novel graph autoencoder architecture designed to extract powerful and robust node embeddings. We prove that the generated embeddings are associated with the eigenvalues and eigenvectors of the graphs. Our proposed framework also leverages transfer learning and data augmentation to achieve efficient network alignment at a very large scale without retraining.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Learning the effective order of a hypergraph dynamical system [4.530678016396476]
  We propose a method to determine the minimum order of a hypergraph necessary to approximate the corresponding dynamics accurately. Specifically, we develop an analytical framework that allows us to determine this order when the type of dynamics is known. We utilize these ideas in conjunction with a hypergraph neural network to directly learn the dynamics itself and the resulting order of the hypergraph from both synthetic and real data sets.
  arXiv  Detail & Related papers  (2023-06-02T09:04:45Z)
• Bayesian Detection of Mesoscale Structures in Pathway Data on Graphs [0.0]
  mesoscale structures are integral part of the abstraction and analysis of complex systems. They can represent communities in social or citation networks, roles in corporate interactions, or core-periphery structures in transportation networks. We derive a Bayesian approach that simultaneously models the optimal partitioning of nodes in groups and the optimal higher-order network dynamics.
  arXiv  Detail & Related papers  (2023-01-16T12:45:33Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• Principled inference of hyperedges and overlapping communities in hypergraphs [0.0]
  We propose a framework based on statistical inference to characterize the structural organization of hypergraphs. We show strong performance in hyperedge prediction tasks, detecting communities well aligned with the information carried by interactions, and robustness against addition of noisy hyperedges.
  arXiv  Detail & Related papers  (2022-04-12T09:13:46Z)
• Data-driven Influence Based Clustering of Dynamical Systems [0.0]
  Community detection is a challenging and relevant problem in various disciplines of science and engineering. We propose a novel approach for clustering dynamical systems purely from time-series data. We illustrate the efficacy of the proposed approach by clustering three different dynamical systems.
  arXiv  Detail & Related papers  (2022-04-05T17:26:47Z)
• Graph Convolutional Embeddings for Recommender Systems [67.5973695167534]
  We propose a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions. More specifically, we define a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions.
  arXiv  Detail & Related papers  (2021-03-05T10:46:16Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)

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.