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
Search results for On the Depth of a Random Graph (Classic Reprint)
Stock Image
On the Depth of a Random Graph Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780364540121
Stock Image
On the Depth of a Random Graph Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780364540121
Buy New
US$ 31.00
US$ 5.65 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Seller Image
ON THE DEPTH OF A RANDOM GRAPH
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Gebunden. Condition: New. KlappentextrnrnExcerpt from On the Depth of a Random GraphVariable whose values are graphs (digraphs) on the vertex set If e {u,v} (resp. E and u,v E u v, then Prob {e is an edge} p and these probabilities are independent for different e. Seller Inventory # 2144669462
Buy New
US$ 37.30
US$ 57.43 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available