Random geometric graphs

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This monograph provides and explains the mathematics behind geometric graph theory, which studies the properties of a graph that consists of nodes placed in Euclidean space so that edges can be added to connect points that are close to one another. For example, a collection of trees scattered in a forest and the disease that is passed between them, a set of nests of animals or birds on a region and the communication between them or communication between communications stations or nerve cells. Aimed at graduate students and researchers in probability, statistics, combinatorics and graph theory including computer scientists, it covers topics such as: technical tools, edge and component counts, vertex degrees, clique and chromatic number, and connectivity. Applications of this theory are used in the study of neural networks, spread of disease, astrophysics and spatial statistics.

Author(s): Mathew Penrose
Series: Oxford studies in probability 5
Publisher: Oxford University Press
Year: 2003

Language: English
Pages: 345
City: Oxford; New York