295 citations · 1k across the 7 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
q-bio.MN2003★ 195 cited
Topological Generalizations of network motifs
N. Kashtan, S. Itzkovitz, R. Milo +1
Biological and technological networks contain patterns, termed network motifs, which occur far more often than in randomized networks. Network motifs were suggested to be elementar…
cond-mat.stat-mech2003★ 295 cited
On the uniform generation of random graphs with prescribed degree sequences
R. Milo, N. Kashtan, S. Itzkovitz +2
Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detec…
cond-mat.stat-mech2003★ 219 cited
Subgraphs in random networks
S. Itzkovitz, R. Milo, N. Kashtan +2
Understanding the subgraph distribution in random networks is important for modelling complex systems. In classic Erdos networks, which exhibit a Poissonian degree distribution, th…