Excerpt from On the Depth of a Random Graph
Variable 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. Note that we refer here to simple linear.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 1,91 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332969036
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332969036
Quantità: 15 disponibili
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. Print on Demand. This book investigates the depth of random graphs, a topic with important applications in computer science. The author introduces the concept of graph depth and provides a comprehensive analysis of the average and maximum depth of random graphs. The book presents new results on the depth of sparse and dense random graphs, providing valuable insights into the structure and connectivity of these graphs. The author also explores the relationship between the depth of a random graph and the probability of finding paths of a given length. By applying advanced mathematical techniques, the author provides a rigorous treatment of the subject, making this book an essential reference for researchers and practitioners working with random graphs. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781332969036_0
Quantità: Più di 20 disponibili