Login / Signup
Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs.
Mindaugas Bloznelis
Joona Karjalainen
Lasse Leskelä
Published in:
CoRR (2021)
Keyphrases
</>
random graphs
graph theoretic
learning curves
phase transition
undirected graph
attributed graphs
approximation algorithms
small world
social networks
search space
np hard
graph mining