843 citations · 5.1k across the 104 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…
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 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…
Distance distribution in configuration model networks
Mor Nitzan, Eytan Katzav, Reimer Kühn +1
We present analytical results for the distribution of shortest path lengths between random pairs of nodes in configuration model networks. The results, which are based on recursion…
Analytical results for the distribution of shortest path lengths in random networks
Eytan Katzav, Mor Nitzan, Daniel ben-Avraham +4
We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-Rényi networks, based on recursion equations for the shells ar…
Diffusion-limited reactions on a two-dimensional lattice with binary disorder
A. Wolff, I. Lohmar, J. Krug +2
Reaction-diffusion systems where transition rates exhibit quenched disorder are common in physical and chemical systems. We study pair reactions on a periodic two-dimensional latti…
Glassy properties and localization of interacting electrons in two-dimensional systems
D. Menashe, O. Biham, B. D. Laikhtman +1
We present a computer simulation study of a disordered two-dimensional system of localized interacting electrons at thermal equilibrium. It is shown that the configuration of occup…
The Limited Scaling Range of Empirical Fractals
David Avnir, Ofer Biham, Daniel A. Lidar +1
The notion of the abundance of fractals is critically re-examined in light of surprising data regarding the scaling range in empirical reports on fractality.