hypergraphs are hard but at least "i'm struggling with hypergraphs" is a sentence everyone is going to believe
February 2, 2026 at 12:30 AM
hypergraphs are hard but at least "i'm struggling with hypergraphs" is a sentence everyone is going to believe
Stephen Wolfram has attempted to develop a theory of everything using hypergraphs. Now, Jonathan Gorard said that evidence for hypergraphs should be observable in the energy that is emitted from black holes
www.youtube.com/watch?v=qMjI...
www.youtube.com/watch?v=qMjI...
Theory of Everything Predicts New Physics For Supermassive Black Holes
YouTube video by Sabine Hossenfelder
www.youtube.com
December 5, 2024 at 4:48 PM
Stephen Wolfram has attempted to develop a theory of everything using hypergraphs. Now, Jonathan Gorard said that evidence for hypergraphs should be observable in the energy that is emitted from black holes
www.youtube.com/watch?v=qMjI...
www.youtube.com/watch?v=qMjI...
Graph-based models generalize hypergraphs, so there’s no phenomenology hypergraphs capture that graph-based models can’t!
But it gets more interesting...
8/N
But it gets more interesting...
8/N
February 20, 2026 at 8:04 AM
Graph-based models generalize hypergraphs, so there’s no phenomenology hypergraphs capture that graph-based models can’t!
But it gets more interesting...
8/N
But it gets more interesting...
8/N
Since graphs *constrain* rather than define the interactions, it follows that graph-based models *generalize* those based on hypergraphs! For a simple reason: Hypergraphs impose structure on the interactions that graph-based models leave open, making hypergraph models the more restrictive class. 6/N
February 20, 2026 at 8:04 AM
Since graphs *constrain* rather than define the interactions, it follows that graph-based models *generalize* those based on hypergraphs! For a simple reason: Hypergraphs impose structure on the interactions that graph-based models leave open, making hypergraph models the more restrictive class. 6/N
Structural Reducibility of Hypergraphs link.aps.org/doi/10.1103/...
Structural Reducibility of Hypergraphs
An information-theoretic framework finds and removes redundancies in a hypergraph representation of a network, allowing for more efficient analysis of higher-order elements.
link.aps.org
December 14, 2025 at 9:29 AM
Structural Reducibility of Hypergraphs link.aps.org/doi/10.1103/...
Higher-order triadic percolation on random hypergraphs link.aps.org/doi/10.1103/...
Higher-order triadic percolation on random hypergraphs
This paper proposes a theoretical framework for investigating random hypergraphs with higher-order triadic interactions. The authors combine percolation theory with nonlinear dynamics and examine hype...
link.aps.org
December 20, 2024 at 8:29 AM
Higher-order triadic percolation on random hypergraphs link.aps.org/doi/10.1103/...
Helcio Felippe studies information-theoretic approaches to measuring the similarity of hypergraphs
#NetSci2026
@netscisociety.bsky.social @netsciconf.bsky.social
#NetSci2026
@netscisociety.bsky.social @netsciconf.bsky.social
June 4, 2026 at 4:32 PM
Helcio Felippe studies information-theoretic approaches to measuring the similarity of hypergraphs
#NetSci2026
@netscisociety.bsky.social @netsciconf.bsky.social
#NetSci2026
@netscisociety.bsky.social @netsciconf.bsky.social
The giant component of complex hypergraphs: automated generating function calculations
https://arxiv.org/abs/2609.29558
Complex hypergraphs (chygraphs) contain graphs, hypergraphs, multiplex and interacting networks as special cases, and the percolation threshold of all of them follows from o...📈🤖
https://arxiv.org/abs/2609.29558
Complex hypergraphs (chygraphs) contain graphs, hypergraphs, multiplex and interacting networks as special cases, and the percolation threshold of all of them follows from o...📈🤖
September 25, 2026 at 6:23 AM
The giant component of complex hypergraphs: automated generating function calculations
https://arxiv.org/abs/2609.29558
Complex hypergraphs (chygraphs) contain graphs, hypergraphs, multiplex and interacting networks as special cases, and the percolation threshold of all of them follows from o...📈🤖
https://arxiv.org/abs/2609.29558
Complex hypergraphs (chygraphs) contain graphs, hypergraphs, multiplex and interacting networks as special cases, and the percolation threshold of all of them follows from o...📈🤖
Released v0.2.0 of the @coreacter.org code SimpleDirectedHypergraphs.jl, a Julia package for dealing with my current mathematical obsession, directed hypergraphs.
New release includes heuristic and exact shortest-path algorithms for directed hypergraphs.
#mathsky #networksci #hypergraph #julialang
New release includes heuristic and exact shortest-path algorithms for directed hypergraphs.
#mathsky #networksci #hypergraph #julialang
GitHub - CoReACTER/SimpleDirectedHypergraphs.jl: An package for directed hypergraphs in the Julia programming language, extending SimpleHypergraphs.jl
An package for directed hypergraphs in the Julia programming language, extending SimpleHypergraphs.jl - CoReACTER/SimpleDirectedHypergraphs.jl
github.com
November 27, 2025 at 11:52 AM
Released v0.2.0 of the @coreacter.org code SimpleDirectedHypergraphs.jl, a Julia package for dealing with my current mathematical obsession, directed hypergraphs.
New release includes heuristic and exact shortest-path algorithms for directed hypergraphs.
#mathsky #networksci #hypergraph #julialang
New release includes heuristic and exact shortest-path algorithms for directed hypergraphs.
#mathsky #networksci #hypergraph #julialang
A nice paper linking to our results and discussion on entropy and detectability limits of the SBM on hypergraphs
iopscience.iop.org/article/10.1...
iopscience.iop.org/article/10.1...
June 24, 2026 at 9:36 PM
A nice paper linking to our results and discussion on entropy and detectability limits of the SBM on hypergraphs
iopscience.iop.org/article/10.1...
iopscience.iop.org/article/10.1...
Oh no, I've just discovered what hypergraphs are, I'm afraid I've just unlocked a new obsession
October 8, 2025 at 1:19 PM
Oh no, I've just discovered what hypergraphs are, I'm afraid I've just unlocked a new obsession
Brilliant synthesis about the role of the higher-order interactions in ecology and the hypergraphs as natural tools for their description and modeling 👇
t.co/MeubK8WLkK
🧪 #Ecology #Macroecology
t.co/MeubK8WLkK
🧪 #Ecology #Macroecology
June 9, 2026 at 2:07 PM
Brilliant synthesis about the role of the higher-order interactions in ecology and the hypergraphs as natural tools for their description and modeling 👇
t.co/MeubK8WLkK
🧪 #Ecology #Macroecology
t.co/MeubK8WLkK
🧪 #Ecology #Macroecology
The microscale organization of directed hypergraphs arxiv.org/abs/2410.16258
The microscale organization of directed hypergraphs
Many real-world complex systems are characterized by non-pairwise -- higher-order -- interactions among system's units, and can be effectively modeled as hypergraphs. Directed hypergraphs distinguish ...
arxiv.org
December 17, 2025 at 8:17 AM
The microscale organization of directed hypergraphs arxiv.org/abs/2410.16258
Higher-order Ising model on hypergraphs link.aps.org/doi/10.1103/...
Higher-order Ising model on hypergraphs
Non-dyadic higher-order interactions affect collective behavior in various networked dynamical systems. Here, we discuss the properties of a novel Ising model with higher-order interactions and charac...
link.aps.org
August 26, 2025 at 9:03 AM
Higher-order Ising model on hypergraphs link.aps.org/doi/10.1103/...
The EATH model for realistic hypergraphs generation is now out in Physical Review E! 📣
journals.aps.org/pre/abstract...
with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
1/2
journals.aps.org/pre/abstract...
with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
1/2
Emerging activity temporal hypergraph: A model for generating realistic time-varying hypergraphs
Time-varying group interactions constitute the building blocks of many complex systems. The framework of temporal hypergraphs makes it possible to represent them by taking into account the higher-orde...
journals.aps.org
November 10, 2025 at 9:24 AM
The EATH model for realistic hypergraphs generation is now out in Physical Review E! 📣
journals.aps.org/pre/abstract...
with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
1/2
journals.aps.org/pre/abstract...
with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
1/2
Modeling temporal hypergraphs arxiv.org/abs/2506.01408
Modeling temporal hypergraphs
Networks representing social, biological, technological or other systems are often characterized by higher-order interaction involving any number of nodes. Temporal hypergraphs are given by ordered se...
arxiv.org
September 28, 2025 at 9:46 AM
Modeling temporal hypergraphs arxiv.org/abs/2506.01408
Using hypergraphs for your data?
Believing that hypergraphs “generalize” standard graphs to “higher order” structures?
Maybe you are conflating structure with mechanism, and this podcast is for you!
🎧 Spotify: creators.spotify.com/pod/show/com...
🎧 Apple: podcasts.apple.com/us/podcast/c...
Believing that hypergraphs “generalize” standard graphs to “higher order” structures?
Maybe you are conflating structure with mechanism, and this podcast is for you!
🎧 Spotify: creators.spotify.com/pod/show/com...
🎧 Apple: podcasts.apple.com/us/podcast/c...
February 20, 2026 at 6:17 PM
Using hypergraphs for your data?
Believing that hypergraphs “generalize” standard graphs to “higher order” structures?
Maybe you are conflating structure with mechanism, and this podcast is for you!
🎧 Spotify: creators.spotify.com/pod/show/com...
🎧 Apple: podcasts.apple.com/us/podcast/c...
Believing that hypergraphs “generalize” standard graphs to “higher order” structures?
Maybe you are conflating structure with mechanism, and this podcast is for you!
🎧 Spotify: creators.spotify.com/pod/show/com...
🎧 Apple: podcasts.apple.com/us/podcast/c...
New preprint out! 📣
“Emerging Activity Temporal Hypergraph (EATH), a model for generating realistic time-varying hypergraphs” with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
arxiv.org/abs/2507.01124
How can we generate realistic time-varying hypergraphs?
1/8 🧵⬇️
“Emerging Activity Temporal Hypergraph (EATH), a model for generating realistic time-varying hypergraphs” with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
arxiv.org/abs/2507.01124
How can we generate realistic time-varying hypergraphs?
1/8 🧵⬇️
Emerging Activity Temporal Hypergraph (EATH), a model for generating realistic time-varying hypergraphs
Time-varying group interactions constitute the building blocks of many complex systems. The framework of temporal hypergraphs makes it possible to represent them by taking into account the higher-orde...
arxiv.org
July 3, 2025 at 8:15 AM
New preprint out! 📣
“Emerging Activity Temporal Hypergraph (EATH), a model for generating realistic time-varying hypergraphs” with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
arxiv.org/abs/2507.01124
How can we generate realistic time-varying hypergraphs?
1/8 🧵⬇️
“Emerging Activity Temporal Hypergraph (EATH), a model for generating realistic time-varying hypergraphs” with @giuliacencetti.bsky.social and @alainbarrat.bsky.social
arxiv.org/abs/2507.01124
How can we generate realistic time-varying hypergraphs?
1/8 🧵⬇️
The giant component of complex hypergraphs: automated generating function calculations
https://arxiv.org/abs/2609.29558
https://arxiv.org/abs/2609.29558
September 25, 2026 at 3:45 PM
The giant component of complex hypergraphs: automated generating function calculations
https://arxiv.org/abs/2609.29558
https://arxiv.org/abs/2609.29558
Fault-tolerant logical measurement just got a lot faster!
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
October 17, 2025 at 5:36 AM
Fault-tolerant logical measurement just got a lot faster!
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
Edge Correlations and Link Prediction in Growing Hypergraphs arxiv.org/abs/2502.02386
Edge Correlations and Link Prediction in Growing Hypergraphs
We propose a generative model of temporally-evolving hypergraphs in which hyperedges form via noisy copying of previous hyperedges. Our proposed model reproduces several stylized facts from many empir...
arxiv.org
August 25, 2025 at 6:12 AM
Edge Correlations and Link Prediction in Growing Hypergraphs arxiv.org/abs/2502.02386
These arguments are based only on:
1. The mere existence of toy models formulated using hypergraphs.
2. The reinterpretation of bipartite network data as hypergraph data.
3. The imputation of hypergraphs from graph data.
4. The heuristic inference of hypergraphs from time-series.
13/N
1. The mere existence of toy models formulated using hypergraphs.
2. The reinterpretation of bipartite network data as hypergraph data.
3. The imputation of hypergraphs from graph data.
4. The heuristic inference of hypergraphs from time-series.
13/N
February 20, 2026 at 8:04 AM
These arguments are based only on:
1. The mere existence of toy models formulated using hypergraphs.
2. The reinterpretation of bipartite network data as hypergraph data.
3. The imputation of hypergraphs from graph data.
4. The heuristic inference of hypergraphs from time-series.
13/N
1. The mere existence of toy models formulated using hypergraphs.
2. The reinterpretation of bipartite network data as hypergraph data.
3. The imputation of hypergraphs from graph data.
4. The heuristic inference of hypergraphs from time-series.
13/N
Drafting a paper on Adaptive Temporal Signed Weighted Directed Multilayer Hypergraphs
June 4, 2025 at 9:11 PM
Drafting a paper on Adaptive Temporal Signed Weighted Directed Multilayer Hypergraphs
Meike Neuwohner presents a characterization of total unimodularity for disjoint hypergraphs, , i.e. hypergraphs whose hyperedges of size at least four are pairwise disjoint.
#EuroMIP25 #orms
#EuroMIP25 #orms
July 1, 2025 at 7:27 PM
Meike Neuwohner presents a characterization of total unimodularity for disjoint hypergraphs, , i.e. hypergraphs whose hyperedges of size at least four are pairwise disjoint.
#EuroMIP25 #orms
#EuroMIP25 #orms