Do you remember this video?
I installed and used my first Linux in 1999, I was 15 years old and felt like “wow, I am free to play with my computer!” (and destroy it, a couple of times).
#Linux
youtu.be/MS-aLOm-6Vc
Or he knows pretty well: manlius.substack.com/p/have-we-cr...
But we all hope, still, it's just incompetence.
It's coming.
What am I watching here, exactly?
I had hard times not believing this was just some AI generated video.
It seems it is not.
youtube.com/shorts/VxXW9...
Musk, worth $829 billion, owns X.
Bezos, worth $234 billion, owns The Washington Post & Twitch.
Zuckerberg, worth $231 billion, owns Facebook, Instagram & WhatsApp.
And now Larry Ellison, worth $202 billion, is about to control CNN, CBS, TikTok & HBO.
Yes, this is oligarchy.
Is “complexity” always in the eye of the beholder?
Is complexity in the system, or in the fit between the system and our description of it?
New #ComplexityThoughts:
open.substack.com/pub/manlius/...
Sadly.
Is “complexity” always in the eye of the beholder?
Is complexity in the system, or in the fit between the system and our description of it?
New #ComplexityThoughts:
open.substack.com/pub/manlius/...
💯
The incorrect idea that ”graphs only encode pairwise interactions“ has done a lot of damage, and will take a long time to repair.
www.sciencedirect.com/science/arti...
Our featured article, February 2026: Quantifying biases in reconstructed brain networks by @comunelab.bsky.social, @manlius.bsky.social and @valedand.bsky.social
rdcu.be/e52eU
and there you go: it is a perfectly valid Hamiltonian “on a graph” in the sense of our paper, ie “graph = domain/neighborhood structure + arbitrary multivariate interaction function”.
But maybe I got it wrong, feel free to show me where/how and I will re-think about it.
/fin
Now “generic n-body” means phi_c is an arbitrary function on {±1}^n, so it has 2^n coefficients in the standard monomial basis:
9/
I can always do this on a graph, no?
Take n spins on nodes V={1,…,n}. Use the complete graph G=K_n so each node has neighborhood ∂i=V{i}.
Let the “group” be c=V and define the graph Hamiltonian by:
8/
If we truncate the expansion to order k (keeping only subsets A with |A|≤k) the number of free coefficients becomes sum_{m=0}^k binom(n,m) (minus 1 if you drop the constant).
Hyperedges don’t change this count: they only choose which c exist.
7/
Now the key distinction: “pairwise graph can’t” is shorthand for “you restrict phi_c to only |A|≤2 terms”.
But, as far as I understand, that’s a constraint on the function class, not on whether c is indexed by a hyperedge or a graph neighborhood.
6/
Let's see if I got your point.
Let a hyperedge be a set c ⊂ V with |c| = n
An “n-spin term on that hyperedge” is just a function
phi_c : {±1}^n → R, assigning an energy to each configuration of spins in c.
So far so good?
5/
Hyperedges don’t fix the “2^n dof” issue.
A generic n-spin term is an arbitrary function on {±1}^n, i.e., it has 2^n values (well, minus a constant gauge).
Here’s the count in a standard basis: any n-spin potential expands over all subsets, 2^n coefficients (again, minus the constant term).
4/
But that “cannot” is about this specific choice of potential (sum of 1-body + 2-body terms), not about graphs as neighborhoods/domains.
A graph can still parameterize who can influence whom while allowing multivariate couplings on neighborhoods (the point of our paper).
3/
If by “graph” you mean (ie, assume by design) the pairwise Ising restriction, then you’re right: that family cannot represent a generic n-body interaction on the same spins.
To be clear, I am referring to the Hamiltonian below. Which is, btw, a specific “mechanism choice”, not a structural one.
2/
How hypergraphs would avoid the O(2^n) dof of a generic n-body Ising term?
They only index which subsets get a term: if graphs specify neighborhoods/domains and node interactions are arbitrary multivariate functions on them, hypergraph models are a constrained subfamily.
1/
The Slow Science Movement advocates for a more thoughtful, sustainable approach to research that values quality over quantity and depth over speed.
It sounds trivial, but if you are an active researcher you know it is not.
👉 www.slow-science.com/index.html
It seems to me that the point about being "true" or "intrinsic for" or "more general than" has been done in other 100s papers.
The point is about "telling the truth" and being counterfactual, not claiming what's "true", since there is no such a thing as a "true" model, by definition.
I think it's a legit question and, actually, something I agree with.
If social media were not important to influence human behavior, why so much investment on them?
A possible answer is also: just because they made platform richer.
But very legit doubt.
“Our results support a hypothesis whereby evolving cheaper but more numerous units through reduced investment in structural tissues was a strategic trend in the evolution and diversification of complex insect societies”
🧪🌐🐜
www.science.org/doi/10.1126/...
Partially agree: there is at least one study supporting this and I can't find studies supporting the opposite.
I am fine with being cautiously confident and waiting for more results.
@acerbialberto.com what's your take on this?
I remember we had several discussions where you were sustaining the opposite, ie that social media have no influence.
“initial exposure to X’s algorithm has persistent effects on users’ current political attitudes and account-following behaviour, -even in the absence of a detectable effect on partisanship”
That's the reason for a large body of research in the last two decades.
www.nature.com/articles/s41...