295 citations · 1k across the 7 of their papers we have counts for
Showing cond-mat.stat-mechShow all
3 papers · 1 filter
cond-mat.stat-mech2004★ 81 cited
Subgraphs and network motifs in geometric networks
Shalev Itzkovitz, Uri Alon
Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and…
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…