Predicting Graph Structure via Adapted Flux Balance Analysis
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910015928926208 |
|---|---|
| author | Kandanaarachchi, Sevvandi Xu, Ziqi Westerlund, Stefan Sanderson, Conrad |
| author_facet | Kandanaarachchi, Sevvandi Xu, Ziqi Westerlund, Stefan Sanderson, Conrad |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05806 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Predicting Graph Structure via Adapted Flux Balance Analysis Kandanaarachchi, Sevvandi Xu, Ziqi Westerlund, Stefan Sanderson, Conrad Machine Learning 37M10, 05C90, 68R10, 62M10, 62M20 G.2.2; G.3; I.2.6; E.1 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. |
| title | Predicting Graph Structure via Adapted Flux Balance Analysis |
| topic | Machine Learning 37M10, 05C90, 68R10, 62M10, 62M20 G.2.2; G.3; I.2.6; E.1 |
| url | https://arxiv.org/abs/2507.05806 |