87 citations · 1.4k across the 71 of their papers we have counts for
14 papers · 1 filter
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 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…
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…
The distribution of shortest path lengths in subcritical Erdős-Rényi networks
Eytan Katzav, Ofer Biham, Alexander K. Hartmann
Networks that are fragmented into small disconnected components are prevalent in a large variety of systems. These include the secure communication networks of commercial enterpris…
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…
Distribution of shortest cycle lengths in random networks
Haggai Bonneau, Aviv Hassid, Ofer Biham +2
We present analytical results for the distribution of shortest cycle lengths (DSCL) in random networks. The approach is based on the relation between the DSCL and the distribution…