Mathematicians found a "Goldilocks speed" for how patterns spread through networks, solving a mystery that's been bugging them for years.
arXiv · March 18, 2026 · 2603.16069
The Takeaway
In the study of randomness and networks, patterns were previously thought to appear at either a slow 'polynomial' rate or a fast 'exponential' rate as the network grows. This paper identifies the first-ever examples of a strange 'in-between' growth rate, proving that our map of mathematical possibilities was missing a giant middle ground.
From the abstract
For a 3-uniform hypergraph (3-graph) $F$, let $r(F,n)$ be the smallest $N$ such that any $N$-vertex $F$-free 3-graph has an independent set of size $n$. We construct a $3$-graph $H_2$ with six vertices and five edges such that $r(H_2,n)=n^{\Theta(\log n)}$, and a more general family of $3$-graphs $F$ for which $r(F,n)=n^{\log^{\Theta(1)}(n)}$. These are the first examples of such Ramsey number known to be neither polynomial nor exponential.