Contributions in this volume focus on computationally efficient algorithms and rigorous mathematical theories for analyzing large-scale networks. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks.
This proceeding is a result of the 7th International Conference in Network Analysis, held at the Higher School of Economics, Nizhny Novgorod in June 2017. The conference brought together scientists, engineers, and researchers from academia, industry, and government.
Автор: Ding-Zhu Du; Hung Q. Ngo Название: Switching Networks: Recent Advances ISBN: 079236953X ISBN-13(EAN): 9780792369530 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains various developments in switching networks and applications, including classic topics, such as nonblocking and Benes conjecture, and different directions, such as optical switching networks and applications in VLSI designs. This title provides the advances for researchers in computer networks and applied mathematics.
Описание: Many multiagent dynamics can be modeled as a stochastic process in which the agents in the system change their state over time in interaction with each other. The Gillespie algorithms are popular algorithms that exactly simulate such stochastic multiagent dynamics when each state change is driven by a discrete event, the dynamics is defined in continuous time, and the stochastic law of event occurrence is governed by independent Poisson processes. The first main part of this volume provides a tutorial on the Gillespie algorithms focusing on simulation of social multiagent dynamics occurring in populations and networks. The authors clarify why one should use the continuous-time models and the Gillespie algorithms in many cases, instead of easier-to-understand discrete-time models. The remainder of the Element reviews recent extensions of the Gillespie algorithms aiming to add more reality to the model (i.e., non-Poissonian cases) or to speed up the simulations. This title is also available as open access on Cambridge Core.
Автор: Kingan Название: Graphs and Networks ISBN: 111893718X ISBN-13(EAN): 9781118937181 Издательство: Wiley Рейтинг: Цена: 13614.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
A unique blend of graph theory and the modern applications of networks for students and data science professionals
In Graphs and Networks, accomplished mathematician and author Dr. Sandra R. Kingan delivers up to date and topical coverage of graph theory while tying in the various real-world applications of social, telecommunication, and computer networks. It includes topics like Tutte's Wheels Theorem, Seymour's Splitter Theorem, and decomposition theorems, and offers access to an accompanying website containing a growing collection of papers that illustrate the practical applications and techniques of graph theory to network science.
Dr. Kingan has extensively classroom tested the text and includes an Instructor's Manual available via written request to the publisher. The book offers practical homework problems to reinforce the presented concepts and limits its use of proof-based, mathematically rigorous problems to advanced topical chapters in Part III. You'll discover a distillation of elements common to large graphs and presentation of particular graphs as examples of the underlying mathematics.
Readers will also benefit from the inclusion of:
A thorough introduction to basic definitions in graph and network theory, as well as isomorphism, graph substructures, and graph operations
An exploration of graph statistics, tress, degree sequences, Eulerian circuits, Hamiltonian cycles, planar graphs, and colorings
A practical discussion of matchings and coverings, graph algorithms, network algorithms, random graphs, spectral graph theory, centrality measures, and network flows
A concise examination of network reliability, extremal graph theory, higher connectivity, excluded minors, and k-sums
Perfect for upper-undergraduate students in graph theory and network science courses or as a self-study text for graduate level students, Graphs and Networks will also earn a place in the libraries of network scientists and graph theorists seeking an insightful reference for the mathematics underlying network science.
Автор: Li, Haitao (shandong Normal University) Zhao, Guod Название: Analysis and control of finite-valued systems ISBN: 1138556505 ISBN-13(EAN): 9781138556508 Издательство: Taylor&Francis Рейтинг: Цена: 27562.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A comprehensive work in finite-value systems that covers the latest achievements using the semi-tensor product method, on various kinds of finite-value systems. The book contains examples to provide a better understanding of the practical applications of finite-value systems.
Автор: Louis Comtet Название: Advanced Combinatorics ISBN: 9401021988 ISBN-13(EAN): 9789401021982 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The true beginnings of combinatorial analysis (also called combina- tory analysis) coincide with the beginnings of probability theory in the 17th century. Today, combinatorial analysis is also relevant to problems of existence, estimation and structuration, like all other parts of mathema- tics, but exclusively forjinite sets.
Автор: Dieter Jungnickel Название: Graphs, Networks and Algorithms ISBN: 3642091865 ISBN-13(EAN): 9783642091865 Издательство: Springer Рейтинг: Цена: 10475.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the third edition of the classic textbook on the subject. With its clear writing, strong organization, and comprehensive coverage of essential theory it is like a personal guide through this important topic, and now has lots of extra material.
Автор: M. ?ngeles Serrano, Mari?n Bogu?? Название: The Shortest Path to Network Geometry ISBN: 1108791085 ISBN-13(EAN): 9781108791083 Издательство: Cambridge Academ Рейтинг: Цена: 2851.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This Element reviews fundamental models and methods for the geometric description of real networks with a focus on applications of real network maps, including decentralized routing protocols, geometric community detection, and the self-similar multiscale unfolding of networks by geometric renormalization.
Автор: Ding-Zhu Du; Hung Q. Ngo Название: Switching Networks: Recent Advances ISBN: 1461379768 ISBN-13(EAN): 9781461379768 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Barthelemy Название: Spatial Networks ISBN: 3030941086 ISBN-13(EAN): 9783030941086 Издательство: Springer Рейтинг: Цена: 8384.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides a complete introduction into spatial networks. It offers the mathematical tools needed to characterize these structures and how they evolve in time and presents the most important models of spatial networks. The book puts a special emphasis on analyzing complex systems which are organized under the form of networks where nodes and edges are embedded in space. In these networks, space is relevant, and topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. This subject is therefore at the crossroad of many fields and is of potential interest to a broad audience comprising physicists, mathematicians, engineers, geographers or urbanists. In this book, the author has expanded his previous book ("Morphogenesis of Spatial Networks") to serve as a textbook and reference on this topic for a wide range of students and professional researchers.
Автор: Delio Mugnolo Название: Mathematical Technology of Networks ISBN: 3319166182 ISBN-13(EAN): 9783319166186 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Dynamical models on graphs or random graphs are increasingly used in applied sciences as mathematical tools to study complex systems whose exact structure is too complicated to be known in detail.
Автор: Cimini Giulio, Mastrandrea Rossana, Squartini Tiziano Название: Reconstructing Networks ISBN: 110872681X ISBN-13(EAN): 9781108726818 Издательство: Cambridge University Press Рейтинг: Цена: 4495.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This Element provides an overview of the ideas, methods and techniques to deal with the problem of missing information in complex networks datasets.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
