Generating random networks efficiently and accurately is an important challenge for practical applications, and an interesting question for theoretical study. This book presents and discusses common methods of generating random graphs. It begins with approaches such as Exponential Random Graph Models, where the targeted probability of each network appearing in the ensemble is specified. This section also includes degree-preserving randomisation algorithms, where the aim is to generate networks with the correct number of ...
Read More
Generating random networks efficiently and accurately is an important challenge for practical applications, and an interesting question for theoretical study. This book presents and discusses common methods of generating random graphs. It begins with approaches such as Exponential Random Graph Models, where the targeted probability of each network appearing in the ensemble is specified. This section also includes degree-preserving randomisation algorithms, where the aim is to generate networks with the correct number of links at each node, and care must be taken to avoid introducing a bias. Separately, it looks at growth style algorithms (e.g. preferential attachment) which aim to model a real process and then to analyse the resulting ensemble of graphs. It also covers how to generate special types of graphs including modular graphs, graphs with community structure and temporal graphs. The book is aimed at the graduate student or advanced undergraduate. It includes many worked examples and open questions making it suitable for use in teaching. Explicit pseudocode algorithms are included throughout the book to make the ideas straightforward to apply. With larger and larger datasets, it is crucial to have practical and well-understood tools. Being able to test a hypothesis against a properly specified control case is at the heart of the 'scientific method'. Hence, knowledge on how to generate controlled and unbiased random graph ensembles is vital for anybody wishing to apply network science in their research.
Read Less
Add this copy of Generating Random Networks and Graphs to cart. $90.76, good condition, Sold by Phatpocket Limited rated 4.0 out of 5 stars, ships from Waltham Abbey, ESSEX, UNITED KINGDOM, published 2017 by Oxford University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Ships from UK in 48 hours or less (usually same day). Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. 100% money back guarantee. We are a world class secondhand bookstore based in Hertfordshire, United Kingdom and specialize in high quality textbooks across an enormous variety of subjects. We aim to provide a vast range of textbooks, rare and collectible books at a great price. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. We provide a 100% money back guarantee and are dedicated to providing our customers with the highest standards of service in the bookselling industry.
Add this copy of Generating Random Networks and Graphs to cart. $98.15, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2017 by Oxford University Press.
Add this copy of Generating Random Networks and Graphs to cart. $163.71, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2017 by Oxford University Press.
Add this copy of Generating Random Networks and Graphs to cart. $207.98, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2017 by Oxford University Press.
