Автор: Ceccherini-Silberstein Название: Groups, Graphs and Random Walks ISBN: 1316604403 ISBN-13(EAN): 9781316604403 Издательство: Cambridge Academ Рейтинг: Цена: 11880.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the connections with other branches of mathematics. Covering topics from growth and amenability of groups, Schroedinger operators, and Poisson boundaries, this book provides a valuable and up-to-date reference for both researchers and graduates.
Автор: Coolen A.C.C. Название: Generating Random Networks and Graphs ISBN: 0198709897 ISBN-13(EAN): 9780198709893 Издательство: Oxford Academ Рейтинг: Цена: 11246.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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`.
Описание: Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas`s well-known 1985 book.
Автор: Chartrand Gary Название: Graphs & Digraphs ISBN: 1498735762 ISBN-13(EAN): 9781498735766 Издательство: Taylor&Francis Рейтинг: Цена: 16078.00 р. Наличие на складе: Поставка под заказ.
Описание:
Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory.
Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text:
Adds more than 160 new exercises
Presents many new concepts, theorems, and examples
Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach's Conjecture on graph decompositions
Supplies a proof of the perfect graph theorem
Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the text
At the end of the book are indices and lists of mathematicians' names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption.
Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject's fascinating history while covering a host of interesting problems and diverse applications.
Автор: Jay Jorgenson; Serge Lang Название: The Heat Kernel and Theta Inversion on SL2(C) ISBN: 0387380310 ISBN-13(EAN): 9780387380315 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Provides the development of the trace formula and theta inversion formula for SL(2,Z[i]) SL(2,C). Unlike other treatments of the theory, this book begins with the heat kernel on SL(2,C) associated to the invariant Laplacian, which is derived using spherical inversion.
Автор: Hofstad Название: Random Graphs and Complex Networks ISBN: 110717287X ISBN-13(EAN): 9781107172876 Издательство: Cambridge Academ Рейтинг: Цена: 8237.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Network science is one of the fastest growing areas in science and business. This classroom-tested, self-contained book is designed for master`s-level courses and provides a rigorous treatment of random graph models for networks, featuring many examples of real-world networks for motivation and numerous exercises to build intuition and experience.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
