61 citations · 249 across the 8 of their papers we have counts for
4 papers · 1 filter
Localization transition on complex networks via spectral statistics
M. Sade, T. Kalisky, S. Havlin +1
The spectral statistics of complex networks are numerically studied. The features of the Anderson metal-insulator transition are found to be similar for a wide range of different n…
Width of percolation transition in complex networks
Tomer Kalisky, Reuven Cohen
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width for systems of finite size. Here…
Scaling of optimal-path-lengths distribution in complex networks
Tomer Kalisk, Lidia A. Braunstein, Sergey V. Buldyrev +2
We study the distribution of optimal path lengths in random graphs with random weights associated with each link (``disorder''). With each link we associate a weight $τ_i = \ex…
Scale-Free Networks Emerging from Weighted Random Graphs
Tomer Kalisky, Sameet Sreenivasan, Lidia A. Braunstein +3
We study Erdös-Rényi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights bel…