Predicting Graph Structure via Adapted Flux Balance Analysis

• URL: http://arxiv.org/abs/2507.05806v2
• Date: Mon, 14 Jul 2025 05:44:34 GMT
• Title: Predicting Graph Structure via Adapted Flux Balance Analysis
• Authors: Sevvandi Kandanaarachchi, Ziqi Xu, Stefan Westerlund, Conrad Sanderson,
• Abstract summary: We propose to exploit time series prediction methods in combination with an adapted form of flux balance analysis (FBA)<n> Empirical evaluations on synthetic datasets (UCI Message, HePH, Facebook, Bitcoin) and real datasets demonstrate the efficacy of the proposed approach.
• Score: 15.193806371051945
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many dynamic processes such as telecommunication and transport networks can be described through discrete time series of graphs. Modelling the dynamics of such time series enables prediction of graph structure at future time steps, which can be used in applications such as detection of anomalies. Existing approaches for graph prediction have limitations such as assuming that the vertices do not to change between consecutive graphs. To address this, we propose to exploit time series prediction methods in combination with an adapted form of flux balance analysis (FBA), a linear programming method originating from biochemistry. FBA is adapted to incorporate various constraints applicable to the scenario of growing graphs. Empirical evaluations on synthetic datasets (constructed via Preferential Attachment model) and real datasets (UCI Message, HePH, Facebook, Bitcoin) demonstrate the efficacy of the proposed approach.

Related papers

• Persistent Homology-induced Graph Ensembles for Time Series Regressions [1.5728609542259502]
  We create an ensemble of Graph Neural Networks based on Persistent Homology filtration.<n>The ensemble aggregates the signals from the individual learners via an attention-based routing mechanism.<n>Four different real-world experiments on seismic activity prediction and traffic forecasting demonstrate that our approach consistently outperforms single-graph baselines.
  arXiv  Detail & Related papers  (2025-03-18T13:22:52Z)
• Continuous Product Graph Neural Networks [5.703629317205571]
  Multidomain data defined on multiple graphs holds significant potential in practical applications in computer science. We introduce Continuous Product Graph Neural Networks (CITRUS) that emerge as a natural solution to the TPDEG. We evaluate CITRUS on well-known traffic andtemporal weather forecasting datasets, demonstrating superior performance over existing approaches.
  arXiv  Detail & Related papers  (2024-05-29T08:36:09Z)
• Predicting the structure of dynamic graphs [3.035039100561926]
  We forecast the structure of a graph at future time steps incorporating unseen, new nodes and edges. We use time series forecasting methods to predict the node degree at future time points and combine these forecasts with flux balance analysis. We evaluate this approach using synthetic and real-world datasets and demonstrate its utility and applicability.
  arXiv  Detail & Related papers  (2024-01-08T23:25:43Z)
• Graph Neural Networks with a Distribution of Parametrized Graphs [27.40566674759208]
  We introduce latent variables to parameterize and generate multiple graphs. We obtain the maximum likelihood estimate of the network parameters in an Expectation-Maximization framework.
  arXiv  Detail & Related papers  (2023-10-25T06:38:24Z)
• Temporal Graph Neural Networks for Irregular Data [14.653008985229615]
  TGNN4I model is designed to handle both irregular time steps and partial observations of the graph. Time-continuous dynamics enables the model to make predictions at arbitrary time steps. Experiments on simulated data and real-world data from traffic and climate modeling validate the usefulness of both the graph structure and time-continuous dynamics.
  arXiv  Detail & Related papers  (2023-02-16T16:47:55Z)
• Graph Generation with Diffusion Mixture [57.78958552860948]
  Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. We propose a generative framework that models the topology of graphs by explicitly learning the final graph structures of the diffusion process.
  arXiv  Detail & Related papers  (2023-02-07T17:07:46Z)
• 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)
• Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training [82.68805025636165]
  We propose to select positive graph instances directly from existing graphs in the training set. Our selection is based on certain domain-specific pair-wise similarity measurements. Besides, we develop an adaptive node-level pre-training method to dynamically mask nodes to distribute them evenly in the graph.
  arXiv  Detail & Related papers  (2022-06-23T20:12:51Z)
• Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs [65.18780403244178]
  We propose a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE) Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing.
  arXiv  Detail & Related papers  (2022-02-17T02:17:31Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Learned Factor Graphs for Inference from Stationary Time Sequences [107.63351413549992]
  We propose a framework that combines model-based algorithms and data-driven ML tools for stationary time sequences. neural networks are developed to separately learn specific components of a factor graph describing the distribution of the time sequence. We present an inference algorithm based on learned stationary factor graphs, which learns to implement the sum-product scheme from labeled data.
  arXiv  Detail & Related papers  (2020-06-05T07:06:19Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.