38 citations · 210 across the 16 of their papers we have counts for
16 papers
Analytical results for the distribution of first return times of non-backtracking random walks on configuration model networks
Dor Lev-Ari, Ido Tishby, Ofer Biham +2
We present analytical results for the distribution of first return (FR) times of non-backtracking random walks (NBWs) on undirected configuration model networks consisting of n…
The distribution of the number of cycles in directed and undirected random 2-regular graphs
Ido Tishby, Ofer Biham, Eytan Katzav +1
We present analytical results for the distribution of the number of cycles in directed and undirected random 2-regular graphs (2-RRGs) consisting of nodes. In directed 2-RRGs e…
Analytical results for the distribution of first-passage times of random walks on random regular graphs
Ido Tishby, Ofer Biham, Eytan Katzav
We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of nodes of degree . Startin…
The mean and variance of the distribution of shortest path lengths of random regular graphs
Ido Tishby, Ofer Biham, Reimer Kühn +1
The distribution of shortest path lengths (DSPL) of random networks provides useful information on their large scale structure. In the special case of random regular graphs (RRGs),…
Analytical results for the distribution of cover times of random walks on random regular graphs
Ido Tishby, Ofer Biham, Eytan Katzav
We present analytical results for the distribution of cover times of random walks (RWs) on random regular graphs consisting of nodes of degree (). Starting from a…
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…
Analysis of the convergence of the degree distribution of contracting random networks towards a Poisson distribution using the relative entropy
I. Tishby, O. Biham, E. Katzav
We present analytical results for the structural evolution of random networks undergoing contraction processes via generic node deletion scenarios, namely, random deletion, prefere…
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…
The distribution of first hitting times of random walks on directed Erdős-Rényi networks
Ido Tishby, Ofer Biham, Eytan Katzav
We present analytical results for the distribution of first hitting times of random walkers (RWs) on directed Erdős-Rényi (ER) networks. Starting from a random initial node, a rand…
The distribution of first hitting times of non-backtracking random walks on Erdős-Rényi networks
Ido Tishby, Ofer Biham, Eytan Katzav
We present analytical results for the distribution of first hitting times of non-backtracking random walks on finite Erdős-Rényi networks of nodes. The walkers hop randomly bet…
The distribution of first hitting times of random walks on Erdős-Rényi networks
Ido Tishby, Ofer Biham, Eytan Katzav
Analytical results for the distribution of first hitting times of random walks on Erdős-Rényi networks are presented. Starting from a random initial node, a random walker hops betw…
The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
Ido Tishby, Ofer Biham, Eytan Katzav
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete th…