776 citations · 999 across the 9 of their papers we have counts for
3 papers · 1 filter
Trapping in complex networks
Aristotelis Kittas, Shai Carmi, Shlomo Havlin +1
We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density of random walkers in the presence of…
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…
MEDUSA - New Model of Internet Topology Using k-shell Decomposition
Shai Carmi, Shlomo Havlin, Scott Kirkpatrick +2
The k-shell decomposition of a random graph provides a different and more insightful separation of the roles of the different nodes in such a graph than does the usual analysis in…