2.4k citations · 7.3k across the 76 of their papers we have counts for
6 papers · 1 filter
Graph Compression -- Save Information by Exploiting Redundancy
Jie Sun, Erik M. Bollt, Daniel ben-Avraham
In this paper we raise the question of how to compress sparse graphs. By introducing the idea of redundancy, we find a way to measure the overlap of neighbors between nodes in netw…
Phase transition in the rich-get-richer mechanism due to finite-size effects
James P. Bagrow, Jie Sun, Daniel ben-Avraham
The rich-get-richer mechanism (agents increase their ``wealth'' randomly at a rate proportional to their holdings) is often invoked to explain the Pareto power-law distribution obs…
Priority diffusion model in lattices and complex networks
Michalis Maragakis, Shai Carmi, Daniel ben-Avraham +2
We introduce a model for diffusion of two classes of particles ( and ) with priority: where both species are present in the same site the motion of 's takes precedence ove…
A Toy Model of the Rat Race
D. ben-Avraham, Satya N. Majumdar, S. Redner
We introduce a toy model of the "rat race" in which individuals try to better themselves relative to the rest of the population. An individual is characterized by a real-valued fit…
Portraits of Complex Networks
J. P. Bagrow, E. M. Bollt, J. D. Skufca +1
We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides usef…
Percolation in Hierarchical Scale-Free Nets
Hernán D. Rozenfeld, Daniel ben-Avraham
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows eithe…