Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Maximum-Entropy Networks: Pattern Detection, Network Reconstruction and Graph Combinatorics

by Tiziano Squartini
Save 35% Save 35%
Current price ₹4,366.00
Original price ₹6,716.00
Original price ₹6,716.00
Original price ₹6,716.00
(-35%)
₹4,366.00
Current price ₹4,366.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783319694368
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 116
  • Original Price: EUR 59.99
  • Language: English
  • Edition: 2017
  • Item Weight: 196 grams
  • BISAC Subject(s): System Theory, Physics / Mathematical & Computational, and Applied

This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties. After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem of network reconstruction and introduces various advanced techniques to reliably infer the topology of a network from partial local information. Chapter 5 is devoted to the reformulation of certain "hard" combinatorial operations, such as the enumeration and unbiased sampling of graphs with given constraints, within a "softened" maximum-entropy framework. A final chapter offers various overarching remarks and take-home messages.By requiring no prior knowledge of network theory, the book targets a broad audience ranging from PhD students approaching these topics for the first time to senior researchers interested in the application of advanced network techniques to their field.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us