295 citations · 833 across the 4 of their papers we have counts for
4 papers
Coarse-Graining and Self-Dissimilarity of Complex Networks
Shalev Itzkovitz, Reuven Levitt, Nadav Kashtan +3
Can complex engineered and biological networks be coarse-grained into smaller and more understandable versions in which each node represents an entire pattern in the original netwo…
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…
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…
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…