2.4k citations · 7.3k across the 76 of their papers we have counts for
5 papers · 1 filter
Partition of Networks into Basins of Attraction
Shai Carmi, P. L. Krapivsky, Daniel ben-Avraham
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neigh…
Front Propagation with Rejuvenation in Flipping Processes
T. Antal, D. ben-Avraham, E. Ben-Naim +1
We study a directed flipping process that underlies the performance of the random edge simplex algorithm. In this stochastic process, which takes place on a one-dimensional lattice…
Kleinberg navigation on anisotropic lattices
J. Mauricio Campuzano, James P. Bagrow, Daniel ben-Avraham
We study the Kleinberg problem of navigation in Small World networks when the underlying lattice is stretched along a preferred direction. Extensive simulations confirm that maxima…
Sequence Nets
Jie Sun, Takashi Nishikawa, Daniel ben-Avraham
We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of letters (corresponding to types of nodes) and a fixed set of…
From the conserved Kuramoto-Sivashinsky equation to a coalescing particles model
Paolo Politi, Daniel ben-Avraham
The conserved Kuramoto-Sivashinsky (CKS) equation, u_t = -(u+u_xx+u_x^2)_xx, has recently been derived in the context of crystal growth, and it is also strictly related to a simila…