On the Depth of a Random Graph (Classic Reprint) - Softcover

John H. Reif

 
9781332969036: On the Depth of a Random Graph (Classic Reprint)

Synopsis

Uncover how deep randomness can go in graphs and why it matters

Discover how the depth of random graphs behaves as the size grows, with results that bound average depth and its distribution. This book presents rigorous proofs that link graph density to how far information must travel through the network.

The work focuses on depth in both undirected and directed random graphs, showing that under various edge probabilities the depth is typically proportional to a constant times log n. It offers a sequence of theorems and proofs that connect the graph’s structure to its depth, giving readers a precise sense of how quickly depth grows or shrinks as the graph expands.

  • Clear statements about average depth and depth distribution for different p regimes
  • Two-stage proof techniques and probabilistic reasoning, including BFS-style arguments
  • Connections to classical results while highlighting new contributions for sparse and dense graphs

Ideal for readers of theoretical computer science, combinatorics, and network science who want rigorous, accessible insight into how random graph structures behave at scale.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title