890 citations · 8.4k across the 209 of their papers we have counts for
10 papers · 1 filter
Understanding Search Trees via Statistical Physics
Satya N. Majumdar, David S. Dean, P. L. Krapivsky
We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety…
Log-Networks
P. L. Krapivsky, S. Redner
We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ult…
Kinetic Theory of Random Graphs: from Paths to Cycles
E. Ben-Naim, P. L. Krapivsky
Structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (…
Weight-driven growing networks
T. Antal, P. L. Krapivsky
We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights o…
Universal Properties of Growing Networks
P. L. Krapivsky, B. Derrida
Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law deca…
Statistics of Weighted Networks
E. Almaas, P. L. Krapivsky, S. Redner
We study the statistics of growing networks in which each link carries a weight (k_i k_j)^theta, where k_i and k_j are the node degrees at the endpoints of link ij. Network growth…