Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
JSTOR Daily

A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs

We present a method to estimate block membership of nodes in a random graph generated by a stochastic blockmodel. We use an embedding procedure motivated by the random dot product graph model, a ...