This valuable source for graduate students and researchers provides a comprehensive introduction to current theories and applications in optimization methods and network models. Contributions to this book are focused on new efficient algorithms and rigorous mathematical theories, which can be used to optimize and analyze mathematical graph structures with massive size and high density induced by natural or artificial complex networks. Applications to social networks, power transmission grids, telecommunication networks, stock market networks, and human brain networks are presented. Chapters in this book cover the following topics: Linear max min fairness Heuristic approaches for high-quality solutions Efficient approaches for complex multi-criteria optimization problems Comparison of heuristic algorithms New heuristic iterative local search Power in network structures Clustering nodes in random graphs Power transmission grid structure Network decomposition problems Homogeneity hypothesis testing Network analysis of international migration Social networks with node attributes Testing hypothesis on degree distribution in the market graphs Machine learning applications to human brain network studies This proceeding is a result of The 6th International Conference on Network Analysis held at the Higher School of Economics, Nizhny Novgorod in May 2016. The conference brought together scientists and engineers from industry, government, and academia to discuss the links between network analysis and a variety of fields.

This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held in Cottbus, Germany, in June 2018. The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.

This book discusses research, methods, and recent developments in the interdisciplinary field that spans research in visualization, eye tracking, human-computer interaction, and psychology. It presents extended versions of papers from the First Workshop on Eye Tracking and Visualization (ETVIS), which was organized as a workshop of the IEEE VIS Conference 2015. Topics include visualization and visual analytics of eye-tracking data, metrics and cognitive models, eye-tracking experiments in the context of visualization interfaces, and eye tracking in 3D and immersive environments. The extended ETVIS papers are complemented by a chapter offering an overview of visualization approaches for analyzing eye-tracking data and a chapter that discusses electrooculography (EOG) as an alternative of acquiring information about eye movements. Covering scientific visualization, information visualization, and visual analytics, this book is a valuable resource for eye-tracking researchers within the visualization community.

Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems. The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.

This book constitutes the proceedings of the 24th International Conference on Computing and Combinatorics, COCOON 2018, held in Qing Dao, China, in July 2018. The 62 papers presented in this volume were carefully reviewed and selected from 120 submissions. They deal with the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing.

This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomised algorithms, algorithms for big data analytics, and new paradigms of computation.

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+e)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.

The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher School of Economics, Nizhny Novgorod in May 2014, initiated joint research between scientists, engineers and researchers from academia, industry and government; the major results of conference participants have been reviewed and collected in this Work. 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.

This volume offers a valuable starting point for anyone interested in learning computational diffusion MRI and mathematical methods for brain connectivity, while also sharing new perspectives and insights on the latest research challenges for those currently working in the field. Over the last decade, interest in diffusion MRI has virtually exploded. The technique provides unique insights into the microstructure of living tissue and enables in-vivo connectivity mapping of the brain. Computational techniques are key to the continued success and development of diffusion MRI and to its widespread transfer into the clinic, while new processing methods are essential to addressing issues at each stage of the diffusion MRI pipeline: acquisition, reconstruction, modeling and model fitting, image processing, fiber tracking, connectivity mapping, visualization, group studies and inference. These papers from the 2016 MICCAI Workshop "Computational Diffusion MRI" - which was intended to provide a snapshot of the latest developments within the highly active and growing field of diffusion MR - cover a wide range of topics, from fundamental theoretical work on mathematical modeling, to the development and evaluation of robust algorithms and applications in neuroscientific studies and clinical practice. The contributions include rigorous mathematical derivations, a wealth of rich, full-color visualizations, and biologically or clinically relevant results. As such, they will be of interest to researchers and practitioners in the fields of computer science, MR physics, and applied mathematics.

This volume collects contributions by leading experts in the area of commutative algebra related to the INdAM meeting "Homological and Computational Methods in Commutative Algebra" held in Cortona (Italy) from May 30 to June 3, 2016 . The conference and this volume are dedicated to Winfried Bruns on the occasion of his 70th birthday. In particular, the topics of this book strongly reflect the variety of Winfried Bruns' research interests and his great impact on commutative algebra as well as its applications to related fields. The authors discuss recent and relevant developments in algebraic geometry, commutative algebra, computational algebra, discrete geometry and homological algebra. The book offers a unique resource, both for young and more experienced researchers seeking comprehensive overviews and extensive bibliographic references.

This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7-11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.

This book discusses recent developments and the latest research in algebra and related topics. The book allows aspiring researchers to update their understanding of prime rings, generalized derivations, generalized semiderivations, regular semigroups, completely simple semigroups, module hulls, injective hulls, Baer modules, extending modules, local cohomology modules, orthogonal lattices, Banach algebras, multilinear polynomials, fuzzy ideals, Laurent power series, and Hilbert functions. All the contributing authors are leading international academicians and researchers in their respective fields. Most of the papers were presented at the international conference on Algebra and its Applications (ICAA-2014), held at Aligarh Muslim University, India, from December 15-17, 2014. The book also includes papers from mathematicians who couldn't attend the conference. The conference has emerged as a powerful forum offering researchers a venue to meet and discuss advances in algebra and its applications, inspiring further research directions.

This book gives a detailed survey of the main results on bent functions over finite fields, presents a systematic overview of their generalizations, variations and applications, considers open problems in classification and systematization of bent functions, and discusses proofs of several results. This book uniquely provides a necessary comprehensive coverage of bent functions.It serves as a useful reference for researchers in discrete mathematics, coding and cryptography. Students and professors in mathematics and computer science will also find the content valuable, especially those interested in mathematical foundations of cryptography. It can be used as a supplementary text for university courses on discrete mathematics, Boolean functions, or cryptography, and is appropriate for both basic classes for under-graduate students and advanced courses for specialists in cryptography and mathematics.

This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations. It is intended for beginning graduate students in mathematics or researchers in physics or engineering. As with the introductory book entitled "Harmonic Analysis on Symmetric Spaces - Euclidean Space, the Sphere, and the Poincare Upper Half Plane, the style is informal with an emphasis on motivation, concrete examples, history, and applications. The symmetric spaces considered here are quotients X=G/K, where G is a non-compact real Lie group, such as the general linear group GL(n,P) of all n x n non-singular real matrices, and K=O(n), the maximal compact subgroup of orthogonal matrices. Other examples are Siegel's upper half "plane" and the quaternionic upper half "plane". In the case of the general linear group, one can identify X with the space Pn of n x n positive definite symmetric matrices. Many corrections and updates have been incorporated in this new edition. Updates include discussions of random matrix theory and quantum chaos, as well as recent research on modular forms and their corresponding L-functions in higher rank. Many applications have been added, such as the solution of the heat equation on Pn, the central limit theorem of Donald St. P. Richards for Pn, results on densest lattice packing of spheres in Euclidean space, and GL(n)-analogs of the Weyl law for eigenvalues of the Laplacian in plane domains. Topics featured throughout the text include inversion formulas for Fourier transforms, central limit theorems, fundamental domains in X for discrete groups (such as the modular group GL(n,Z) of n x n matrices with integer entries and determinant +/-1), connections with the problem of finding densest lattice packings of spheres in Euclidean space, automorphic forms, Hecke operators, L-functions, and the Selberg trace formula and its applications in spectral theory as well as number theory.

This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute for Mathematics and its Applications during Fall 2014, when combinatorics was the focus. Leading experts have written surveys of research problems, making state of the art results more conveniently and widely available. The three-part structure of the volume reflects the three workshops held during Fall 2014. In the first part, topics on extremal and probabilistic combinatorics are presented; part two focuses on additive and analytic combinatorics; and part three presents topics in geometric and enumerative combinatorics. This book will be of use to those who research combinatorics directly or apply combinatorial methods to other fields.

This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students, and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the X International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2021). The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, network dynamics; diffusion, epidemics and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks, and technological networks.

This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students, and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the X International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2021). The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, network dynamics; diffusion, epidemics and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks, and technological networks.

This book offers an original and broad exploration of the fundamental methods in Clustering and Combinatorial Data Analysis, presenting new formulations and ideas within this very active field. With extensive introductions, formal and mathematical developments and real case studies, this book provides readers with a deeper understanding of the mutual relationships between these methods, which are clearly expressed with respect to three facets: logical, combinatorial and statistical. Using relational mathematical representation, all types of data structures can be handled in precise and unified ways which the author highlights in three stages: Clustering a set of descriptive attributes Clustering a set of objects or a set of object categories Establishing correspondence between these two dual clusterings Tools for interpreting the reasons of a given cluster or clustering are also included. Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering will be a valuable resource for students and researchers who are interested in the areas of Data Analysis, Clustering, Data Mining and Knowledge Discovery.

Stochastic geometry is the branch of mathematics that studies geometric structures associated with random configurations, such as random graphs, tilings and mosaics. Due to its close ties with stereology and spatial statistics, the results in this area are relevant for a large number of important applications, e.g. to the mathematical modeling and statistical analysis of telecommunication networks, geostatistics and image analysis. In recent years - due mainly to the impetus of the authors and their collaborators - a powerful connection has been established between stochastic geometry and the Malliavin calculus of variations, which is a collection of probabilistic techniques based on the properties of infinite-dimensional differential operators. This has led in particular to the discovery of a large number of new quantitative limit theorems for high-dimensional geometric objects. This unique book presents an organic collection of authoritative surveys written by the principal actors in this rapidly evolving field, offering a rigorous yet lively presentation of its many facets.

This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a workshop in connection with the research project Thales on Algebraic Modeling of Topological and Computational Structures and Applications, held at the National Technical University of Athens, Greece in July 2015. The reader will benefit from the innovative approaches to tackling difficult questions in topology, applications and interrelated research areas, which largely employ algebraic tools.

This book provides an overview of the major changes induced by hydrocarbons (HCs) affecting rocks and surface sediments and their implications for non-seismic exploration methods, particularly for marine territories near Cuba. It examines the use of a digital elevation model (DEM) at 90x90m resolution for the detection of subtle, positive geomorphic anomalies related to hydrocarbon microseepage (vertical migration) on possible oil and gas targets. The results support the conclusion that the DEM data provides a low cost and fast offshore oil and gas preliminary exploration strategy. This data is useful serving to focus prospective areas with supplementary unconventional methods such as magnetic-induced polarization (MIP), useful to propose more expensive volumes for detailed 2D-3D seismic surveys.

Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.

This volume presents recent advances in the field of matrix analysis based on contributions at the MAT-TRIAD 2015 conference. Topics covered include interval linear algebra and computational complexity, Birkhoff polynomial basis, tensors, graphs, linear pencils, K-theory and statistic inference, showing the ubiquity of matrices in different mathematical areas. With a particular focus on matrix and operator theory, statistical models and computation, the International Conference on Matrix Analysis and its Applications 2015, held in Coimbra, Portugal, was the sixth in a series of conferences. Applied and Computational Matrix Analysis will appeal to graduate students and researchers in theoretical and applied mathematics, physics and engineering who are seeking an overview of recent problems and methods in matrix analysis.

This book introduces multidimensional scaling (MDS) and unfolding as data analysis techniques for applied researchers. MDS is used for the analysis of proximity data on a set of objects, representing the data as distances between points in a geometric space (usually of two dimensions). Unfolding is a related method that maps preference data (typically evaluative ratings of different persons on a set of objects) as distances between two sets of points (representing the persons and the objects, resp.). This second edition has been completely revised to reflect new developments and the coverage of unfolding has also been substantially expanded. Intended for applied researchers whose main interests are in using these methods as tools for building substantive theories, it discusses numerous applications (classical and recent), highlights practical issues (such as evaluating model fit), presents ways to enforce theoretical expectations for the scaling solutions, and addresses the typical mistakes that MDS/unfolding users tend to make. Further, it shows how MDS and unfolding can be used in practical research work, primarily by using the smacof package in the R environment but also Proxscal in SPSS. It is a valuable resource for psychologists, social scientists, and market researchers, with a basic understanding of multivariate statistics (such as multiple regression and factor analysis).

The book contains recent developments and contemporary research in mathematical analysis and in its application to problems arising from the biological and physical sciences. The book is of interest to readers who wish to learn of new research in such topics as linear and nonlinear analysis, mathematical biology and ecology, dynamical systems, graph theory, variational analysis and inequalities, functional analysis, differential and difference equations, partial differential equations, approximation theory, and chaos. All papers were prepared by participants at the International Conference on Recent Advances in Mathematical Biology, Analysis and Applications (ICMBAA-2015) held during 4-6 June 2015 in Aligarh, India. A focal theme of the conference was the application of mathematics to the biological sciences and on current research in areas of theoretical mathematical analysis that can be used as sophisticated tools for the study of scientific problems. The conference provided researchers, academicians and engineers with a platform that encouraged them to exchange their innovative ideas in mathematical analysis and its applications as well as to form interdisciplinary collaborations. The content of the book is divided into three parts: Part I contains contributions from participants whose topics are related to nonlinear dynamics and its applications in biological sciences. Part II has contributions which concern topics on nonlinear analysis and its applications to a variety of problems in science, engineering and industry. Part III consists of contributions dealing with some problems in applied analysis.