Title
Statistical inference on random graphs: A survey of known and novel methods,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
The study of random graphs is a field that emerged in the second half of the 20th century. Most of the work in this area is combinatorial in nature: a random model is assumed and used for computing various asymptotic properties on the graph. The work contained in this book takes a reverse approach. Our questions are: given a large graph realization, what can we learn about it? How can we hypothesize an underlying model? How can we test the graph for the hypothesis? The first half of the book is a survey of some wellknown and less wellknown methods, and apply some of them on various "scalefree" graphs, including the famous AlbertBarabsi graph model. Then we proceed beyond the scalefree realm to examine the problem of generation uniformly distributed graphs with a given expected degree sequence. We hope every reader will find something to enjoy in and/or learn from the book.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.