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.
"Sinopsis" puede pertenecer a otra edición de este libro.
EUR 0,66 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332969036
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332969036
Cantidad disponible: 15 disponibles
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: 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. Nº de ref. del artículo: 9781332969036_0
Cantidad disponible: Más de 20 disponibles