mlsanityData to 7 Oct 2026

The why, how, and when of representations for complex systems

arXiv 2006.02870 ↗First posted 4 Jun 2020cs.SI cs.DM q-bio.QMcited by 23

Not on the map. Why?

Abstract (arXiv)

Complex systems thinking is applied to a wide variety of domains, from neuroscience to computer science and economics. The wide variety of implementations has resulted in two key challenges: the progenation of many domain-specific strategies that are seldom revisited or questioned, and the siloing of ideas within a domain due to inconsistency of complex systems language. In this work we offer basic, domain-agnostic language in order to advance towards a more cohesive vocabulary. We use this language to evaluate each step of the complex systems analysis pipeline, beginning with the system and data collected, then moving through different mathematical formalisms for encoding the observed data (i.e. graphs, simplicial complexes, and hypergraphs), and relevant computational methods for each formalism. At each step we consider different types of dependencies; these are properties of the system that describe how the existence of one relation among the parts of a system may influence the existence of another relation. We discuss how dependencies may arise and how they may alter interpretation of results or the entirety of the analysis pipeline. We close with two real-world examples using coauthorship data and email communications data that illustrate how the system under study, the dependencies therein, the research question, and choice of mathematical representation influence the results. We hope this work can serve as an opportunity of reflection for experienced complexity scientists, as well as an introductory resource for new researchers.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 6; 2023: 5; 2024: 5; 2025: 3; 2026: 1.

23 papers.

Sort:

  1. 2021Generative hypergraph clustering: from blockmodels to modularitycited by 48
  2. 2023Architectures of Topological Deep Learning: A Survey of Message-Passing Topological Neural Networkscited by 43
  3. 2023Combinatorial Complexes: Bridging the Gap Between Cell Complexes and Hypergraphscited by 15
  4. 2022Inference of hyperedges and overlapping communities in hypergraphscited by 13
  5. 2022AHP: Learning to Negative Sample for Hyperedge Predictioncited by 12
  6. 2021A nonlinear diffusion method for semi-supervised learning on hypergraphscited by 11
  7. 2022De Bruijn goes Neural: Causality-Aware Graph Neural Networks for Time Series Data on Dynamic Graphscited by 10
  8. 2023HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformerscited by 10
  9. 2023Dirac signal processing of higher-order topological signalscited by 9
  10. 2024Demystifying Higher-Order Graph Neural Networkscited by 4
  11. 2022Deep Ensembles for Graphs with Higher-order Dependenciescited by 3
  12. 2022All the World's a (Hyper)Graph: A Data Dramacited by 2
11 more
  1. 2023Zoo Guide to Network Embeddingcited by 2
  2. 2024When Witnesses Defend: A Witness Graph Topological Layer for Adversarial Graph Learningcited by 2
  3. 2021Predicting Influential Higher-Order Patterns in Temporal Network Datacited by 1
  4. 2022One Graph to Rule them All: Using NLP and Graph Neural Networks to analyse Tolkien's Legendariumcited by 1
  5. 2024Hypergraph clustering using Ricci curvature: an edge transport perspectivecited by 1
  6. 2025Mitigating Data Scarcity in Time Series Analysis: A Foundation Model with Series-Symbol Data Generationcited by 1
  7. 2024PlasmoData.jl -- A Julia Framework for Modeling and Analyzing Complex Data as Graphscited by 0
  8. 2024Characterizing User Archetypes and Discussions on Scored.cocited by 0
  9. 2025MARIOH: Multiplicity-Aware Hypergraph Reconstructioncited by 0
  10. 2025Information-theoretic signatures of causality in Bayesian networks and hypergraphscited by 0
  11. 2026Conservative Hybrid Graph Networks for Process Systems with Learned Routingcited by 0