Random Graphs and Complex Networks: Volume 1

367 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A topological insight into restricted Boltzmann machines (2016, background): “More formally, a graph sequence ( G N ) N ≥ 1 has a small-world topology, if there is a constant 0 K ∞ such that lim N →∞ p ( L N ≤ KlogN ) = 1 , where L N is the typical shortest path of G N (van der Hofstad, 2016).”