Coolen Ton (10 results)
More imagesLanguage: English
Published by NaN
- Softcover
Seller: Bookbot, Prague, Czech RepublicBookbot
Contact seller5-star sellerCondition: Used - As new
£ 3.34
£ 17.93 shippingShips from Czech Republic to U.S.A.Quantity: 1 available
Softcover. Condition: As New. Leichte Kratzer / Abnutzungen / Druckstellen.
- Hardcover
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United KingdomPhatpocket Limited
Contact seller5-star sellerCondition: Used - Good
£ 74.51
£ 10.64 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
- Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
£ 101.35
£ 18.65 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
Hardback. Condition: New. New copy - Usually dispatched within 4 working days.
- Hardcover
- Print on Demand
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
£ 104.58
Free ShippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: new. Hardcover. 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 Gra…ph Models, where the targeted probability of each network appearing in the ensemble is specified. This section also includes degree-preserving randomisation algorithms, where theaim 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. preferentialattachment) 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 ideasstraightforward 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 specifiedcontrol 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. This book describes how to correctly and efficiently generate random networks based on certain constraints. Being able to test a hypothesis against a properly specified control case is at the heart of the 'scientific method'. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Hardcover
- Print on Demand
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 133.99
£ 2.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Hardcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 139.26
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Hardcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 143.77
£ 8.50 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Hardcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 112.49
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: new. Hardcover. 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 Gra…ph Models, where the targeted probability of each network appearing in the ensemble is specified. This section also includes degree-preserving randomisation algorithms, where theaim 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. preferentialattachment) 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 ideasstraightforward 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 specifiedcontrol 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. This book describes how to correctly and efficiently generate random networks based on certain constraints. Being able to test a hypothesis against a properly specified control case is at the heart of the 'scientific method'. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Hardcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 97.32
£ 59.80 shippingShips from Germany to U.S.A.Quantity: 5 available
Buch. Condition: Neu. Generating Random Networks and Graphs | Ton Coolen | Buch | Gebunden | Englisch | 2017 | Oxford University Press(UK) | EAN 9780198709893 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
- Hardcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 116.25
£ 54.42 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 begin…s with approaches such as Exponential Random GraphModels, 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 abias. 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 temporalgraphs. 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 isvital for anybody wishing to apply network science in their research.
