Showing math.PRShow all
2 papers · 1 filter
math.PR2026
The rank and layer distributions in random recursive trees
Huck Stepanyants, P. L. Krapivsky, Harrison Hartle +1
The distribution of node depths in a network is crucial for analyzing network structure. Two measures, rank and layer, quantify how deep inside a network a node is. The rank is the…
math.PR2025
Dynamic Space Filling
P. L. Krapivsky
Dynamic space filling (DSF) is a stochastic process defined on any connected graph. Each vertex can host an arbitrary number of particles forming a pile, with every arriving partic…