1.2k citations · 2.5k across the 39 of their papers we have counts for
39 papers
Random Recursive Simplicial Complexes
P. L. Krapivsky, M. Lucas
We investigate random recursive simplicial complexes growing by adding, at each step, a vertex together with a simplex formed by joining the new vertex with a randomly chosen exist…
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…
Universal fluctuations of first discoveries in competitive exploration
Arthur Plaud, P. L. Krapivsky, S. Redner +1
Random exploration is usually quantified by how fast new space is found, from the range of a single walker to the territory collectively covered by many walkers. In competitive exp…
The Winner Takes It All
P. L. Krapivsky
The winner-takes-all process takes place on an arbitrary graph. There is an agent on each vertex of the graph, and active agents at neighboring vertices play games. In each game, a…
Growing unlabeled networks
Harrison Hartle, Brennan Klein, Dmitri Krioukov +1
Models of growing networks are a central topic in network science. In these models, vertices are usually labeled by their arrival time, distinguishing even those node pairs whose s…
A generative model of function growth explains hidden self-similarities across biological and social systems
James Holehouse, S. Redner, Vicky Chuqiao Yang +5
From genomes and ecosystems to bureaucracies and cities, the growth of complex systems occurs by adding new types of functions and expanding existing ones. We present a simple gene…