Login / Signup

Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs.

Mindaugas BloznelisJoona KarjalainenLasse Leskelä
Published in: J. Appl. Probab. (2024)
Keyphrases
  • random graphs
  • graph theoretic
  • learning curves
  • phase transition
  • approximation algorithms
  • attributed graphs
  • undirected graph
  • small world
  • np hard
  • bayesian networks
  • search space
  • markov chain
  • graph data