38 citations · 60 across the 3 of their papers we have counts for
7 papers
Analytical results for the distribution of first return times of random walks on random regular graphs
Ido Tishby, Ofer Biham, Eytan Katzav
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of nodes of degree . Sta…
Analytical results for the distribution of first hitting times of random walks on random regular graphs
Ido Tishby, Ofer Biham, Eytan Katzav
We present analytical results for the distribution of first hitting times of random walks (RWs) on random regular graphs (RRGs) of degree and a finite size . Starting…
Convergence towards an Erd{\H o}s-Rényi graph structure in network contraction processes
Ido Tishby, Ofer Biham, Eytan Katzav
In a highly influential paper twenty years ago, Barabási and Albert [Science 286, 509 (1999)] showed that networks undergoing generic growth processes with preferential attachment…
Generating random networks that consist of a single connected component with a given degree distribution
Ido Tishby, Ofer Biham, Eytan Katzav +1
We present a method for the construction of ensembles of random networks that consist of a single connected component with a given degree distribution. This approach extends the co…
Statistical analysis of articulation points in configuration model networks
Ido Tishby, Ofer Biham, Reimer Kühn +1
An articulation point (AP) in a network is a node whose deletion would split the network component on which it resides into two or more components. APs are vulnerable spots that pl…
Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
Ido Tishby, Ofer Biham, Eytan Katzav +1
The micro-structure of the giant component of the Erd{\H o}s-Rényi network and other configuration model networks is analyzed using generating function methods. While configuration…