Clustering without geometry in sparse networks with independent edges
math.PR, cond-mat.dis-nn, math-ph, math.MP, nlin.AO, physics.app-ph
Submitted: 2026-03-13
Updated: 2026-11-03
Terminology
Sources
- Geometry-free renormalization of directed networks: scale-invariance and reciprocity
- Spectra of random graphs with discrete scale invariance
- Random graphs with arbitrary i.i.d. degrees
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves
- A zero-one law for swap-invariant events in uniform spanning forests
- Bernoulli flow for Erd s-R'enyi graphs