Most networks and databases that humans have to deal with contain large, albeit finite number of units. Their structure, for maintaining functional consistency of the components, is essentially not random and calls for a precise quantitative description of relations between nodes (or data units) and all network components. This book is an introduction, for both graduate students and newcomers to the field, to the theory of graphs and random walks on such graphs. The methods based on random walks and diffusions for exploring the structure of finite connected graphs and databases are reviewed (Markov chain analysis). This provides the necessary basis for consistently discussing a number of applications such diverse as electric resistance networks, estimation of land prices, urban planning, linguistic databases, music, and gene expression regulatory networks.

This volume provides an introduction to and overview of the emerging field of interconnected networks which include multilayer or multiplex networks, as well as networks of networks. Such networks present structural and dynamical features quite different from those observed in isolated networks. The presence of links between different networks or layers of a network typically alters the way such interconnected networks behave – understanding the role of interconnecting links is therefore a crucial step towards a more accurate description of real-world systems. While examples of such dissimilar properties are becoming more abundant – for example regarding diffusion, robustness and competition – the root of such differences remains to be elucidated. Each chapter in this topical collection is self-contained and can be read on its own, thus making it also suitable as reference for experienced researchers wishing to focus on a particular topic.

This book includes papers from the second year of the prestigious First International Early Research Career Enhancement School (FIERCES) series: a successful, new format that puts a school in direct connection with a conference and a social program, all dedicated to young scientists. Reflecting the friendly, social atmosphere of excitement and opportunity, the papers represent a good mixture of cutting-edge research focused on advances towards the most inspiring challenges of our time and first ambitious attempts at major challenges by as yet unknown, talented young scientists. In this second year of FIERCES, the BICA Challenge (to replicate all the essential aspects of the human mind in the digital environment) meets the Cybersecurity Challenge (to protect all the essential assets of the human mind in the digital environment), which is equally important in our age. As a result, the book fosters lively discussions on today’s hot topics in science and technology, and stimulates the emergence of new cross-disciplinary, cross-generation and cross-cultural collaboration. FIERCES 2017, or the First International Early Research Career Enhancement School on Biologically Inspired Cognitive Architectures and Cybersecurity, was held on August 1–5 at the Baltschug Kempinski in Moscow, Russia.

This important collection presents recent advances in nonlinear dynamics including analytical solutions, chaos in Hamiltonian systems, time-delay, uncertainty, and bio-network dynamics. Nonlinear Dynamics and Complexity equips readers to appreciate this increasingly main-stream approach to understanding complex phenomena in nonlinear systems as they are examined in a broad array of disciplines. The book facilitates a better understanding of the mechanisms and phenomena in nonlinear dynamics and develops the corresponding mathematical theory to apply nonlinear design to practical engineering.

This book is designed as a concise introduction to the recent achievements on spectral analysis of graphs or networks from the point of view of quantum (or non-commutative) probability theory. The main topics are spectral distributions of the adjacency matrices of finite or infinite graphs and their limit distributions for growing graphs. The main vehicle is quantum probability, an algebraic extension of the traditional probability theory, which provides a new framework for the analysis of adjacency matrices revealing their non-commutative nature. For example, the method of quantum decomposition makes it possible to study spectral distributions by means of interacting Fock spaces or equivalently by orthogonal polynomials. Various concepts of independence in quantum probability and corresponding central limit theorems are used for the asymptotic study of spectral distributions for product graphs.This book is written for researchers, teachers, and students interested in graph spectra, their (asymptotic) spectral distributions, and various ideas and methods on the basis of quantum probability. It is also useful for a quick introduction to quantum probability and for an analytic basis of orthogonal polynomials.

This book analyzes stochastic processes on networks and regular structures such as lattices by employing the Markovian random walk approach. Part 1 is devoted to the study of local and non-local random walks. It shows how non-local random walk strategies can be defined by functions of the Laplacian matrix that maintain the stochasticity of the transition probabilities. A major result is that only two types of functions are admissible: type (i) functions generate asymptotically local walks with the emergence of Brownian motion, whereas type (ii) functions generate asymptotically scale-free non-local “fractional” walks with the emergence of Lévy flights. In Part 2, fractional dynamics and Lévy flight behavior are analyzed thoroughly, and a generalization of Pólya's classical recurrence theorem is developed for fractional walks. The authors analyze primary fractional walk characteristics such as the mean occupation time, the mean first passage time, the fractal scaling of the set of distinct nodes visited, etc. The results show the improved search capacities of fractional dynamics on networks.

The Nature of Complex Networks provides a systematic introduction to the statistical mechanics of complex networks and the different theoretical achievements in the field that are now finding strands in common. The book presents a wide range of networks and the processes taking place on them, including recently developed directions, methods, and techniques. It assumes a statistical mechanics view of random networks based on the concept of statistical ensembles but also features the approaches and methods of modern random graph theory and their overlaps with statistical physics. This book will appeal to graduate students and researchers in the fields of statistical physics, complex systems, graph theory, applied mathematics, and theoretical epidemiology.

This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations. Yet the topic of differential equations on graphs, ramified spaces, and more general network-like objects has recently gained significant momentum and, well beyond the confines of mathematics, there is a lively interdisciplinary discourse on all aspects of so-called complex networks. Such network-like structures can be found in virtually all branches of science, engineering and the humanities, and future research thus calls for solid theoretical foundations. This book is specifically devoted to the study of evolution equations – i.e., of time-dependent differential equations such as the heat equation, the wave equation, or the Schrödinger equation (quantum graphs) – bearing in mind that the majority of the literature in the last ten years on the subject of differential equations of graphs has been devoted to elliptic equations and related spectral problems. Moreover, for tackling the most general settings - e.g. encoded in the transmission conditions in the network nodes - one classical and elegant tool is that of operator semigroups. This book is simultaneously a very concise introduction to this theory and a handbook on its applications to differential equations on networks. With a more interdisciplinary readership in mind, full proofs of mathematical statements have been frequently omitted in favor of keeping the text as concise, fluid and self-contained as possible. In addition, a brief chapter devoted to the field of neurodynamics of the brain cortex provides a concrete link to ongoing applied research.

This book constitutes the proceedings of the 16th Russian Conference on Artificial Intelligence, RCAI 2018, Moscow, Russia, in September 2018. The 22 full papers presented along with 4 short papers in this volume were carefully reviewed and selected from 75 submissions. The conference deals with a wide range of topics, including data mining and knowledge discovery, text mining, reasoning, decision making, natural language processing, vision, intelligent robotics, multi-agent systems, machine learning, ontology engineering.

The book is an introduction, for both graduate students and newcomers to the field of the modern theory of mesoscopic complex systems, time series, hypergraphs and graphs, scaled random walks, and modern information theory. As these are applied for the exploration and characterization of complex systems. Our self-consistent review provides the necessary basis for consistency. We discuss a number of applications such diverse as urban structures and musical compositions.