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 consists of contributions from experts, presenting a fruitful interplay between different approaches to discrete geometry. Most of the chapters were collected at the conference "Geometry and Symmetry" in Veszprem, Hungary from 29 June to 3 July 2015. The conference was dedicated to Karoly Bezdek and Egon Schulte on the occasion of their 60th birthdays, acknowledging their highly regarded contributions in these fields. While the classical problems of discrete geometry have a strong connection to geometric analysis, coding theory, symmetry groups, and number theory, their connection to combinatorics and optimization has become of particular importance. The last decades have seen a revival of interest in discrete geometric structures and their symmetry. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory and geometry, combinatorial group theory, and hyperbolic geometry and topology. This book contains papers on new developments in these areas, including convex and abstract polytopes and their recent generalizations, tiling and packing, zonotopes, isoperimetric inequalities, and on the geometric and combinatorial aspects of linear optimization. The book is a valuable resource for researchers, both junior and senior, in the field of discrete geometry, combinatorics, or discrete optimization. Graduate students find state-of-the-art surveys and an open problem collection.

This volume examines mathematics as a product of the human mind and analyzes the language of "pure mathematics" from various advanced-level sources. Through analysis of the foundational texts of mathematics, it is demonstrated that math is a complex literary creation, containing objects, actors, actions, projection, prediction, planning, explanation, evaluation, roles, image schemas, metonymy, conceptual blending, and, of course, (natural) language. The book follows the narrative of mathematics in a typical order of presentation for a standard university-level algebra course, beginning with analysis of set theory and mappings and continuing along a path of increasing complexity. At each stage, primary concepts, axioms, definitions, and proofs will be examined in an effort to unfold the tell-tale traces of the basic human cognitive patterns of story and conceptual blending. This book will be of interest to mathematicians, teachers of mathematics, cognitive scientists, cognitive linguists, and anyone interested in the engaging question of how mathematics works and why it works so well.

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 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.

This edited volume presents advances in modeling and computational analysis techniques related to networks and online communities. It contains the best papers of notable scientists from the 4th European Network Intelligence Conference (ENIC 2017) that have been peer reviewed and expanded into the present format. The aim of this text is to share knowledge and experience as well as to present recent advances in the field. The book is a nice mix of basic research topics such as data-based centrality measures along with intriguing applied topics, for example, interaction decay patterns in online social communities. This book will appeal to students, professors, and researchers working in the fields of data science, computational social science, and social network analysis.

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.

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.

This book collects the scientific contributions of a group of leading experts who took part in the INdAM Meeting held in Cortona in September 2014. With combinatorial techniques as the central theme, it focuses on recent developments in configuration spaces from various perspectives. It also discusses their applications in areas ranging from representation theory, toric geometry and geometric group theory to applied algebraic topology.

This book is about the interplay of computational commutative algebra and the theory of convex polytopes. It centers around a special class of ideals in a polynomial ring: the class of toric ideals. They are characterized as those prime ideals that are generated by monomial differences or as the defining ideals of toric varieties (not necessarily normal). The interdisciplinary nature of the study of Grobner bases is reflected by the specific applications appearing in this book. These applications lie in the domains of integer programming and computational statistics. The mathematical tools presented in the volume are drawn from commutative algebra, combinatorics, and polyhedral geometry.

This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.

This monograph presents a unified exposition of latin squares and mutually orthogonal sets of latin squares based on groups. Its focus is on orthomorphisms and complete mappings of finite groups, while also offering a complete proof of the Hall-Paige conjecture. The use of latin squares in constructions of nets, affine planes, projective planes, and transversal designs also motivates this inquiry. The text begins by introducing fundamental concepts, like the tests for determining whether a latin square is based on a group, as well as orthomorphisms and complete mappings. From there, it describes the existence problem for complete mappings of groups, building up to the proof of the Hall-Paige conjecture. The third part presents a comprehensive study of orthomorphism graphs of groups, while the last part provides a discussion of Cartesian projective planes, related combinatorial structures, and a list of open problems. Expanding the author's 1992 monograph, Orthomorphism Graphs of Groups, this book is an essential reference tool for mathematics researchers or graduate students tackling latin square problems in combinatorics. Its presentation draws on a basic understanding of finite group theory, finite field theory, linear algebra, and elementary number theory-more advanced theories are introduced in the text as needed.

Learn how to use Thinking Machine Audio Dreams (ThMAD), a realtime audio visualization engine for Ubuntu Linux. This book bridges the gap between programmers and artists. Both artists and developers with an inclination towards arts will profit from this book since it is a combination of a hands-on tutorial, manual, and reference, with many illustrations that accompany the explanations and tutorials. You'll learn the basics of ThMAD's open source software suite and then start experimenting and building your own rendering pipelines to create audio visualizations. You'll see how to soundly use all ThMAD's GUI functionalities, and all modules are provided in a way that will serve both intellectual curiosity and professional needs. The examples that are used as part of the software, and the tutorials included in the book, will serve as a solid basis for your own experiments. What You'll Learn Use the ThMAD software, all GUI functionalities, and all modules Develop your own audio visualization projects Explore the program operations for ThMAD Artiste and ThMAD Player, including all possible options for controlling program operations. Who This Book Is For Visual artists with some IT background, or developers with artistic inclinations. Development experience is not required, but surely helpful.

This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and symbolic dynamics. With its descriptive writing style, this book is highly accessible.

The contributions in this volume aim to deepen understanding of some of the current research problems and theories in modern topics such as calculus of variations, optimization theory, complex analysis, real analysis, differential equations, and geometry. Applications to these areas of mathematics are presented within the broad spectrum of research in Engineering Science with particular emphasis on equilibrium problems, complexity in numerical optimization, dynamical systems, non-smooth optimization, complex network analysis, statistical models and data mining, and energy systems. Additional emphasis is given to interdisciplinary research, although subjects are treated in a unified and self-contained manner. The presentation of methods, theory and applications makes this tribute an invaluable reference for teachers, researchers, and other professionals interested in pure and applied research, philosophy of mathematics, and mathematics education. Some review papers published in this volume will be particularly useful for a broader audience of readers as well as for graduate students who search for the latest information. Constantin Caratheodory's wide-ranging influence in the international mathematical community was seen during the first Fields Medals awards at the International Congress of Mathematicians, Oslo, 1936. Two medals were awarded, one to Lars V. Ahlfors and one to Jesse Douglass. It was Caratheodory who presented both their works during the opening of the International Congress. This volume contains significant papers in Science and Engineering dedicated to the memory of Constantin Caratheodory and the spirit of his mathematical influence.

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 explores two of the most striking features of quantum theory - contextuality and nonlocality - using a formulation based on graph theory. Quantum theory provides a set of rules to predict probabilities of different outcomes in different experimental settings, and both contextuality and nonlocality play a fundamental role in interpreting the outcomes. In this work, the authors highlight how the graph approach can lead to a better understanding of this theory and its applications. After presenting basic definitions and explaining the non-contextuality hypothesis, the book describes contextuality scenarios using compatibility hypergraphs. It then introduces the exclusivity graph approach, which relates a number of important graph-theoretical concepts to contextuality. It also presents open problems such as the so-called Exclusivity Principle, as well as a selection of important topics, like sheaf-theoretical approach, hypergraph approach, and alternative proofs of contextuality.

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 brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks. First, in Chap. 1, the authors introduce the basic preliminaries of hypergraph theory in general, and develop two hypergraph based polynomial algorithms, i.e., hypergraph coloring and hypergraph clustering. Then, in Chaps. 2 and 3, the authors present two emerging applications of hypergraph coloring and hypergraph clustering in Device-to-Device (D2D) underlay communication networks, respectively, in order to show the advantages of hypergraph theory compared with the traditional graph theory. Finally, in Chap. 4, the authors discuss the limitations of using hypergraph theory in future wireless networks and briefly present some other potential applications. This brief introduces the state-of-the-art research on the hypergraph theory and its applications in wireless communications. An efficient framework is provided for the researchers, professionals and advanced level students who are interested in the radio resource allocation in the heterogeneous networks to solve the resource allocation and interference management problems.

This book addresses the emerging body of literature on the study of rare events in random graphs and networks. For example, what does a random graph look like if by chance it has far more triangles than expected? Until recently, probability theory offered no tools to help answer such questions. Important advances have been made in the last few years, employing tools from the newly developed theory of graph limits. This work represents the first book-length treatment of this area, while also exploring the related area of exponential random graphs. All required results from analysis, combinatorics, graph theory and classical large deviations theory are developed from scratch, making the text self-contained and doing away with the need to look up external references. Further, the book is written in a format and style that are accessible for beginning graduate students in mathematics and statistics.

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).

Inspired by classical geometry, geometric group theory has in turn provided a variety of applications to geometry, topology, group theory, number theory and graph theory. This carefully written textbook provides a rigorous introduction to this rapidly evolving field whose methods have proven to be powerful tools in neighbouring fields such as geometric topology. Geometric group theory is the study of finitely generated groups via the geometry of their associated Cayley graphs. It turns out that the essence of the geometry of such groups is captured in the key notion of quasi-isometry, a large-scale version of isometry whose invariants include growth types, curvature conditions, boundary constructions, and amenability. This book covers the foundations of quasi-geometry of groups at an advanced undergraduate level. The subject is illustrated by many elementary examples, outlooks on applications, as well as an extensive collection of exercises.