• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems.

Umberto De AmbroggioMatthew I. Roberts
Published in: Comb. Probab. Comput. (2022)
Keyphrases
  • graph mining
  • graph matching
  • data sets
  • graph theory
  • graph databases
  • graph theoretic
  • real time
  • artificial intelligence
  • information systems
  • pattern recognition
  • software components
  • small world
  • graph clustering