Gould, Ronald
2012-01-01
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S
Diestel, Reinhard
2017-01-01
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...
Infinite Random Graphs as Statistical Mechanical Models
DEFF Research Database (Denmark)
Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria
2011-01-01
We discuss two examples of infinite random graphs obtained as limits of finite statistical mechanical systems: a model of two-dimensional dis-cretized quantum gravity defined in terms of causal triangulated surfaces, and the Ising model on generic random trees. For the former model we describe a ...
Kuramoto model for infinite graphs with kernels
Canale, Eduardo
2015-01-07
In this paper we study the Kuramoto model of weakly coupled oscillators for the case of non trivial network with large number of nodes. We approximate of such configurations by a McKean-Vlasov stochastic differential equation based on infinite graph. We focus on circulant graphs which have enough symmetries to make the computations easier. We then focus on the asymptotic regime where an integro-partial differential equation is derived. Numerical analysis and convergence proofs of the Fokker-Planck-Kolmogorov equation are conducted. Finally, we provide numerical examples that illustrate the convergence of our method.
Infinitely connected subgraphs in graphs of uncountable chromatic number
DEFF Research Database (Denmark)
Thomassen, Carsten
2016-01-01
Erdős and Hajnal conjectured in 1966 that every graph of uncountable chromatic number contains a subgraph of infinite connectivity. We prove that every graph of uncountable chromatic number has a subgraph which has uncountable chromatic number and infinite edge-connectivity. We also prove that......, if each orientation of a graph G has a vertex of infinite outdegree, then G contains an uncountable subgraph of infinite edge-connectivity....
Orientations of infinite graphs with prescribed edge-connectivity
DEFF Research Database (Denmark)
Thomassen, Carsten
2016-01-01
We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex...... set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity). Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989....
Chartrand, Gary; Rosen, Kenneth H
2008-01-01
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...
Cycles through all finite vertex sets in infinite graphs
DEFF Research Database (Denmark)
Kundgen, Andre; Li, Binlong; Thomassen, Carsten
2017-01-01
is contained in a cycle of G. We apply this to extend a number of results and conjectures on finite graphs to Hamiltonian curves in infinite locally finite graphs. For example, Barnette’s conjecture (that every finite planar cubic 3-connected bipartite graph is Hamiltonian) is equivalent to the statement...
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
Directory of Open Access Journals (Sweden)
Naohi Eguchi
2015-05-01
Full Text Available The general form of safe recursion (or ramified recurrence can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Martini and Zorzi, in which the size of every normal form by innermost rewriting is polynomially bounded. Every unfolding graph rewrite rule is precedence terminating in the sense of Middeldorp, Ohsaki and Zantema. Although precedence terminating infinite rewrite systems cover all the primitive recursive functions, in this paper we consider graph rewrite systems precedence terminating with argument separation, which form a subclass of precedence terminating graph rewrite systems. We show that for any precedence terminating infinite graph rewrite system G with a specific argument separation, both the runtime complexity of G and the size of every normal form in G can be polynomially bounded. As a corollary, we obtain an alternative proof of the original result by Dal Lago et al.
Towards a theory of geometric graphs
Pach, Janos
2004-01-01
The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...
Chartrand, Gary
1984-01-01
Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap
Kuramoto model for infinite graphs with kernels
Canale, Eduardo; Tembine, Hamidou; Tempone, Raul; Zouraris, Georgios E.
2015-01-01
. We focus on circulant graphs which have enough symmetries to make the computations easier. We then focus on the asymptotic regime where an integro-partial differential equation is derived. Numerical analysis and convergence proofs of the Fokker
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
Directory of Open Access Journals (Sweden)
R. El-Shanawany
2017-12-01
Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.
Bollobas, Bela
2004-01-01
The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A
Joyner, W David
2017-01-01
This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...
Bollobás, Béla
1998-01-01
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...
Wilson, Robin J
1985-01-01
Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.
Trudeau, Richard J
1994-01-01
Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or
Harary, Frank
2015-01-01
Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc
Quantitative graph theory mathematical foundations and applications
Dehmer, Matthias
2014-01-01
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat
An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
Zhan, Hanmeng
2017-01-01
We study perfect state transfer in a discrete quantum walk. In particular, we show that there are infinitely many $4$-regular circulant graphs that admit perfect state transfer between antipodal vertices. To the best of our knowledge, previously there was no infinite family of $k$-regular graphs with perfect state transfer, for any $k\\ge 3$.
Gauge theories of infinite dimensional Hamiltonian superalgebras
International Nuclear Information System (INIS)
Sezgin, E.
1989-05-01
Symplectic diffeomorphisms of a class of supermanifolds and the associated infinite dimensional Hamiltonian superalgebras, H(2M,N) are discussed. Applications to strings, membranes and higher spin field theories are considered: The embedding of the Ramond superconformal algebra in H(2,1) is obtained. The Chern-Simons gauge theory of symplectic super-diffeomorphisms is constructed. (author). 29 refs
Graph theory and its applications
Gross, Jonathan L
2006-01-01
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Topics in graph theory graphs and their Cartesian product
Imrich, Wilfried; Rall, Douglas F
2008-01-01
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.
Planar graphs theory and algorithms
Nishizeki, T
1988-01-01
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
Introduction to the theory of infinite systems. Theory and practices
Fedorov, Foma M.
2017-11-01
A review of the author's work is given, which formed the basis for a new theory of general infinite systems. The Gaussian elimination and Cramer's rule have been extended to infinite systems. A special particular solution is obtained, it is called a strictly particular solution. Necessary and sufficient conditions for existence of the nontrivial solutions of homogeneous systems are given.
The fascinating world of graph theory
Benjamin, Arthur; Zhang, Ping
2015-01-01
Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin
Graph Theory. 1. Fragmentation of Structural Graphs
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.
Three Syntactic Theories for Combinatory Graph Reduction
DEFF Research Database (Denmark)
Danvy, Olivier; Zerny, Ian
2011-01-01
in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...
Three Syntactic Theories for Combinatory Graph Reduction
DEFF Research Database (Denmark)
Danvy, Olivier; Zerny, Ian
2013-01-01
, as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...
An infinite-dimensional weak KAM theory via random variables
Gomes, Diogo A.; Nurbekyan, Levon
2016-01-01
We develop several aspects of the infinite-dimensional Weak KAM theory using a random variables' approach. We prove that the infinite-dimensional cell problem admits a viscosity solution that is a fixed point of the Lax-Oleinik semigroup. Furthermore, we show the existence of invariant minimizing measures and calibrated curves defined on R.
An infinite-dimensional weak KAM theory via random variables
Gomes, Diogo A.
2016-08-31
We develop several aspects of the infinite-dimensional Weak KAM theory using a random variables\\' approach. We prove that the infinite-dimensional cell problem admits a viscosity solution that is a fixed point of the Lax-Oleinik semigroup. Furthermore, we show the existence of invariant minimizing measures and calibrated curves defined on R.
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity
DEFF Research Database (Denmark)
Ok, Seongmin; Richter, R. Bruce; Thomassen, Carsten
2016-01-01
Let G be a graph and let s be a vertex of G. We consider the structure of the set of all lifts of two edges incident with s that preserve edge-connectivity. Mader proved that two mild hypotheses imply there is at least one pair that lifts, while Frank showed (with the same hypotheses......) that there are at least (deg(s) - 1)/2 disjoint pairs that lift. We consider the lifting graph: its vertices are the edges incident with s, two being adjacent if they form a liftable pair. We have three main results, the first two with the same hypotheses as for Mader’s Theorem. (i)Let F be a subset of the edges incident...... with s. We show that F is independent in the lifting graph of G if and only if there is a single edge-cut C in G of size at most r + 1 containing all the edges in F, where r is the maximum number of edge-disjoint paths from a vertex (not s) in one component of G - C to a vertex (not s) in another...
A first course in graph theory
Chartrand, Gary
2012-01-01
This comprehensive text offers undergraduates a remarkably student-friendly introduction to graph theory. Written by two of the field's most prominent experts, it takes an engaging approach that emphasizes graph theory's history. Unique examples and lucid proofs provide a sound yet accessible treatment that stimulates interest in an evolving subject and its many applications.Optional sections designated as ""excursion"" and ""exploration"" present interesting sidelights of graph theory and touch upon topics that allow students the opportunity to experiment and use their imaginations. Three app
Infinite graphs in systematic biology, with an application to the species problem.
Alexander, Samuel A
2013-06-01
We argue that C. Darwin and more recently W. Hennig worked at times under the simplifying assumption of an eternal biosphere. So motivated, we explicitly consider the consequences which follow mathematically from this assumption, and the infinite graphs it leads to. This assumption admits certain clusters of organisms which have some ideal theoretical properties of species, shining some light onto the species problem. We prove a dualization of a law of T. A. Knight and C. Darwin, and sketch a decomposition result involving the internodons of D. Kornet, J. Metz and H. Schellinx. A further goal of this paper is to respond to B. Sturmfels' question, "Can biology lead to new theorems?"
Graph theory and the Virasoro master equation
International Nuclear Information System (INIS)
Obers, N.A.J.
1991-01-01
A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equation is given. By studying ansaetze of the master equation, the author obtains exact solutions and gains insight in the structure of large slices of affine-Virasoro space. He finds an isomorphism between the constructions in the ansatz SO(n) diag , which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabeled graphs of order n. On the one hand, the conformal constructions, are classified by the graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graph of graph theory. He also defines a class of magic Lie group bases in which the Virasoro master equation admits a simple metric ansatz {g metric }, whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g metric is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n) diag in the Cartesian basis of SO(n), and the ansatz SU(n) metric in the Pauli-like basis of SU(n). Finally, he defines the 'sine-area graphs' of SU(n), which label the conformal field theories of SU(n) metric , and he notes that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g metric
Quantum field theory with infinite component local fields as an alternative to the string theories
International Nuclear Information System (INIS)
Krasnikov, N.V.
1987-05-01
We show that the introduction of the infinite component local fields with higher order derivatives in the interaction makes the theory completely ultraviolet finite. For the γ 5 -anomalous theories the introduction of the infinite component field makes the theory renormalizable or superrenormalizable. (orig.)
Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees
Austin, Tim; Podder, Moumanti
2018-03-01
Consider a statistical physical model on the d-regular infinite tree Td described by a set of interactions Φ . Let Gn be a sequence of finite graphs with vertex sets V_n that locally converge to Td. From Φ one can construct a sequence of corresponding models on the graphs G_n. Let μ_n be the resulting Gibbs measures. Here we assume that μ n converges to some limiting Gibbs measure μ on Td in the local weak^* sense, and study the consequences of this convergence for the specific entropies |V_n|^{-1}H(μ _n). We show that the limit supremum of |V_n|^{-1}H(μ _n) is bounded above by the percolative entropy H_{it{perc}}(μ ), a function of μ itself, and that |V_n|^{-1}H(μ _n) actually converges to H_{it{perc}}(μ ) in case Φ exhibits strong spatial mixing on T_d. When it is known to exist, the limit of |V_n|^{-1}H(μ _n) is most commonly shown to be given by the Bethe ansatz. Percolative entropy gives a different formula, and we do not know how to connect it to the Bethe ansatz directly. We discuss a few examples of well-known models for which the latter result holds in the high temperature regime.
An infinite-dimensional calculus for gauge theories
Mendes, Rui Vilela
2010-01-01
A space for gauge theories is defined, using projective limits as subsets of Cartesian products of homomorphisms from a lattice on the structure group. In this space, non-interacting and interacting measures are defined as well as functions and operators. From projective limits of test functions and distributions on products of compact groups, a projective gauge triplet is obtained, which provides a framework for the infinite-dimensional calculus in gauge theories. The gauge measure behavior ...
Graph Theory to Pure Mathematics: Some Illustrative Examples
Indian Academy of Sciences (India)
Graph Theory to Pure Mathematics: Some. Illustrative Examples v Yegnanarayanan is a. Professor of Mathematics at MNM Jain Engineering. College, Chennai. His research interests include graph theory and its applications to both pure maths and theoretical computer science. Keywords. Graph theory, matching theory,.
Algebraic Graph Theory Morphisms, Monoids and Matrices
Knauer, Ulrich
2011-01-01
This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures -like roads, computers, telephones -instances of abstract data structures -likelists, stacks, trees -and functional or object orient
Graphs on Surfaces and the Partition Function of String Theory
Garcia-Islas, J. Manuel
2007-01-01
Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the relation between graph theory and the mathematical physics of discrete string theory. In this description we present problems of the combinatorial world of real importance for graph theorists. The mathematical details of the paper are as follows: There is a com...
Root Structures of Infinite Gauge Groups and Supersymmetric Field Theories
International Nuclear Information System (INIS)
Catto, Sultan; Gürcan, Yasemin; Khalfan, Amish; Kurt, Levent
2013-01-01
We show the relationship between critical dimensions of supersymmetric fundamental theories and dimensions of certain Jordan algebras. In our approach position vectors in spacetime or in superspace are endowed with algebraic properties that are present only in those critical dimensions. A uniform construction of super Poincaré groups in these dimensions will be shown. Some applications of these algebraic methods to hidden symmetries present in the covariant and interacting string Lagrangians and to superparticle will be discussed. Algebraic methods we develop will be shown to generate the root structure of some infinite groups that play the role of gauge groups in a second quantized theory of strings
Graph Theory. 2. Vertex Descriptors and Graph Coloring
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.
Spectral theory of infinite-area hyperbolic surfaces
Borthwick, David
2016-01-01
This text introduces geometric spectral theory in the context of infinite-area Riemann surfaces, providing a comprehensive account of the most recent developments in the field. For the second edition the context has been extended to general surfaces with hyperbolic ends, which provides a natural setting for development of the spectral theory while still keeping technical difficulties to a minimum. All of the material from the first edition is included and updated, and new sections have been added. Topics covered include an introduction to the geometry of hyperbolic surfaces, analysis of the resolvent of the Laplacian, scattering theory, resonances and scattering poles, the Selberg zeta function, the Poisson formula, distribution of resonances, the inverse scattering problem, Patterson-Sullivan theory, and the dynamical approach to the zeta function. The new sections cover the latest developments in the field, including the spectral gap, resonance asymptotics near the critical line, and sharp geometric constan...
International Nuclear Information System (INIS)
De Santis, Emilio; Marinelli, Carlo
2007-01-01
We introduce and study a class of infinite-horizon non-zero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove 'fixation', i.e. players will adopt a constant strategy after a finite time. The resulting dynamics is related to zero-temperature Glauber dynamics on random graphs of possibly infinite volume
Review of the theory of infinite nuclear matter
International Nuclear Information System (INIS)
Llano, M. de; Tolmachev, V.V.
1975-01-01
Given a two-body force, there seems to be two distinct starting points in the many-body perturbation-theoretic problem of computing the energy per nucleon of infinite (as well as finite) nuclear matter: ordinary Hartree-Fock theory and the Brueckner theory. The former theory, treated almost exclusively with plane-wave solutions, has long-ago fallen into disuse, to yield to the latter, apparently more sophisticated, theory. After a brief outline of many-fermion diagramatic techniques, the Brueckner-Bethe-Goldstone series expansion in terms of the density is discussed as a low density, non-ideal Fermi gas theory, whose convergence is analyzed. A calculation based on particle-hole Green's function techniques shows that a nucleon gas condenses to the liquid phase at about 3% of the empirical nuclear matter saturation density. The analogy between the BBG expansion and the virial expansion for a classical or quantum gas is studied with special emphasis on the apparent impossibility of analytical-continuing the latter gas theory to densities in the liquid regime, as first elucidated by Lee and Yang. It is finally argued that ordinary HF theory may provide a good starting point for the eventual understanding of nuclear matter as it gives (in the finite nuclear problem, at any rate) not only the basic liquid properties of a definite density and a surface but also provides independent-particle aspects, avoiding at the same time the idea of n-body clusters appropriate only for dilute gases. This program has to date not been carried out for infinite nuclear matter, mainly because of insufficient knowledge regarding low-energy, non-plane-wave solutions of the HF equations, in the thermodynamic limit [pt
New infinite-dimensional hidden symmetries for heterotic string theory
International Nuclear Information System (INIS)
Gao Yajun
2007-01-01
The symmetry structures of two-dimensional heterotic string theory are studied further. A (2d+n)x(2d+n) matrix complex H-potential is constructed and the field equations are extended into a complex matrix formulation. A pair of Hauser-Ernst-type linear systems are established. Based on these linear systems, explicit formulations of new hidden symmetry transformations for the considered theory are given and then these symmetry transformations are verified to constitute infinite-dimensional Lie algebras: the semidirect product of the Kac-Moody o(d,d+n-circumflex) and Virasoro algebras (without center charges). These results demonstrate that the heterotic string theory under consideration possesses more and richer symmetry structures than previously expected
Some Results on the Graph Theory for Complex Neutrosophic Sets
Directory of Open Access Journals (Sweden)
Shio Gai Quek
2018-05-01
Full Text Available Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graphs called complex neutrosophic graphs of type 1 (abbr. CNG1. We then present a matrix representation for it and study some properties of this new concept. The concept of CNG1 is an extension of the generalized fuzzy graphs of type 1 (GFG1 and generalized single-valued neutrosophic graphs of type 1 (GSVNG1. The utility of the CNG1 introduced here are applied to a multi-attribute decision making problem related to Internet server selection.
Graph Theory Approach for Studying Food Webs
Longjas, A.; Tejedor, A.; Foufoula-Georgiou, E.
2017-12-01
Food webs are complex networks of feeding interactions among species in ecological communities. Metrics describing food web structure have been proposed to compare and classify food webs ranging from food chain length, connectance, degree distribution, centrality measures, to the presence of motifs (distinct compartments), among others. However, formal methodologies for studying both food web topology and the dynamic processes operating on them are still lacking. Here, we utilize a quantitative framework using graph theory within which a food web is represented by a directed graph, i.e., a collection of vertices (species or trophic species defined as sets of species sharing the same predators and prey) and directed edges (predation links). This framework allows us to identify apex (environmental "source" node) to outlet (top predators) subnetworks and compute the steady-state flux (e.g., carbon, nutrients, energy etc.) in the food web. We use this framework to (1) construct vulnerability maps that quantify the relative change of flux delivery to the top predators in response to perturbations in prey species (2) identify keystone species, whose loss would precipitate further species extinction, and (3) introduce a suite of graph-theoretic metrics to quantify the topologic (imposed by food web connectivity) and dynamic (dictated by the flux partitioning and distribution) components of a food web's complexity. By projecting food webs into a 2D Topodynamic Complexity Space whose coordinates are given by Number of alternative paths (topologic) and Leakage Index (dynamic), we show that this space provides a basis for food web comparison and provide physical insights into their dynamic behavior.
Molecular orbital calculations using chemical graph theory
Dias, Jerry Ray
1993-01-01
Professor John D. Roberts published a highly readable book on Molecular Orbital Calculations directed toward chemists in 1962. That timely book is the model for this book. The audience this book is directed toward are senior undergraduate and beginning graduate students as well as practicing bench chemists who have a desire to develop conceptual tools for understanding chemical phenomena. Although, ab initio and more advanced semi-empirical MO methods are regarded as being more reliable than HMO in an absolute sense, there is good evidence that HMO provides reliable relative answers particularly when comparing related molecular species. Thus, HMO can be used to rationalize electronic structure in 1t-systems, aromaticity, and the shape use HMO to gain insight of simple molecular orbitals. Experimentalists still into subtle electronic interactions for interpretation of UV and photoelectron spectra. Herein, it will be shown that one can use graph theory to streamline their HMO computational efforts and to arrive...
Quantum field theory with infinite component local fields as an alternative to the string theories
Krasnikov, N. V.
1987-09-01
We show that the introduction of the infinite component local fields with higher-order derivatives in the interaction makes the theory completely ultraviolet finite. For the γ5-anomalous theories the introduction of the infinite component field makes the theory renormalizable or even superrenormalizable. I am indebted to J. Ambjōrn, P. Di Vecchia, H.B. Nielsen and L. Rozhansky for useful discussions. It is a pleasure to thank the Niels Bohr Institute (Copenhagen) where this work was completed for kind hospitality.
On some interconnections between combinatorial optimization and extremal graph theory
Directory of Open Access Journals (Sweden)
Cvetković Dragoš M.
2004-01-01
Full Text Available The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.
Resolvent expansion for the Schrödinger operator on a graph with infinite rays
DEFF Research Database (Denmark)
Ito, Kenichi; Jensen, Arne
2018-01-01
We consider the Schrödinger operator on a combinatorial graph consisting of a finite graph and a finite number of discrete half-lines, all jointed together, and compute an asymptotic expansion of its resolvent around the threshold 0. Precise expressions are obtained for the first few coefficients...
Graph theory for alternating hydrocarbons with attached ports
Hesselink, Wim H.
Properties of molecules of certain hydrocarbons give rise to difficult questions in graph theory. This paper is primarily devoted to the graph theory, but the physico-chemical motivation, which is somewhat speculative, is also presented. Molecules of unsaturated hydrocarbons exhibit alternating
Graph Theory in Paris : Conference in Memory of Claude Berge
Fonlupt, Jean; Fouquet, Jean-Luc; Fournier, Jean-Claude; Alfonsín, Jorge
2007-01-01
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics, such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics from many of the participants.
The $K$-theory of real graph $C*$-algebras
Boersema, Jeffrey L.
2014-01-01
In this paper, we will introduce real graph algebras and develop the theory to the point of being able to calculate the $K$-theory of such algebras. The $K$-theory situation is significantly more complicated than in the case for complex graph algebras. To develop the long exact sequence to compute the $K$-theory of a real graph algebra, we need to develop a generalized theory of crossed products for real C*-algebras for groups with involution. We also need to deal with the additional algebrai...
A first course in graph theory and combinatorics
Cioabă, Sebastian M
2009-01-01
The concept of a graph is fundamental in mathematics since it conveniently encodes diverse relations and facilitates combinatorial analysis of many complicated counting problems. In this book, the authors have traced the origins of graph theory from its humble beginnings of recreational mathematics to its modern setting for modeling communication networks as is evidenced by the World Wide Web graph used by many Internet search engines. This book is an introduction to graph theory and combinatorial analysis. It is based on courses given by the second author at Queen's University at Kingston, Ontario, Canada between 2002 and 2008. The courses were aimed at students in their final year of their undergraduate program.
Efficient Algorithmic Frameworks via Structural Graph Theory
2016-10-28
constant. For example, they measured that, on large samples of the entire network, the Amazon graph has average degree 17.7, the Facebook graph has average...department heads’ opinions of departments, and generally lack transparency and well-defined measures . On the other hand, the National Research Council (the...Efficient and practical resource block allocation for LTE -based D2D network via graph coloring. Wireless Networks 20(4): 611-624 (2014) 50. Hossein
A simple extrapolation of thermodynamic perturbation theory to infinite order
International Nuclear Information System (INIS)
Ghobadi, Ahmadreza F.; Elliott, J. Richard
2015-01-01
Recent analyses of the third and fourth order perturbation contributions to the equations of state for square well spheres and Lennard-Jones chains show trends that persist across orders and molecular models. In particular, the ratio between orders (e.g., A 3 /A 2 , where A i is the ith order perturbation contribution) exhibits a peak when plotted with respect to density. The trend resembles a Gaussian curve with the peak near the critical density. This observation can form the basis for a simple recursion and extrapolation from the highest available order to infinite order. The resulting extrapolation is analytic and therefore cannot fully characterize the critical region, but it remarkably improves accuracy, especially for the binodal curve. Whereas a second order theory is typically accurate for the binodal at temperatures within 90% of the critical temperature, the extrapolated result is accurate to within 99% of the critical temperature. In addition to square well spheres and Lennard-Jones chains, we demonstrate how the method can be applied semi-empirically to the Perturbed Chain - Statistical Associating Fluid Theory (PC-SAFT)
Using graph theory for automated electric circuit solving
International Nuclear Information System (INIS)
Toscano, L; Stella, S; Milotti, E
2015-01-01
Graph theory plays many important roles in modern physics and in many different contexts, spanning diverse topics such as the description of scale-free networks and the structure of the universe as a complex directed graph in causal set theory. Graph theory is also ideally suited to describe many concepts in computer science. Therefore it is increasingly important for physics students to master the basic concepts of graph theory. Here we describe a student project where we develop a computational approach to electric circuit solving which is based on graph theoretic concepts. This highly multidisciplinary approach combines abstract mathematics, linear algebra, the physics of circuits, and computer programming to reach the ambitious goal of implementing automated circuit solving. (paper)
High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs
Kempton, Mark
This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.
Graph-based linear scaling electronic structure theory
Energy Technology Data Exchange (ETDEWEB)
Niklasson, Anders M. N., E-mail: amn@lanl.gov; Negre, Christian F. A.; Cawkwell, Marc J.; Swart, Pieter J.; Germann, Timothy C.; Bock, Nicolas [Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Mniszewski, Susan M.; Mohd-Yusof, Jamal; Wall, Michael E.; Djidjev, Hristo [Computer, Computational, and Statistical Sciences Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Rubensson, Emanuel H. [Division of Scientific Computing, Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala (Sweden)
2016-06-21
We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.
Fractional graph theory a rational approach to the theory of graphs
Scheinerman, Edward R
2013-01-01
A unified treatment of the most important results in the study of fractional graph concepts, this volume explores the various ways in which integer-valued concepts can be modified to derive nonintegral values. It begins with the general fractional theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics. Subjects include fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, and fractional isomorphism. The final chapter examines additional topics such as fractional domination, fractional intersection numbers
Applying Graph Theory to Problems in Air Traffic Management
Farrahi, Amir H.; Goldberg, Alan T.; Bagasol, Leonard N.; Jung, Jaewoo
2017-01-01
Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.
Solved and unsolved problems of chemical graph theory
International Nuclear Information System (INIS)
Trinajstic, N.; Klein, D.J.; Randic, M.
1986-01-01
The development of several novel graph theoretical concepts and their applications in different branches of chemistry are reviewed. After a few introductory remarks they follow with an outline of selected important graph theoretical invariants, introducing some new results and indicating some open problems. They continue with discussing the problem of graph characterization and construction of graphs of chemical interest, with a particular emphasis on large systems. Finally they consider various problems and difficulties associated with special subgraphs, including subgraphs representing Kekule valence structures. The paper ends with a brief review of structure-property and structure-activity correlations, the topic which is one of prime motivations for application of graph theory to chemistry
Quantifying Riverscape Connectivity with Graph Theory
Carbonneau, P.; Milledge, D.; Sinha, R.; Tandon, S. K.
2013-12-01
Fluvial catchments convey fluxes of water, sediment, nutrients and aquatic biota. At continental scales, crustal topography defines the overall path of channels whilst at local scales depositional and/or erosional features generally determine the exact path of a channel. Furthermore, constructions such as dams, for either water abstraction or hydropower, often have a significant impact on channel networks.The concept of ';connectivity' is commonly invoked when conceptualising the structure of a river network.This concept is easy to grasp but there have been uneven efforts across the environmental sciences to actually quantify connectivity. Currently there have only been a few studies reporting quantitative indices of connectivity in river sciences, notably, in the study of avulsion processes. However, the majority of current work describing some form of environmental connectivity in a quantitative manner is in the field of landscape ecology. Driven by the need to quantify habitat fragmentation, landscape ecologists have returned to graph theory. Within this formal setting, landscape ecologists have successfully developed a range of indices which can model connectivity loss. Such formal connectivity metrics are currently needed for a range of applications in fluvial sciences. One of the most urgent needs relates to dam construction. In the developed world, hydropower development has generally slowed and in many countries, dams are actually being removed. However, this is not the case in the developing world where hydropower is seen as a key element to low-emissions power-security. For example, several dam projects are envisaged in Himalayan catchments in the next 2 decades. This region is already under severe pressure from climate change and urbanisation, and a better understanding of the network fragmentation which can be expected in this system is urgently needed. In this paper, we apply and adapt connectivity metrics from landscape ecology. We then examine the
Equity trees and graphs via information theory
Harré, M.; Bossomaier, T.
2010-01-01
We investigate the similarities and differences between two measures of the relationship between equities traded in financial markets. Our measures are the correlation coefficients and the mutual information. In the context of financial markets correlation coefficients are well established whereas mutual information has not previously been as well studied despite its theoretically appealing properties. We show that asset trees which are derived from either the correlation coefficients or the mutual information have a mixture of both similarities and differences at the individual equity level and at the macroscopic level. We then extend our consideration from trees to graphs using the "genus 0" condition recently introduced in order to study the networks of equities.
Embedded graph invariants in Chern-Simons theory
International Nuclear Information System (INIS)
Major, Seth A.
1999-01-01
Chern-Simons gauge theory, since its inception as a topological quantum field theory, has proved to be a rich source of understanding for knot invariants. In this work the theory is used to explore the definition of the expectation value of a network of Wilson lines -- an embedded graph invariant. Using a generalization of the variational method, lowest-order results for invariants for graphs of arbitrary valence and general vertex tangent space structure are derived. Gauge invariant operators are introduced. Higher order results are found. The method used here provides a Vassiliev-type definition of graph invariants which depend on both the embedding of the graph and the group structure of the gauge theory. It is found that one need not frame individual vertices. However, without a global projection of the graph there is an ambiguity in the relation of the decomposition of distinct vertices. It is suggested that framing may be seen as arising from this ambiguity -- as a way of relating frames at distinct vertices
Nambu, Y.
1967-01-01
The main ingredients of the method of infinite multiplets consist of: 1) the use of wave functions with an infinite number of components for describing an infinite tower of discrete states of an isolated system (such as an atom, a nucleus, or a hadron), 2) the use of group theory, instead of dynamical considerations, in determining the properties of the wave functions.
BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.
Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter
2013-02-01
Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of
Modeling of tethered satellite formations using graph theory
DEFF Research Database (Denmark)
Larsen, Martin Birkelund; Smith, Roy S; Blanke, Mogens
2011-01-01
satellite formation and proposes a method to deduce the equations of motion for the attitude dynamics of the formation in a compact form. The use of graph theory and Lagrange mechanics together allows a broad class of formations to be described using the same framework. A method is stated for finding...
Infinite dimensional gauge structure of Kaluza-Klein theories II: D>5
International Nuclear Information System (INIS)
Aulakh, C.S.; Sahdev, D.
1985-12-01
We carry out the dimensional reduction of the pure gravity sector of Kaluza Klein theories without making truncations of any sort. This generalizes our previous result for the 5-dimensional case to 4+d(>1) dimensions. The effective 4-dimensional action has the structure of an infinite dimensional gauge theory
Vertex maps on graphs -- Perron-Frobenius Theory
Bernhardt, Chris
2015-01-01
The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of periodic orbits, about the concepts of transitivity and topological mixing, and about horseshoes and topological entropy. This is a preprint. The final version will appear in the Journal of Difference Equations and Applications.
Infinitely many inequivalent field theories from one Lagrangian
100__; Mavromatos, Nick E.; Sarkar, Sarben
2014-01-01
Logarithmic time-like Liouville quantum field theory has a generalized PT invariance, where T is the time-reversal operator and P stands for an S-duality reflection of the Liouville field $\\phi$. In Euclidean space the Lagrangian of such a theory, $L=\\frac{1}{2}(\
Simulating activation propagation in social networks using the graph theory
Directory of Open Access Journals (Sweden)
František Dařena
2010-01-01
Full Text Available The social-network formation and analysis is nowadays one of objects that are in a focus of intensive research. The objective of the paper is to suggest the perspective of representing social networks as graphs, with the application of the graph theory to problems connected with studying the network-like structures and to study spreading activation algorithm for reasons of analyzing these structures. The paper presents the process of modeling multidimensional networks by means of directed graphs with several characteristics. The paper also demonstrates using Spreading Activation algorithm as a good method for analyzing multidimensional network with the main focus on recommender systems. The experiments showed that the choice of parameters of the algorithm is crucial, that some kind of constraint should be included and that the algorithm is able to provide a stable environment for simulations with networks.
Czech Academy of Sciences Publication Activity Database
Kostenko, A. S.; Malamud, M. M.; Neidhardt, H.; Exner, Pavel
2017-01-01
Roč. 95, č. 1 (2017), s. 31-36 ISSN 1064-5624 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : boundary value problems * Schrodinger operators Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 0.472, year: 2016
Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions
Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng
2018-04-01
In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute
Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions.
Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng
2018-04-20
In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute
Utilization of graph theory in security analysis of power grid
Directory of Open Access Journals (Sweden)
Dalibor Válek
2014-12-01
Full Text Available This paper describes way how to use graph theory in security analysis. As an environment is used network of power lines and devices which are included here. Power grid is considered as a system of nodes which make together graph (network. On the simple example is applied Fiedler´s theory which is able to select the most important power lines of whole network. Components related to these lines are logicly ordered and considered by author´s modified analysis. This method has been improved and optimalized for risks related with illegal acts. Each power grid component has been connected with possible kind of attack and every of this device was gradually evaluated by five coefficients which takes values from 1 to 10. On the coefficient basis was assessed the level of risk. In the last phase the most risky power grid components have been selected. On the selected devices have been proposed security measures.
Spectral fluctuations of quantum graphs
International Nuclear Information System (INIS)
Pluhař, Z.; Weidenmüller, H. A.
2014-01-01
We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry
Graph theory and binary alloys passivated by nickel
International Nuclear Information System (INIS)
McCafferty, E.
2005-01-01
The passivity of a nickel binary alloy is considered in terms of a network of -Ni-O-Ni- bridges in the oxide film, where Ni is the component of the binary alloy which produces passivity. The structure of the oxide is represented by a mathematical graph, and graph theory is used to calculate the connectivity of the oxide, given by the product of the number of edges in the graph and the Randic index. A stochastic calculation is employed to insert ions of the second metal into the oxide film so as to disrupt the connectivity of the -Ni-O-Ni- network. This disruption occurs at a critical ionic concentration of the oxide film. Mathematical relationships are developed for the introduction of a general ion B +n into the oxide film, and critical ionic compositions are calculated for oxide films on the nickel binary alloys. The notation B refers to any metal B which produces B +n ions in the oxide film, where +n is the oxidation number of the ion. The results of this analysis for Fe-Ni and Cu-Ni binary alloys are in good agreement with experimental results
Graph Theory Roots of Spatial Operators for Kinematics and Dynamics
Jain, Abhinandan
2011-01-01
Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component
Graph theory favorite conjectures and open problems 1
Hedetniemi, Stephen; Larson, Craig
2016-01-01
This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors’ favorite conjectures and open problems, enhancing the reader’s overall comprehension and enthusiasm. The editors were inspired to create these volumes by the popular and well attended special sessions, entitled “My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In...
Recent developments in chiral gauge theories: approach of infinitely many fermi fields
International Nuclear Information System (INIS)
Narayanan, R.
1994-01-01
I present the recent developments in a specific sub-field of chiral gauge theories on the lattice. This subfield pertains to the use of infinitely many fermi fields to describe a single chiral field. In this approach, both anomalous and anomaly free theories can be discussed in equal footing. It produces the correct anomaly in the continuum limit. It has the potential to describe fermion number violating processes in the presence of a gauge field background with non-trivial topological charge on a finite lattice. (orig.)
GCPSO in cooperation with graph theory to distribution network reconfiguration for energy saving
International Nuclear Information System (INIS)
Assadian, Mehdi; Farsangi, Malihe M.; Nezamabadi-pour, Hossein
2010-01-01
Network reconfiguration for loss reduction in distribution system is an important way to save energy. This paper investigates the ability of guaranteed convergence particle swarm optimization (GCPSO) and particle swarm optimization (PSO) in cooperation with graph theory for network reconfiguration to reduce the power loss and enhancement of voltage profile of distribution systems. Numerical results of three distribution systems are presented which illustrate the feasibility of the proposed method by GCPSO and PSO using the graph theory. To validate the obtained results, genetic algorithm (GA) using graph theory is also applied and is compared with the proposed GCPSO and PSO using graph theory.
International Nuclear Information System (INIS)
Elcoro, Luis; Etxebarria, Jesus
2011-01-01
The requirement of rotational invariance for lattice potential energies is investigated. Starting from this condition, it is shown that the Cauchy relations for the elastic constants are fulfilled if the lattice potential is built from pair interactions or when the first-neighbour approximation is adopted. This is seldom recognized in widely used solid-state textbooks. Frequently, pair interaction is even considered to be the most general situation. In addition, it is shown that the demand of rotational invariance in an infinite crystal leads to inconsistencies in the symmetry of the elastic tensor. However, for finite crystals, no problems arise, and the Huang conditions are deduced using exclusively a microscopic approach for the elasticity theory, without making any reference to macroscopic parameters. This work may be useful in both undergraduate and graduate level courses to point out the crudeness of the pair-potential interaction and to explore the limits of the infinite-crystal approximation.
Poor textural image tie point matching via graph theory
Yuan, Xiuxiao; Chen, Shiyu; Yuan, Wei; Cai, Yang
2017-07-01
Feature matching aims to find corresponding points to serve as tie points between images. Robust matching is still a challenging task when input images are characterized by low contrast or contain repetitive patterns, occlusions, or homogeneous textures. In this paper, a novel feature matching algorithm based on graph theory is proposed. This algorithm integrates both geometric and radiometric constraints into an edge-weighted (EW) affinity tensor. Tie points are then obtained by high-order graph matching. Four pairs of poor textural images covering forests, deserts, bare lands, and urban areas are tested. For comparison, three state-of-the-art matching techniques, namely, scale-invariant feature transform (SIFT), speeded up robust features (SURF), and features from accelerated segment test (FAST), are also used. The experimental results show that the matching recall obtained by SIFT, SURF, and FAST varies from 0 to 35% in different types of poor textures. However, through the integration of both geometry and radiometry and the EW strategy, the recall obtained by the proposed algorithm is better than 50% in all four image pairs. The better matching recall improves the number of correct matches, dispersion, and positional accuracy.
On the infinite-dimensional spin-2 symmetries in Kaluza-Klein theories
International Nuclear Information System (INIS)
Hohm, O.; Hamburg Univ.
2005-11-01
We consider the couplings of an infinite number of spin-2 fields to gravity appearing in Kaluza-Klein theories. They are constructed as the broken phase of a massless theory possessing an infinite-dimensional spin-2 symmetry. Focusing on a circle compactification of four-dimensional gravity we show that the resulting gravity/spin-2 system in D=3 has in its unbroken phase an interpretation as a Chern-Simons theory of the Kac-Moody algebra iso(1,2) associated to the Poincare group and also fits into the geometrical framework of algebra-valued differential geometry developed by Wald. Assigning all degrees of freedom to scalar fields, the matter couplings in the unbroken phase are determined, and it is shown that their global symmetry algebra contains the Virasoro algebra together with an enhancement of the Ehlers group SL(2,R) to its affine extension. The broken phase is then constructed by gauging a subgroup of the global symmetries. It is shown that metric, spin-2 fields and Kaluza-Klein vectors combine into a Chern-Simons theory for an extended algebra, in which the affine Poincare subalgebra acquires a central extension. (orig.)
Application of graph theory to the morphological analysis of settlements
Szmytkie Robert
2017-01-01
In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement). When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the n...
GRAPH THEORY APPROACH TO QUANTIFY UNCERTAINTY OF PERFORMANCE MEASURES
Directory of Open Access Journals (Sweden)
Sérgio D. Sousa
2015-03-01
Full Text Available In this work, the performance measurement process is studied to quantify the uncertainty induced in the resulting performance measure (PM. To that end, the causes of uncertainty are identified, analysing the activities undertaken in the three following stages of the performance measurement process: design and implementation, data collection and record, and determination and analysis. A quantitative methodology based on graph theory and on the sources of uncertainty of the performance measurement process is used to calculate an uncertainty index to evaluate the level of uncertainty of a given PM or (key performance indicator. An application example is presented. The quantification of PM uncertainty could contribute to better represent the risk associated with a given decision and also to improve the PM to increase its precision and reliability.
Political Discourse Analysis Through Solving Problems of Graph Theory
Directory of Open Access Journals (Sweden)
Monica Patrut
2010-03-01
Full Text Available In this article, we show how, using graph theory, we can make a content analysis of political discourse. Assumptions of this analysis are:
- we have a corpus of speech of each party or candidate;
- we consider that speech conveys economic, political, socio-cultural values, these taking the form of words or word families;
- we consider that there are interdependences between the values of a political discourse; they are given by the co-occurrence of two values, as words in the text, within a well defined fragment, or they are determined by the internal logic of political discourse;
- established links between values in a political speech have associated positive numbers indicating the "power" of those links; these "powers" are defined according to both the number of co-occurrences of values, and the internal logic of the discourse where they occur.
In this context we intend to highlight the following:
a which is the dominant value in a political speech;
b which groups of values have ties between them and have no connection with the rest;
c which is the order in which political values should be set in order to obtain an equivalent but more synthetic speech compared to the already given one;
d which are the links between values that form the "core" political speech.
To solve these problems, we shall use the Political Analyst program. After that, we shall present the concepts necessary to the understanding of the introductory graph theory, useful in understanding the analysis of the software and then the operation of the program. This paper extends the previous paper [6].
Valued Graphs and the Representation Theory of Lie Algebras
Directory of Open Access Journals (Sweden)
Joel Lemay
2012-07-01
Full Text Available Quivers (directed graphs, species (a generalization of quivers and their representations play a key role in many areas of mathematics including combinatorics, geometry, and algebra. Their importance is especially apparent in their applications to the representation theory of associative algebras, Lie algebras, and quantum groups. In this paper, we discuss the most important results in the representation theory of species, such as Dlab and Ringel’s extension of Gabriel’s theorem, which classifies all species of finite and tame representation type. We also explain the link between species and K-species (where K is a field. Namely, we show that the category of K -species can be viewed as a subcategory of the category of species. Furthermore, we prove two results about the structure of the tensor ring of a species containing no oriented cycles. Specifically, we prove that two such species have isomorphic tensor rings if and only if they are isomorphic as “crushed” species, and we show that if K is a perfect field, then the tensor algebra of a K -species tensored with the algebraic closure of K is isomorphic to, or Morita equivalent to, the path algebra of a quiver.
The graph representation approach to topological field theory in 2 + 1 dimensions
International Nuclear Information System (INIS)
Martin, S.P.
1991-02-01
An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this ''graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual ''connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations
Directory of Open Access Journals (Sweden)
Aleks Kissinger
2014-03-01
Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.
International Nuclear Information System (INIS)
Samatova, N F; Schmidt, M C; Hendrix, W; Breimyer, P; Thomas, K; Park, B-H
2008-01-01
Data-driven construction of predictive models for biological systems faces challenges from data intensity, uncertainty, and computational complexity. Data-driven model inference is often considered a combinatorial graph problem where an enumeration of all feasible models is sought. The data-intensive and the NP-hard nature of such problems, however, challenges existing methods to meet the required scale of data size and uncertainty, even on modern supercomputers. Maximal clique enumeration (MCE) in a graph derived from such biological data is often a rate-limiting step in detecting protein complexes in protein interaction data, finding clusters of co-expressed genes in microarray data, or identifying clusters of orthologous genes in protein sequence data. We report two key advances that address this challenge. We designed and implemented the first (to the best of our knowledge) parallel MCE algorithm that scales linearly on thousands of processors running MCE on real-world biological networks with thousands and hundreds of thousands of vertices. In addition, we proposed and developed the Graph Perturbation Theory (GPT) that establishes a foundation for efficiently solving the MCE problem in perturbed graphs, which model the uncertainty in the data. GPT formulates necessary and sufficient conditions for detecting the differences between the sets of maximal cliques in the original and perturbed graphs and reduces the enumeration time by more than 80% compared to complete recomputation
Generating loop graphs via Hopf algebra in quantum field theory
International Nuclear Information System (INIS)
Mestre, Angela; Oeckl, Robert
2006-01-01
We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be evaluated directly as contributions to the connected n-point functions. The recursion proceeds by loop order and vertex number
Augmenting Conceptual Design Trajectory Tradespace Exploration with Graph Theory
Dees, Patrick D.; Zwack, Mathew R.; Steffens, Michael; Edwards, Stephen
2016-01-01
Within conceptual design changes occur rapidly due to a combination of uncertainty and shifting requirements. To stay relevant in this fluid time, trade studies must also be performed rapidly. In order to drive down analysis time while improving the information gained by these studies, surrogate models can be created to represent the complex output of a tool or tools within a specified tradespace. In order to create this model however, a large amount of data must be collected in a short amount of time. By this method, the historical approach of relying on subject matter experts to generate the data required is schedule infeasible. However, by implementing automation and distributed analysis the required data can be generated in a fraction of the time. Previous work focused on setting up a tool called multiPOST capable of orchestrating many simultaneous runs of an analysis tool assessing these automated analyses utilizing heuristics gleaned from the best practices of current subject matter experts. In this update to the previous work, elements of graph theory are included to further drive down analysis time by leveraging data previously gathered. It is shown to outperform the previous method in both time required, and the quantity and quality of data produced.
Application of graph theory to the morphological analysis of settlements
Directory of Open Access Journals (Sweden)
Szmytkie Robert
2017-12-01
Full Text Available In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement. When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the number of nodes (β index, the number of cycles (urban blocks, which evidences the complexity of the spatial pattern of settlement, and the average rank of nodes of a graph, which expresses the degree of complexity of a street network.
Two Selected Topics Involving Theory and Applications of Infinite Arrays of Microstrip Elements
National Research Council Canada - National Science Library
Targonski, Stephen
1995-01-01
.... The first topic, the effect of random positioning errors on the input impedance of an infinite array of printed dipoles, utilizes the infinite array solution to gain insight into the reduction...
Zhang, L.-C.; Patone, M.
2017-01-01
We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.
Debnath, Lokenath
2010-01-01
This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Konigsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real…
DEFF Research Database (Denmark)
2011-01-01
Carsten Thomassen belongs to the worlds's absolute top graph theorists, and to the world's top mathematicians in general. The special issue is a rather somewhat random collection of good papers in graph theory, by many different authors, dedicated to Carsten Thomassen on his 60th birthday. Guest ...
Infinite-dimensional Lie algebras in 4D conformal quantum field theory
International Nuclear Information System (INIS)
Bakalov, Bojko; Nikolov, Nikolay M; Rehren, Karl-Henning; Todorov, Ivan
2008-01-01
The concept of global conformal invariance (GCI) opens the way of applying algebraic techniques, developed in the context of two-dimensional chiral conformal field theory, to a higher (even) dimensional spacetime. In particular, a system of GCI scalar fields of conformal dimension two gives rise to a Lie algebra of harmonic bilocal fields, V M (x, y), where the M span a finite dimensional real matrix algebra M closed under transposition. The associative algebra M is irreducible iff its commutant M' coincides with one of the three real division rings. The Lie algebra of (the modes of) the bilocal fields is in each case an infinite-dimensional Lie algebra: a central extension of sp(∞,R) corresponding to the field R of reals, of u(∞, ∞) associated with the field C of complex numbers, and of so*(4∞) related to the algebra H of quaternions. They give rise to quantum field theory models with superselection sectors governed by the (global) gauge groups O(N), U(N) and U(N,H)=Sp(2N), respectively
Quantum entanglement in non-local games, graph parameters and zero-error information theory
Scarpa, G.
2013-01-01
We study quantum entanglement and some of its applications in graph theory and zero-error information theory. In Chapter 1 we introduce entanglement and other fundamental concepts of quantum theory. In Chapter 2 we address the question of how much quantum correlations generated by entanglement can
Band connectivity for topological quantum chemistry: Band structures as a graph theory problem
Bradlyn, Barry; Elcoro, L.; Vergniory, M. G.; Cano, Jennifer; Wang, Zhijun; Felser, C.; Aroyo, M. I.; Bernevig, B. Andrei
2018-01-01
The conventional theory of solids is well suited to describing band structures locally near isolated points in momentum space, but struggles to capture the full, global picture necessary for understanding topological phenomena. In part of a recent paper [B. Bradlyn et al., Nature (London) 547, 298 (2017), 10.1038/nature23268], we have introduced the way to overcome this difficulty by formulating the problem of sewing together many disconnected local k .p band structures across the Brillouin zone in terms of graph theory. In this paper, we give the details of our full theoretical construction. We show that crystal symmetries strongly constrain the allowed connectivities of energy bands, and we employ graph theoretic techniques such as graph connectivity to enumerate all the solutions to these constraints. The tools of graph theory allow us to identify disconnected groups of bands in these solutions, and so identify topologically distinct insulating phases.
Pristine transfinite graphs and permissive electrical networks
Zemanian, Armen H
2001-01-01
A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities. This process can be repeated to obtain a hierarchy of transfiniteness whose ranks increase through the countable ordinals. This idea, which is of recent origin, has enriched the theories of graphs and networks with radically new constructs and research problems. The book provides a more accessible introduction to the subject that, though sacrificing some generality, captures the essential ideas of transfiniteness for graphs and networks. Thus, for example, some results concerning discrete potentials and random walks on transfinite networks can now be presented more concisely. Conversely, the simplifications enable the development of many new results that were previously unavailable. Topics and features: *A simplified exposition provides an introduction to transfiniteness for graphs and networks.*Various results for conventional g...
Graziano, Giuseppe
2006-04-07
The partial molar volume of n-alcohols at infinite dilution in water is smaller than the molar volume in the neat liquid phase. It is shown that the formula for the partial molar volume at infinite dilution obtained from the scaled particle theory equation of state for binary hard sphere mixtures is able to reproduce in a satisfactory manner the experimental data over a large temperature range. This finding implies that the packing effects play the fundamental role in determining the partial molar volume at infinite dilution in water also for solutes, such as n-alcohols, forming H bonds with water molecules. Since the packing effects in water are largely related to the small size of its molecules, the latter feature is the ultimate cause of the decrease in partial molar volume associated with the hydrophobic effect.
Hirschman, Isidore Isaac
2014-01-01
This text for advanced undergraduate and graduate students presents a rigorous approach that also emphasizes applications. Encompassing more than the usual amount of material on the problems of computation with series, the treatment offers many applications, including those related to the theory of special functions. Numerous problems appear throughout the book.The first chapter introduces the elementary theory of infinite series, followed by a relatively complete exposition of the basic properties of Taylor series and Fourier series. Additional subjects include series of functions and the app
POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY
Directory of Open Access Journals (Sweden)
S. Chen
2016-06-01
Full Text Available Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.
MACCIA, ELIZABETH S.; AND OTHERS
AN ANNOTATED BIBLIOGRAPHY OF 20 ITEMS AND A DISCUSSION OF ITS SIGNIFICANCE WAS PRESENTED TO DESCRIBE CURRENT UTILIZATION OF SUBJECT THEORIES IN THE CONSTRUCTION OF AN EDUCATIONAL THEORY. ALSO, A THEORY MODEL WAS USED TO DEMONSTRATE CONSTRUCTION OF A SCIENTIFIC EDUCATIONAL THEORY. THE THEORY MODEL INCORPORATED SET THEORY (S), INFORMATION THEORY…
Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.
2012-01-01
This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.
International Nuclear Information System (INIS)
Anselmi, Damiano
2003-01-01
I study some aspects of the renormalization of quantum field theories with infinitely many couplings in arbitrary spacetime dimensions. I prove that when the spacetime manifold admits a metric of constant curvature, the propagator is not affected by terms with higher derivatives. More generally, certain Lagrangian terms are not turned on by renormalization, if they are absent at the tree level. This restricts the form of the action of a non-renormalizable theory, and has applications to quantum gravity. The new action contains infinitely many couplings, but not all of the ones that might have been expected. In quantum gravity, the metric of constant curvature is an extremal, but not a minimum, of the complete action. Nonetheless, it appears to be the right perturbative vacuum, at least when the curvature is negative, suggesting that the quantum vacuum has a negative asymptotically constant curvature. The results of this paper give also a set of rules for a more economical use of effective quantum field theories and suggest that it might be possible to give mathematical sense to theories with infinitely many couplings at high energies, to search for physical predictions
International Nuclear Information System (INIS)
Kaptanoglu, S.
1983-01-01
A class of local gauge theories based on compact semisimple Lie groups is studied in the limit of infinite gauge coupling constant (g = infinity). In general, in this limit, the gauge fields become auxiliary in all gauge theories, and the system develops a richer structure of constraints. Unfortunately for most gauge theories, this limit turns out to be too singular to quantize and the theory ceases to be renormalizable. For a special class of gauge theories, however, where there are no fermions and there is only one multiplet of scalars in the adjoint representation, we prove that a consistent renormalizable quantum theory exists even in this very singular limit. We trace this exceptional behavior to a new local translationlike symmetry in the functional space that this class of gauge models possesses in the limit of infinite gauge coupling constant. By carrying out the constraint analysis, evaluating the Faddeev-Popov-Senjanovic determinant, and doing the functional integrations over the canonical momenta, the gauge fields, and most of the components of the scalar fields, we obtain an extremely simple result with no non-Abelian structure left in it. For example, for the group SU(2), the final answer reduces to the theory of a one-component self-interacting real phi 4 scalar field theory. Throughout this paper, we use functional methods and make no approximations; our results are nonperturbative and exact. We also discuss some of the possible implications of our results
Directory of Open Access Journals (Sweden)
Matthew D Sacchet
2015-02-01
Full Text Available Recently there has been considerable interest in understanding brain networks in Major Depressive Disorder (MDD. Neural pathways can be tracked in the living brain using diffusion weighted imaging (DWI; graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on ‘support vector machines’ to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and co-morbidities.
Sacchet, Matthew D; Prasad, Gautam; Foland-Ross, Lara C; Thompson, Paul M; Gotlib, Ian H
2015-01-01
Recently, there has been considerable interest in understanding brain networks in major depressive disorder (MDD). Neural pathways can be tracked in the living brain using diffusion-weighted imaging (DWI); graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on "support vector machines" to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and comorbidities.
George, Janine; Deringer, Volker L; Dronskowski, Richard
2014-05-01
Halogen bonds (XBs) are intriguing noncovalent interactions that are frequently being exploited for crystal engineering. Recently, similar bonding mechanisms have been proposed for adjacent main-group elements, and noncovalent "chalcogen bonds" and "pnictogen bonds" have been identified in crystal structures. A fundamental question, largely unresolved thus far, is how XBs and related contacts interact with each other in crystals; similar to hydrogen bonding, one might expect "cooperativity" (bonds amplifying each other), but evidence has been sparse. Here, we explore the crucial step from gas-phase oligomers to truly infinite chains by means of quantum chemical computations. A periodic density functional theory (DFT) framework allows us to address polymeric chains of molecules avoiding the dreaded "cluster effects" as well as the arbitrariness of defining a "large enough" cluster. We focus on three types of molecular chains that we cut from crystal structures; furthermore, we explore reasonable substitutional variants in silico. We find evidence of cooperativity in chains of halogen cyanides and also in similar chalcogen- and pnictogen-bonded systems; the bonds, in the most extreme cases, are amplified through cooperative effects by 79% (I···N), 90% (Te···N), and 103% (Sb···N). Two experimentally known organic crystals, albeit with similar atomic connectivity and XB characteristics, show signs of cooperativity in one case but not in another. Finally, no cooperativity is observed in alternating halogen/acetone and halogen/1,4-dioxane chains; in fact, these XBs weaken each other by up to 26% compared to the respective gas-phase dimers.
Mechanical system reliability analysis using a combination of graph theory and Boolean function
International Nuclear Information System (INIS)
Tang, J.
2001-01-01
A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis
Factors and factorizations of graphs proof techniques in factor theory
Akiyama, Jin
2011-01-01
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive approach, addressing most of the important results from hundreds of findings over the last century. One of the main themes is the observation that many theorems can be proved using only a few standard proof techniques. This stands in marked contrast to the seemingly countless, complex proof techniques offered by the extant body of papers and books. In addition to covering the history and development of this area, the book offers conjectures and discusses open problems. It also includes numerous explanatory figures that enable readers to progressively and intuitively understand the most important notions and proofs in the area of factors and factorization.
An Application of Graph Theory in Markov Chains Reliability Analysis
Directory of Open Access Journals (Sweden)
Pavel Skalny
2014-01-01
Full Text Available The paper presents reliability analysis which was realized for an industrial company. The aim of the paper is to present the usage of discrete time Markov chains and the flow in network approach. Discrete Markov chains a well-known method of stochastic modelling describes the issue. The method is suitable for many systems occurring in practice where we can easily distinguish various amount of states. Markov chains are used to describe transitions between the states of the process. The industrial process is described as a graph network. The maximal flow in the network corresponds to the production. The Ford-Fulkerson algorithm is used to quantify the production for each state. The combination of both methods are utilized to quantify the expected value of the amount of manufactured products for the given time period.
Covariant quantization of infinite spin particle models, and higher order gauge theories
International Nuclear Information System (INIS)
Edgren, Ludde; Marnelius, Robert
2006-01-01
Further properties of a recently proposed higher order infinite spin particle model are derived. Infinitely many classically equivalent but different Hamiltonian formulations are shown to exist. This leads to a condition of uniqueness in the quantization process. A consistent covariant quantization is shown to exist. Also a recently proposed supersymmetric version for half-odd integer spins is quantized. A general algorithm to derive gauge invariances of higher order Lagrangians is given and applied to the infinite spin particle model, and to a new higher order model for a spinning particle which is proposed here, as well as to a previously given higher order rigid particle model. The latter two models are also covariantly quantized
Modal Analysis of In-Wheel Motor-Driven Electric Vehicle Based on Bond Graph Theory
Directory of Open Access Journals (Sweden)
Di Tan
2017-01-01
Full Text Available A half-car vibration model of an electric vehicle driven by rear in-wheel motors was developed using bond graph theory and the modular modeling method. Based on the bond graph model, modal analysis was carried out to study the vibration characteristics of the electric vehicle. To verify the effectiveness of the established model, the results were compared to ones computed on the ground of modal analysis and Newton equations. The comparison shows that the vibration model of the electric vehicle based on bond graph theory not only is able to better compute the natural frequency but also can easily determine the deformation mode, momentum mode, and other isomorphism modes and describe the dynamic characteristics of an electric vehicle driven by in-wheel motors more comprehensively than other modal analysis methods.
Unitary representations of some infinite-dimensional Lie algebras motivated by string theory on AdS3
International Nuclear Information System (INIS)
Andreev, Oleg
1999-01-01
We consider some unitary representations of infinite-dimensional Lie algebras motivated by string theory on AdS 3 . These include examples of two kinds: the A,D,E type affine Lie algebras and the N=4 superconformal algebra. The first presents a new construction for free field representations of affine Lie algebras. The second is of a particular physical interest because it provides some hints that a hybrid of the NSR and GS formulations for string theory on AdS 3 exists
Comparing brain networks of different size and connectivity density using graph theory.
Directory of Open Access Journals (Sweden)
Bernadette C M van Wijk
Full Text Available Graph theory is a valuable framework to study the organization of functional and anatomical connections in the brain. Its use for comparing network topologies, however, is not without difficulties. Graph measures may be influenced by the number of nodes (N and the average degree (k of the network. The explicit form of that influence depends on the type of network topology, which is usually unknown for experimental data. Direct comparisons of graph measures between empirical networks with different N and/or k can therefore yield spurious results. We list benefits and pitfalls of various approaches that intend to overcome these difficulties. We discuss the initial graph definition of unweighted graphs via fixed thresholds, average degrees or edge densities, and the use of weighted graphs. For instance, choosing a threshold to fix N and k does eliminate size and density effects but may lead to modifications of the network by enforcing (ignoring non-significant (significant connections. Opposed to fixing N and k, graph measures are often normalized via random surrogates but, in fact, this may even increase the sensitivity to differences in N and k for the commonly used clustering coefficient and small-world index. To avoid such a bias we tried to estimate the N,k-dependence for empirical networks, which can serve to correct for size effects, if successful. We also add a number of methods used in social sciences that build on statistics of local network structures including exponential random graph models and motif counting. We show that none of the here-investigated methods allows for a reliable and fully unbiased comparison, but some perform better than others.
Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke
2017-05-01
Graph network models in dementia have become an important computational technique in neuroscience to study fundamental organizational principles of brain structure and function of neurodegenerative diseases such as dementia. The graph connectivity is reflected in the connectome, the complete set of structural and functional connections of the graph network, which is mostly based on simple Pearson correlation links. In contrast to simple Pearson correlation networks, the partial correlations (PC) only identify direct correlations while indirect associations are eliminated. In addition to this, the state-of-the-art techniques in brain research are based on static graph theory, which is unable to capture the dynamic behavior of the brain connectivity, as it alters with disease evolution. We propose a new research avenue in neuroimaging connectomics based on combining dynamic graph network theory and modeling strategies at different time scales. We present the theoretical framework for area aggregation and time-scale modeling in brain networks as they pertain to disease evolution in dementia. This novel paradigm is extremely powerful, since we can derive both static parameters pertaining to node and area parameters, as well as dynamic parameters, such as system's eigenvalues. By implementing and analyzing dynamically both disease driven PC-networks and regular concentration networks, we reveal differences in the structure of these network that play an important role in the temporal evolution of this disease. The described research is key to advance biomedical research on novel disease prediction trajectories and dementia therapies.
Сlassification of methods of production of computer forensic by usage approach of graph theory
Directory of Open Access Journals (Sweden)
Anna Ravilyevna Smolina
2016-06-01
Full Text Available Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.
Сlassification of methods of production of computer forensic by usage approach of graph theory
Anna Ravilyevna Smolina; Alexander Alexandrovich Shelupanov
2016-01-01
Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.
A Qualitative Analysis Framework Using Natural Language Processing and Graph Theory
Tierney, Patrick J.
2012-01-01
This paper introduces a method of extending natural language-based processing of qualitative data analysis with the use of a very quantitative tool--graph theory. It is not an attempt to convert qualitative research to a positivist approach with a mathematical black box, nor is it a "graphical solution". Rather, it is a method to help qualitative…
Semantic Mining based on graph theory and ontologies. Case Study: Cell Signaling Pathways
Directory of Open Access Journals (Sweden)
Carlos R. Rangel
2016-08-01
Full Text Available In this paper we use concepts from graph theory and cellular biology represented as ontologies, to carry out semantic mining tasks on signaling pathway networks. Specifically, the paper describes the semantic enrichment of signaling pathway networks. A cell signaling network describes the basic cellular activities and their interactions. The main contribution of this paper is in the signaling pathway research area, it proposes a new technique to analyze and understand how changes in these networks may affect the transmission and flow of information, which produce diseases such as cancer and diabetes. Our approach is based on three concepts from graph theory (modularity, clustering and centrality frequently used on social networks analysis. Our approach consists into two phases: the first uses the graph theory concepts to determine the cellular groups in the network, which we will call them communities; the second uses ontologies for the semantic enrichment of the cellular communities. The measures used from the graph theory allow us to determine the set of cells that are close (for example, in a disease, and the main cells in each community. We analyze our approach in two cases: TGF-ß and the Alzheimer Disease.
PROBLEMS IN TOPOLOGICAL GRAPH THEORY : QUESTIONS I CAN'T ANSWER
Archdeacon, Dan
1999-01-01
This paper describes my Problems in Topological Graph Theory, which can be accessed through the world-wide-web at http: //www.emba .uvm.edu/~arcceack/problems/problems.html This list of problems is constantly being revised; the interested reader is encouraged to submit additions and updates.
Feynman graphs and gauge theories for experimental physicists. 2. rev. ed.
International Nuclear Information System (INIS)
Schmueser, P.
1995-01-01
This book is an introduction to the foundations of quantum field theory with special regards to gauge theory. After a general introduction to relativistic wave equations the concept of Feynman graphs is introduced. Then after an introduction to the phenomenology of weak interactions and the principle of gauge invariance the standard model of the electroweak interaction is presented. Finally quantum chromodynamics is described. Every chapter contains exercise problems. (HSI)
Routing Planning As An Application Of Graph Theory with Fuzzy Logic
Directory of Open Access Journals (Sweden)
Tomasz Neumann
2016-12-01
Full Text Available The routing planning one of the classic problems in graph theory. Its application have various practical uses ranging from the transportation, civil engineering and other applications. The resolution of this paper is to find a solution for route planning in a transport networks, where the description of tracks, factor of safety and travel time are ambiguous. In the study the ranking system based on the theory of possibility is proposed.
Towers and ladders: Infinite parameter symmetries in Kaluza-Klein theories
International Nuclear Information System (INIS)
Aulakh, C.S.
1984-05-01
We introduce a class of infinite dimensional algebras with a 'generalized loop structure' by considering the global symmetries of the four dimensional Lagrangian obtained by compactifying general relativity coupled to Yang-Mills in six dimensions down to M 4 xS 2 . The generalization to arbitrary dimensions is then obvious. We show by explicit construction that such algebras possess an infinite number of finite sub-algebras. Among which, for the six dimensional case, is so(1,3) realized on S 2 with vanishing Casimir invariants. This so(1,3) may be interpreted, in accord with a previous conjecture of Salam and Strathdee [Ann. Phys. 141, 316(1982)], as the 'ladder' symmetry for the Kaluza-Klein towers. (author)
Of towers and ladders: Infinite parameter symmetries in Kaluza-Klein theories
International Nuclear Information System (INIS)
Aulakh, C.S.
1984-01-01
We introduce a class of infinite dimensional algebras with a 'generalized loop structure' by considering the global symmetries of the four-dimensional lagrangian obtained by compactifying general relativity coupled to Yang-Mills in six-dimensions down to M 4 x S 2 . The generalization to arbitrary dimensions is then obvious. We show by explicit construction that such algebras possess an infinite number of finite sub-algebras among which, for the six-dimensional case, is so (1, 3), realized on S 2 with vanishing Casimir invariants. This so (1, 3) may be interpreted, in accordance with a previous conjecture of Salam and Strathdee, as the 'ladder' symmetry for the Kaluza-Klein towers. (orig.)
SIMULATION OF DRIVER’S LOCOMOTIVE-HANDLING ACTIVITY USING THE THEORY OF FUZZY GRAPHS
Directory of Open Access Journals (Sweden)
T. V. Butko
2015-03-01
Full Text Available Purpose. The efficiency and safety of locomotive control improving is important and relevant scientific and practical problem. Every driver during the trains-handling bases on his experience and knowledge, that is why the compilation and detection the most efficient ways to control the locomotive-handling is one of the stages of measures development to reduce transportation costs. The purpose of this paper is a formalization process description of locomotive-handling and quality parameters determination of this process. Methodology. In order to achieve this goal the theory of fuzzy probabilistic graphs was used. Vertices of the graph correspond to the events start and end operations at train-handling. The graph arcs describe operations on train-handling. Graph consists of thirteen peaks corresponding to the main control actions of the engine-driver. The weighting factors of transitions between vertices are assigned by fuzzy numbers. Their values were obtained by expert estimates. Fuzzy probabilities and transition time are presented as numbers with trapezoidal membership function. Findings. Using successive merging of parallel arcs, loops and vertices elimination, the equivalent fuzzy graph of train-handling and the corresponding L-matrix were obtained. Equivalent graph takes into account separately activity of the driver during normal operation and during emergency situations. Originality. The theoretical foundations of describing process formalization in driver’s locomotive-handling activity were developed using the fuzzy probabilistic graph. The parameters characterizing the decision-making process of engineer were obtained. Practical value. With the resulting model it is possible to estimate the available reserves for the quality improvement of locomotive-handling. Reduction in the time for decision-making will lead to the approximation the current mode of control to the rational one and decrease costs of hauling operations. And reduction
Graph theory applied to noise and vibration control in statistical energy analysis models.
Guasch, Oriol; Cortés, Lluís
2009-06-01
A fundamental aspect of noise and vibration control in statistical energy analysis (SEA) models consists in first identifying and then reducing the energy flow paths between subsystems. In this work, it is proposed to make use of some results from graph theory to address both issues. On the one hand, linear and path algebras applied to adjacency matrices of SEA graphs are used to determine the existence of any order paths between subsystems, counting and labeling them, finding extremal paths, or determining the power flow contributions from groups of paths. On the other hand, a strategy is presented that makes use of graph cut algorithms to reduce the energy flow from a source subsystem to a receiver one, modifying as few internal and coupling loss factors as possible.
Directory of Open Access Journals (Sweden)
Karolina Taczanowska
2017-12-01
Full Text Available Mountain protected areas (PAs aim to preserve vulnerable environments and at the same time encourage numerous outdoor leisure activities. Understanding the way people use natural environments is crucial to balance the needs of visitors and site capacities. This study aims to develop an approach to evaluate the structure and use of designated skiing zones in PAs combining Global Positioning System (GPS tracking and analytical methods based on graph theory. The study is based on empirical data (n = 609 GPS tracks of backcountry skiers collected in Tatra National Park (TNP, Poland. The physical structure of the entire skiing zones system has been simplified into a graph structure (structural network; undirected graph. In a second step, the actual use of the area by skiers (functional network; directed graph was analyzed using a graph-theoretic approach. Network coherence (connectivity indices: β, γ, α, movement directions at path segments, and relative importance of network nodes (node centrality measures: degree, betweenness, closeness, and proximity prestige were calculated. The system of designated backcountry skiing zones was not evenly used by the visitors. Therefore, the calculated parameters differ significantly between the structural and the functional network. In particular, measures related to the actually used trails are of high importance from the management point of view. Information about the most important node locations can be used for planning sign-posts, on-site maps, interpretative boards, or other tourist infrastructure.
Connections between the Sznajd model with general confidence rules and graph theory
Timpanaro, André M.; Prado, Carmen P. C.
2012-10-01
The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabási-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q>2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).
Quantum information processing with graph states
International Nuclear Information System (INIS)
Schlingemann, Dirk-Michael
2005-04-01
Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)
Visibility graph analysis on quarterly macroeconomic series of China based on complex network theory
Wang, Na; Li, Dong; Wang, Qiwen
2012-12-01
The visibility graph approach and complex network theory provide a new insight into time series analysis. The inheritance of the visibility graph from the original time series was further explored in the paper. We found that degree distributions of visibility graphs extracted from Pseudo Brownian Motion series obtained by the Frequency Domain algorithm exhibit exponential behaviors, in which the exponential exponent is a binomial function of the Hurst index inherited in the time series. Our simulations presented that the quantitative relations between the Hurst indexes and the exponents of degree distribution function are different for different series and the visibility graph inherits some important features of the original time series. Further, we convert some quarterly macroeconomic series including the growth rates of value-added of three industry series and the growth rates of Gross Domestic Product series of China to graphs by the visibility algorithm and explore the topological properties of graphs associated from the four macroeconomic series, namely, the degree distribution and correlations, the clustering coefficient, the average path length, and community structure. Based on complex network analysis we find degree distributions of associated networks from the growth rates of value-added of three industry series are almost exponential and the degree distributions of associated networks from the growth rates of GDP series are scale free. We also discussed the assortativity and disassortativity of the four associated networks as they are related to the evolutionary process of the original macroeconomic series. All the constructed networks have “small-world” features. The community structures of associated networks suggest dynamic changes of the original macroeconomic series. We also detected the relationship among government policy changes, community structures of associated networks and macroeconomic dynamics. We find great influences of government
Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.
Khazaee, Ali; Ebrahimzadeh, Ata; Babajani-Feremi, Abbas
2015-11-01
Study of brain network on the basis of resting-state functional magnetic resonance imaging (fMRI) has provided promising results to investigate changes in connectivity among different brain regions because of diseases. Graph theory can efficiently characterize different aspects of the brain network by calculating measures of integration and segregation. In this study, we combine graph theoretical approaches with advanced machine learning methods to study functional brain network alteration in patients with Alzheimer's disease (AD). Support vector machine (SVM) was used to explore the ability of graph measures in diagnosis of AD. We applied our method on the resting-state fMRI data of twenty patients with AD and twenty age and gender matched healthy subjects. The data were preprocessed and each subject's graph was constructed by parcellation of the whole brain into 90 distinct regions using the automated anatomical labeling (AAL) atlas. The graph measures were then calculated and used as the discriminating features. Extracted network-based features were fed to different feature selection algorithms to choose most significant features. In addition to the machine learning approach, statistical analysis was performed on connectivity matrices to find altered connectivity patterns in patients with AD. Using the selected features, we were able to accurately classify patients with AD from healthy subjects with accuracy of 100%. Results of this study show that pattern recognition and graph of brain network, on the basis of the resting state fMRI data, can efficiently assist in the diagnosis of AD. Classification based on the resting-state fMRI can be used as a non-invasive and automatic tool to diagnosis of Alzheimer's disease. Copyright © 2015 International Federation of Clinical Neurophysiology. All rights reserved.
Cheng, Shaobo; Zhang, Dong; Deng, Shiqing; Li, Xing; Li, Jun; Tan, Guotai; Zhu, Yimei; Zhu, Jing
2018-04-01
Topological defects and their interactions often arouse multiple types of emerging phenomena from edge states in Skyrmions to disclination pairs in liquid crystals. In hexagonal manganites, partial edge dislocations, a prototype topological defect, are ubiquitous and they significantly alter the topologically protected domains and their behaviors. Herein, combining electron microscopy experiment and graph theory analysis, we report a systematic study of the connections and configurations of domains in this dislocation embedded system. Rules for domain arrangement are established. The dividing line between domains, which can be attributed by the strain field of dislocations, is accurately described by a genus model from a higher dimension in the graph theory. Our results open a door for the understanding of domain patterns in topologically protected multiferroic systems.
Hadronic equation of state in the statistical bootstrap model and linear graph theory
International Nuclear Information System (INIS)
Fre, P.; Page, R.
1976-01-01
Taking a statistical mechanical point og view, the statistical bootstrap model is discussed and, from a critical analysis of the bootstrap volume comcept, it is reached a physical ipothesis, which leads immediately to the hadronic equation of state provided by the bootstrap integral equation. In this context also the connection between the statistical bootstrap and the linear graph theory approach to interacting gases is analyzed
Using Zipf-Mandelbrot law and graph theory to evaluate animal welfare
de Oliveira, Caprice G. L.; Miranda, José G. V.; Japyassú, Hilton F.; El-Hani, Charbel N.
2018-02-01
This work deals with the construction and testing of metrics of welfare based on behavioral complexity, using assumptions derived from Zipf-Mandelbrot law and graph theory. To test these metrics we compared yellow-breasted capuchins (Sapajus xanthosternos) (Wied-Neuwied, 1826) (PRIMATES CEBIDAE) found in two institutions, subjected to different captive conditions: a Zoobotanical Garden (hereafter, ZOO; n = 14), in good welfare condition, and a Wildlife Rescue Center (hereafter, WRC; n = 8), in poor welfare condition. In the Zipf-Mandelbrot-based analysis, the power law exponent was calculated using behavior frequency values versus behavior rank value. These values allow us to evaluate variations in individual behavioral complexity. For each individual we also constructed a graph using the sequence of behavioral units displayed in each recording (average recording time per individual: 4 h 26 min in the ZOO, 4 h 30 min in the WRC). Then, we calculated the values of the main graph attributes, which allowed us to analyze the complexity of the connectivity of the behaviors displayed in the individuals' behavioral sequences. We found significant differences between the two groups for the slope values in the Zipf-Mandelbrot analysis. The slope values for the ZOO individuals approached -1, with graphs representing a power law, while the values for the WRC individuals diverged from -1, differing from a power law pattern. Likewise, we found significant differences for the graph attributes average degree, weighted average degree, and clustering coefficient when comparing the ZOO and WRC individual graphs. However, no significant difference was found for the attributes modularity and average path length. Both analyses were effective in detecting differences between the patterns of behavioral complexity in the two groups. The slope values for the ZOO individuals indicated a higher behavioral complexity when compared to the WRC individuals. Similarly, graph construction and the
Classical gauge theories on the coadjoint orbits of infinite dimensional groups
International Nuclear Information System (INIS)
Grabowski, M.P.; Virginia Polytechnic Inst. and State Univ., Blacksburg; Tze Chiahsiung
1991-01-01
We reformulate several classical gauge theories on the coadjoint orbits of the semidirect product of the gauge group and the Weyl group. The construction is given for the Yang-Mills theories in arbitrary spacetime dimension d, Chern-Simons topological theory (d=3) and higher dimensional topological models of Horowitz (d≥4). (orig.)
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory
Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.
2016-01-01
There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.
Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A
2016-08-25
There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
Summing Feynman graphs by Monte Carlo: Planar φ3-theory and dynamically triangulated random surfaces
International Nuclear Information System (INIS)
Boulatov, D.V.
1988-01-01
New combinatorial identities are suggested relating the ratio of (n-1)th and nth orders of (planar) perturbation expansion for any quantity to some average over the ensemble of all planar graphs of the nth order. These identities are used for Monte Carlo calculation of critical exponents γ str (string susceptibility) in planar φ 3 -theory and in the dynamically triangulated random surface (DTRS) model near the convergence circle for various dimensions. In the solvable case D=1 the exact critical properties of the theory are reproduced numerically. (orig.)
Quantum walks with infinite hitting times
International Nuclear Information System (INIS)
Krovi, Hari; Brun, Todd A.
2006-01-01
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks can have infinite hitting times for some initial states. We seek criteria to determine if a given walk on a graph will have infinite hitting times, and find a sufficient condition, which for discrete time quantum walks is that the degeneracy of the evolution operator be greater than the degree of the graph. The set of initial states which give an infinite hitting time form a subspace. The phenomenon of infinite hitting times is in general a consequence of the symmetry of the graph and its automorphism group. Using the irreducible representations of the automorphism group, we derive conditions such that quantum walks defined on this graph must have infinite hitting times for some initial states. In the case of the discrete walk, if this condition is satisfied the walk will have infinite hitting times for any choice of a coin operator, and we give a class of graphs with infinite hitting times for any choice of coin. Hitting times are not very well defined for continuous time quantum walks, but we show that the idea of infinite hitting-time walks naturally extends to the continuous time case as well
A graph-theory framework for evaluating landscape connectivity and conservation planning.
Minor, Emily S; Urban, Dean L
2008-04-01
Connectivity of habitat patches is thought to be important for movement of genes, individuals, populations, and species over multiple temporal and spatial scales. We used graph theory to characterize multiple aspects of landscape connectivity in a habitat network in the North Carolina Piedmont (U.S.A). We compared this landscape with simulated networks with known topology, resistance to disturbance, and rate of movement. We introduced graph measures such as compartmentalization and clustering, which can be used to identify locations on the landscape that may be especially resilient to human development or areas that may be most suitable for conservation. Our analyses indicated that for songbirds the Piedmont habitat network was well connected. Furthermore, the habitat network had commonalities with planar networks, which exhibit slow movement, and scale-free networks, which are resistant to random disturbances. These results suggest that connectivity in the habitat network was high enough to prevent the negative consequences of isolation but not so high as to allow rapid spread of disease. Our graph-theory framework provided insight into regional and emergent global network properties in an intuitive and visual way and allowed us to make inferences about rates and paths of species movements and vulnerability to disturbance. This approach can be applied easily to assessing habitat connectivity in any fragmented or patchy landscape.
International Nuclear Information System (INIS)
Trukhanov, G.Ya.
2005-01-01
Time-dependent neutron transport theory of G.Ya. Trukhanov and S.A. Podosenov is developed. Errors of calculating of power series expansion coefficients, γ k , in this theory were estimated. It has been found that power series convergence radius R=|χ 1,2 |= 0.9595. Power series convergence speed were estimated [ru
The Hartree Equation for Infinitely Many Particles I. Well-Posedness Theory
Lewin, Mathieu; Sabin, Julien
2015-02-01
We show local and global well-posedness results for the Hartree equation where γ is a bounded self-adjoint operator on , ρ γ ( x) = γ( x, x) and w is a smooth short-range interaction potential. The initial datum γ(0) is assumed to be a perturbation of a translation-invariant state γ f = f(-Δ) which describes a quantum system with an infinite number of particles, such as the Fermi sea at zero temperature, or the Fermi-Dirac and Bose-Einstein gases at positive temperature. Global well-posedness follows from the conservation of the relative (free) energy of the state γ( t), counted relatively to the stationary state γ f . We indeed use a general notion of relative entropy, which allows us to treat a wide class of stationary states f(-Δ). Our results are based on a Lieb-Thirring inequality at positive density and on a recent Strichartz inequality for orthonormal functions, which are both due to Frank, Lieb, Seiringer and the first author of this article.
An unprecedented multi attribute decision making using graph theory matrix approach
Directory of Open Access Journals (Sweden)
N.K. Geetha
2018-02-01
Full Text Available A frame work for investigating the best combination of functioning parameters on a variable compression ratio diesel engine is proposed in the present study using a multi attribute optimization methodology, Graph Theory Matrix Approach. The functioning parameters, attributes, sub attributes and functioning variables of sub attributes are chosen based on expert’s opinion and literature review. The directed graphs are developed for attributes and sub attributes. The ‘Parameter Index’ was calculated for all trials to choose the best trial. The experimental results are verified with the theoretical data. Functioning parameters with combination of compression ratio of 17, fuel injection pressure of 20 N/mm2 and fuel injection pressure of 21°bTDC was found to be best. The proposed method allows the decision maker to systematically and logically find the best combination of functioning parameters.
Infinite additional symmetries in two-dimensional conformal quantum field theory
International Nuclear Information System (INIS)
Zamolodchikov, A.B.
1986-01-01
This paper investigates additional symmetries in two-dimensional conformal field theory generated by spin s = 1/2, 1,...,3 currents. For spins s = 5/2 and s = 3, the generators of the symmetry form associative algebras with quadratic determining relations. ''Minimal models'' of conforma field theory with such additional symmetries are considered. The space of local fields occurring in a conformal field theory with additional symmetry corresponds to a certain (in general, reducible) representation of the corresponding algebra of the symmetry
Positive operator semigroups from finite to infinite dimensions
Bátkai, András; Rhandi, Abdelaziz
2017-01-01
This book gives a gentle but up-to-date introduction into the theory of operator semigroups (or linear dynamical systems), which can be used with great success to describe the dynamics of complicated phenomena arising in many applications. Positivity is a property which naturally appears in physical, chemical, biological or economic processes. It adds a beautiful and far reaching mathematical structure to the dynamical systems and operators describing these processes. In the first part, the finite dimensional theory in a coordinate-free way is developed, which is difficult to find in literature. This is a good opportunity to present the main ideas of the Perron-Frobenius theory in a way which can be used in the infinite dimensional situation. Applications to graph matrices, age structured population models and economic models are discussed. The infinite dimensional theory of positive operator semigroups with their spectral and asymptotic theory is developed in the second part. Recent applications illustrate t...
International Nuclear Information System (INIS)
Arreola V, G.; Vazquez R, R.; Guzman A, J. R.
2012-10-01
In this work a comparative analysis of the results for the neutrons dispersion in a not multiplicative semi-infinite medium is presented. One of the frontiers of this medium is located in the origin of coordinates, where a neutrons source in beam form, i.e., μο=1 is also. The neutrons dispersion is studied on the statistical method of Monte Carlo and through the unidimensional transport theory and for an energy group. The application of transport theory gives a semi-analytic solution for this problem while the statistical solution for the flow was obtained applying the MCNPX code. The dispersion in light water and heavy water was studied. A first remarkable result is that both methods locate the maximum of the neutrons distribution to less than two mean free trajectories of transport for heavy water, while for the light water is less than ten mean free trajectories of transport; the differences between both methods is major for the light water case. A second remarkable result is that the tendency of both distributions is similar in small mean free trajectories, while in big mean free trajectories the transport theory spreads to an asymptote value and the solution in base statistical method spreads to zero. The existence of a neutron current of low energy and toward the source is demonstrated, in contrary sense to the neutron current of high energy coming from the own source. (Author)
The higher infinite large cardinals in set theory from their beginnings
Kanamori, Akihiro
2003-01-01
The theory of large cardinals is currently a broad mainstream of modern set theory, the main area of investigation for the analysis of the relative consistency of mathematical propositions and possible new axioms for mathematics. The first of a projected multi-volume series, this book provides a comprehensive account of the theory of large cardinals from its beginnings and some of the direct outgrowths leading to the frontiers of contempory research. A "genetic" approach is taken, presenting the subject in the context of its historical development. With hindsight the consequential avenues are pursued and the most elegant or accessible expositions given. With open questions and speculations provided throughout the reader should not only come to appreciate the scope and coherence of the overall enterpreise but also become prepared to pursue research in several specific areas by studying the relevant sections.
Classification of mini-dimmings associated with extreme ultraviolet eruptions by using graph theory
Directory of Open Access Journals (Sweden)
S Bazargan
2016-09-01
Full Text Available Coronal dimmings in both micro and macro scales, can be observed by extreme ultraviolet images, recorded from Solar Dynamics Observatory or Atmospheric Imaging Assembly (SDO/AIA. Mini-dimmings are sometimes associated with wave-like brightening, called coronal mass ejections. Here, the sun full disk images with 171 Å wavelenght, cadence of 2.5, and 0.6 arcsec cell size, were taken on 3 March 2012, then the obtained data were analyzed. Using Zernike Moment and Support Vector Machine (SVM, mini dimmings are detected. 538 active region events, 680 coronal hole events and 723 quiet sun events have been recognized using algorithm. The position, time duration and spatial expansion of these events were computed .The eruptive dimmings have a more spatial development than thermal dimmings after eruptions. This is evident in their graph characteristics length. Then, using graph theory, eruptive and thermal mini-dimmings were classified, with 13% error, for 200 dimmings. 68 dimmings were classified as thermal, and 132 as eruptive. To do this, evolution of graph characteristic length were used.
The Stability Analysis Method of the Cohesive Granular Slope on the Basis of Graph Theory.
Guan, Yanpeng; Liu, Xiaoli; Wang, Enzhi; Wang, Sijing
2017-02-27
This paper attempted to provide a method to calculate progressive failure of the cohesivefrictional granular geomaterial and the spatial distribution of the stability of the cohesive granular slope. The methodology can be divided into two parts: the characterization method of macro-contact and the analysis of the slope stability. Based on the graph theory, the vertexes, the edges and the edge sequences are abstracted out to characterize the voids, the particle contact and the macro-contact, respectively, bridging the gap between the mesoscopic and macro scales of granular materials. This paper adopts this characterization method to extract a graph from a granular slope and characterize the macro sliding surface, then the weighted graph is analyzed to calculate the slope safety factor. Each edge has three weights representing the sliding moment, the anti-sliding moment and the braking index of contact-bond, respectively, . The safety factor of the slope is calculated by presupposing a certain number of sliding routes and reducing Weight repeatedly and counting the mesoscopic failure of the edge. It is a kind of slope analysis method from mesoscopic perspective so it can present more detail of the mesoscopic property of the granular slope. In the respect of macro scale, the spatial distribution of the stability of the granular slope is in agreement with the theoretical solution.
Functional calculus for C0-semigroups using infinite-dimensional systems theory
Schwenninger, F.L.; Zwart, Hans; Arendt, Wolfgang; Chill, Ralph; Tomilov, Yuri
2015-01-01
In this short note we use ideas from systems theory to define a functional calculus for infinitesimal generators of strongly continuous semigroups on a Hilbert space. Among others, we show how this leads to new proofs of (known) results in functional calculus.
K-theory for certain extension algebras of purely infinite simple C ...
Indian Academy of Sciences (India)
In the 1960s, Atiyah and Hirzebruch developed the K-theory which is based on the work .... all projections in E\\B. Then P satisfies the following conditions: (1) : If p, q ∈ P ..... London/Singapore/Hong Kong/Bangalore: World Scientific) (2001).
Dilts, Thomas E.; Weisberg, Peter J.; Leitner, Phillip; Matocq, Marjorie D.; Inman, Richard D.; Nussear, Ken E.; Esque, Todd C.
2016-01-01
Conservation planning and biodiversity management require information on landscape connectivity across a range of spatial scales from individual home ranges to large regions. Reduction in landscape connectivity due changes in land-use or development is expected to act synergistically with alterations to habitat mosaic configuration arising from climate change. We illustrate a multi-scale connectivity framework to aid habitat conservation prioritization in the context of changing land use and climate. Our approach, which builds upon the strengths of multiple landscape connectivity methods including graph theory, circuit theory and least-cost path analysis, is here applied to the conservation planning requirements of the Mohave ground squirrel. The distribution of this California threatened species, as for numerous other desert species, overlaps with the proposed placement of several utility-scale renewable energy developments in the American Southwest. Our approach uses information derived at three spatial scales to forecast potential changes in habitat connectivity under various scenarios of energy development and climate change. By disentangling the potential effects of habitat loss and fragmentation across multiple scales, we identify priority conservation areas for both core habitat and critical corridor or stepping stone habitats. This approach is a first step toward applying graph theory to analyze habitat connectivity for species with continuously-distributed habitat, and should be applicable across a broad range of taxa.
Dilt, Thomas E; Weisberg, Peter J; Leitner, Philip; Matocq, Marjorie D; Inman, Richard D; Nussear, Kenneth E; Esque, Todd C
2016-06-01
Conservation planning and biodiversity management require information on landscape connectivity across a range of spatial scales from individual home ranges to large regions. Reduction in landscape connectivity due changes in land use or development is expected to act synergistically with alterations to habitat mosaic configuration arising from climate change. We illustrate a multiscale connectivity framework to aid habitat conservation prioritization in the context of changing land use and climate. Our approach, which builds upon the strengths of multiple landscape connectivity methods, including graph theory, circuit theory, and least-cost path analysis, is here applied to the conservation planning requirements of the Mohave ground squirrel. The distribution of this threatened Californian species, as for numerous other desert species, overlaps with the proposed placement of several utility-scale renewable energy developments in the American southwest. Our approach uses information derived at three spatial scales to forecast potential changes in habitat connectivity under various scenarios of energy development and climate change. By disentangling the potential effects of habitat loss and fragmentation across multiple scales, we identify priority conservation areas for both core habitat and critical corridor or stepping stone habitats. This approach is a first step toward applying graph theory to analyze habitat connectivity for species with continuously distributed habitat and should be applicable across a broad range of taxa.
Kopylova, N. S.; Bykova, A. A.; Beregovoy, D. N.
2018-05-01
Based on the landscape-geographical approach, a structural and logical scheme for the Northwestern Federal District Econet has been developed, which can be integrated into the federal and world ecological network in order to improve the environmental infrastructure of the region. The method of Northwestern Federal District Econet organization on the basis of graph theory by means of the Quantum GIS geographic information system is proposed as an effective mean of preserving and recreating the unique biodiversity of landscapes, regulation of the sphere of environmental protection.
Directory of Open Access Journals (Sweden)
Qu Li
2014-01-01
Full Text Available Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.
Small random perturbations of infinite dimensional dynamical systems and nucleation theory
International Nuclear Information System (INIS)
Cassandro, M.; Olivieri, E.; Picco, P.
1985-06-01
We consider a stochastic differential equation with a standard space-time white noise and a double well non symmetric potential. The equation without the white noise term exhibits several equilibria two of which are stable. We study, in the double limit zero noise and thermodynamic limit the large fluctuations and compute the transition probability between the two stable equilibria (tunnelling). The unique stationary measure associated to the stochastic process described by our equation is strictly related to the Gibbs measure for a ferromagnetic spin system subject to a Kac interaction. Our double limit corresponds to the one considered by Lobowitz and Penrose in their rigorous version of the mean field theory of the first order phase transitions. The tunnelling between the two (non equivalent) equilibrium configurations is interpreted as the decay from the metastable to the stable state. Our results are in qualitative agreement with the usual nucleation theory
Directory of Open Access Journals (Sweden)
Eric Vaz
2013-12-01
Full Text Available Urban sprawl and growth has experienced increased concern in geographic and environmental literature. Preceding the existence of robust frameworks found in regional and urban planning, as well as urban geography and economics, the spatial properties of allocation of urban land use are still far from being completely understood. This is largely due to the underlying complexity of the change found at the spatial level of urban land use, merging social, economic and natural drivers. The spatial patterns formed, and the connectivity established among the different subsets of land-use types, becomes a complex network of interactions over time, helping to shape the structure of the city. The possibility to merge the configuration of land-use with complex networks may be assessed elegantly through graph theory. Nodes and edges can become abstract representations of typologies of space and are represented into a topological space of different land use types which traditionally share common spatial boundaries. Within a regional framework, the links between adjacent and neighboring urban land use types become better understood, by means of a KamadaKawai algorithm. This study uses land use in Lisbon over three years, 1990, 2000 and 2006, to develop a Kamada-Kawai graph interpretation of land-use as a result of neighboring power. The rapid change witnessed in Lisbon since the nineties, as well as the availability of CORINE Land Cover data in these three time stamps, permits a reflection on anthropogenic land-use change in urban and semi-urban areas in Portugal’s capital. This paper responds to (1 the structure and connectivity of urban land use over time, demonstrating that most of the agricultural land is stressed to transform to urban, gaining a central role in future. (2 Offer a systemic approach to land-use transitions generating what we call spatial memory, where land use change is often unpredictable over space, but becomes evident in a graph theory
Infinite additional symmetries in the two-dimensional conformal quantum field theory
International Nuclear Information System (INIS)
Apikyan, S.A.
1987-01-01
Additional symmetries in the two-dimensional conformal field theory, generated by currents (2,3/2,5/2) and (2,3/2,3) have been studied. It has been shown that algebra (2,3/2,5/2) is the direct product of algebras (2,3/2) and (2,5/2), and algebra (2,3/2,3) is the direct product of algebras (2,3/2) and (2,3). Associative algebra, formed by multicomponent symmetry generators of spin 3 for SO(3) has also been found
The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI.
Gargouri, Fatma; Kallel, Fathi; Delphine, Sebastien; Ben Hamida, Ahmed; Lehéricy, Stéphane; Valabregue, Romain
2018-01-01
Resting state functional MRI (rs-fMRI) is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step) and the scr (where we applied realignment, tCompCor and smoothing as a final step) strategies had the highest mean values of global efficiency (eg) . Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step), had the highest mean local efficiency (el) values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency.
The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI
Directory of Open Access Journals (Sweden)
Fatma Gargouri
2018-02-01
Full Text Available Resting state functional MRI (rs-fMRI is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step and the scr (where we applied realignment, tCompCor and smoothing as a final step strategies had the highest mean values of global efficiency (eg. Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step, had the highest mean local efficiency (el values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency.
The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI
Gargouri, Fatma; Kallel, Fathi; Delphine, Sebastien; Ben Hamida, Ahmed; Lehéricy, Stéphane; Valabregue, Romain
2018-01-01
Resting state functional MRI (rs-fMRI) is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step) and the scr (where we applied realignment, tCompCor and smoothing as a final step) strategies had the highest mean values of global efficiency (eg). Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step), had the highest mean local efficiency (el) values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency. PMID:29497372
Analysis of the enzyme network involved in cattle milk production using graph theory.
Ghorbani, Sholeh; Tahmoorespur, Mojtaba; Masoudi Nejad, Ali; Nasiri, Mohammad; Asgari, Yazdan
2015-06-01
Understanding cattle metabolism and its relationship with milk products is important in bovine breeding. A systemic view could lead to consequences that will result in a better understanding of existing concepts. Topological indices and quantitative characterizations mostly result from the application of graph theory on biological data. In the present work, the enzyme network involved in cattle milk production was reconstructed and analyzed based on available bovine genome information using several public datasets (NCBI, Uniprot, KEGG, and Brenda). The reconstructed network consisted of 3605 reactions named by KEGG compound numbers and 646 enzymes that catalyzed the corresponding reactions. The characteristics of the directed and undirected network were analyzed using Graph Theory. The mean path length was calculated to be4.39 and 5.41 for directed and undirected networks, respectively. The top 11 hub enzymes whose abnormality could harm bovine health and reduce milk production were determined. Therefore, the aim of constructing the enzyme centric network was twofold; first to find out whether such network followed the same properties of other biological networks, and second, to find the key enzymes. The results of the present study can improve our understanding of milk production in cattle. Also, analysis of the enzyme network can help improve the modeling and simulation of biological systems and help design desired phenotypes to increase milk production quality or quantity.
An application of the graph theory which examines the metro networks
Directory of Open Access Journals (Sweden)
Svetla STOILOVA
2015-06-01
Full Text Available The graph theory gives a mathematical representation of transport networks and allows us to study their characteristics effectively. A research of the structure of metro system has been conducted in the study by using the graph theory. The study includes subway systems of 22 European capitals. New indicators have been defined in the research such as a degree of routing, a connectivity of the route, average length per link (which takes into account the number of routes, intensity of the route, density of the route. The new and the existing indicators have been used to analyze and classify the metro networks. The statistical method cluster analysis has been applied to classify the networks. Ten indicators have been used to carry out an analysis. The metro systems in European capitals have been classified in three clusters. The first cluster includes large metro systems, the second one includes small metro networks whereas the third cluster includes metro networks with only one line. The combination of both two methods has been used for the first time in this research. The methodology could be used to evaluate other existing metro networks as well as for preliminary analysis in the design of subway systems.
Differences in graph theory functional connectivity in left and right temporal lobe epilepsy.
Chiang, Sharon; Stern, John M; Engel, Jerome; Levin, Harvey S; Haneef, Zulfi
2014-12-01
To investigate lateralized differences in limbic system functional connectivity between left and right temporal lobe epilepsy (TLE) using graph theory. Interictal resting state fMRI was performed in 14 left TLE patients, 11 right TLE patients, and 12 controls. Graph theory analysis of 10 bilateral limbic regions of interest was conducted. Changes in edgewise functional connectivity, network topology, and regional topology were quantified, and then left and right TLE were compared. Limbic edgewise functional connectivity was predominantly reduced in both left and right TLE. More regional connections were reduced in right TLE, most prominently involving reduced interhemispheric connectivity between the bilateral insula and bilateral hippocampi. A smaller number of limbic connections were increased in TLE, more so in left than in right TLE. Topologically, the most pronounced change was a reduction in average network betweenness centrality and concurrent increase in left hippocampal betweenness centrality in right TLE. In contrast, left TLE exhibited a weak trend toward increased right hippocampal betweenness centrality, with no change in average network betweenness centrality. Limbic functional connectivity is predominantly reduced in both left and right TLE, with more pronounced reductions in right TLE. In contrast, left TLE exhibits both edgewise and topological changes that suggest a tendency toward reorganization. Network changes in TLE and lateralized differences thereof may have important diagnostic and prognostic implications. Published by Elsevier B.V.
PDB2Graph: A toolbox for identifying critical amino acids map in proteins based on graph theory.
Niknam, Niloofar; Khakzad, Hamed; Arab, Seyed Shahriar; Naderi-Manesh, Hossein
2016-05-01
The integrative and cooperative nature of protein structure involves the assessment of topological and global features of constituent parts. Network concept takes complete advantage of both of these properties in the analysis concomitantly. High compatibility to structural concepts or physicochemical properties in addition to exploiting a remarkable simplification in the system has made network an ideal tool to explore biological systems. There are numerous examples in which different protein structural and functional characteristics have been clarified by the network approach. Here, we present an interactive and user-friendly Matlab-based toolbox, PDB2Graph, devoted to protein structure network construction, visualization, and analysis. Moreover, PDB2Graph is an appropriate tool for identifying critical nodes involved in protein structural robustness and function based on centrality indices. It maps critical amino acids in protein networks and can greatly aid structural biologists in selecting proper amino acid candidates for manipulating protein structures in a more reasonable and rational manner. To introduce the capability and efficiency of PDB2Graph in detail, the structural modification of Calmodulin through allosteric binding of Ca(2+) is considered. In addition, a mutational analysis for three well-identified model proteins including Phage T4 lysozyme, Barnase and Ribonuclease HI, was performed to inspect the influence of mutating important central residues on protein activity. Copyright © 2016 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
van der Flier Wiesje M
2009-08-01
Full Text Available Abstract Background Although a large body of knowledge about both brain structure and function has been gathered over the last decades, we still have a poor understanding of their exact relationship. Graph theory provides a method to study the relation between network structure and function, and its application to neuroscientific data is an emerging research field. We investigated topological changes in large-scale functional brain networks in patients with Alzheimer's disease (AD and frontotemporal lobar degeneration (FTLD by means of graph theoretical analysis of resting-state EEG recordings. EEGs of 20 patients with mild to moderate AD, 15 FTLD patients, and 23 non-demented individuals were recorded in an eyes-closed resting-state. The synchronization likelihood (SL, a measure of functional connectivity, was calculated for each sensor pair in 0.5–4 Hz, 4–8 Hz, 8–10 Hz, 10–13 Hz, 13–30 Hz and 30–45 Hz frequency bands. The resulting connectivity matrices were converted to unweighted graphs, whose structure was characterized with several measures: mean clustering coefficient (local connectivity, characteristic path length (global connectivity and degree correlation (network 'assortativity'. All results were normalized for network size and compared with random control networks. Results In AD, the clustering coefficient decreased in the lower alpha and beta bands (p Conclusion With decreasing local and global connectivity parameters, the large-scale functional brain network organization in AD deviates from the optimal 'small-world' network structure towards a more 'random' type. This is associated with less efficient information exchange between brain areas, supporting the disconnection hypothesis of AD. Surprisingly, FTLD patients show changes in the opposite direction, towards a (perhaps excessively more 'ordered' network structure, possibly reflecting a different underlying pathophysiological process.
International Nuclear Information System (INIS)
Nagato, Yasushi; Nagai, Katsuhiko
1993-01-01
Proximity contact N-S double-layer with infinite layer widths is studied in the clean limit. The finite reflection at the interface is taken into account. Starting from a recent theory of finite width double-layer by Ashida et al., the authors obtain explicit expressions for the quasi-classical Green's function which already satisfy the boundary condition and include no exploding terms at infinities. The self-consistent pair potentials are obtained numerically with sufficient accuracy. The Andreev reflection at the N-S interface is discussed on the basis of the self-consistent pair potential. It is shown that there exists a resonance state in a potential valley formed between the depressed pair potential and the partially reflecting interface, which leads to a peak of the Andreev reflection coefficient with the height unity slightly below the bulk superconductor energy gap. They also find general relationship between the Andreev reflection coefficient and the local density of states of the superconductor just at the interface
Jia, Chen
2017-09-01
Here we develop an effective approach to simplify two-time-scale Markov chains with infinite state spaces by removal of states with fast leaving rates, which improves the simplification method of finite Markov chains. We introduce the concept of fast transition paths and show that the effective transitions of the reduced chain can be represented as the superposition of the direct transitions and the indirect transitions via all the fast transition paths. Furthermore, we apply our simplification approach to the standard Markov model of single-cell stochastic gene expression and provide a mathematical theory of random gene expression bursts. We give the precise mathematical conditions for the bursting kinetics of both mRNAs and proteins. It turns out that random bursts exactly correspond to the fast transition paths of the Markov model. This helps us gain a better understanding of the physics behind the bursting kinetics as an emergent behavior from the fundamental multiscale biochemical reaction kinetics of stochastic gene expression.
Superfield perturbation theory and renormalization
International Nuclear Information System (INIS)
Delbourgo, R.
1975-01-01
The perturbation theory graphs and divergences in super-symmetric Lagrangian models are studied by using superfield techniques. In super PHI 3 -theory very little effort is needed to arrive at the single infinite (wave function) renormalization counterterm, while in PHI 4 -theory the method indicates the counter-Lagrangians needed at the one-loop level and possibly beyond
Quantification of three-dimensional cell-mediated collagen remodeling using graph theory.
Bilgin, Cemal Cagatay; Lund, Amanda W; Can, Ali; Plopper, George E; Yener, Bülent
2010-09-30
Cell cooperation is a critical event during tissue development. We present the first precise metrics to quantify the interaction between mesenchymal stem cells (MSCs) and extra cellular matrix (ECM). In particular, we describe cooperative collagen alignment process with respect to the spatio-temporal organization and function of mesenchymal stem cells in three dimensions. We defined two precise metrics: Collagen Alignment Index and Cell Dissatisfaction Level, for quantitatively tracking type I collagen and fibrillogenesis remodeling by mesenchymal stem cells over time. Computation of these metrics was based on graph theory and vector calculus. The cells and their three dimensional type I collagen microenvironment were modeled by three dimensional cell-graphs and collagen fiber organization was calculated from gradient vectors. With the enhancement of mesenchymal stem cell differentiation, acceleration through different phases was quantitatively demonstrated. The phases were clustered in a statistically significant manner based on collagen organization, with late phases of remodeling by untreated cells clustering strongly with early phases of remodeling by differentiating cells. The experiments were repeated three times to conclude that the metrics could successfully identify critical phases of collagen remodeling that were dependent upon cooperativity within the cell population. Definition of early metrics that are able to predict long-term functionality by linking engineered tissue structure to function is an important step toward optimizing biomaterials for the purposes of regenerative medicine.
Quantification of three-dimensional cell-mediated collagen remodeling using graph theory.
Directory of Open Access Journals (Sweden)
Cemal Cagatay Bilgin
2010-09-01
Full Text Available Cell cooperation is a critical event during tissue development. We present the first precise metrics to quantify the interaction between mesenchymal stem cells (MSCs and extra cellular matrix (ECM. In particular, we describe cooperative collagen alignment process with respect to the spatio-temporal organization and function of mesenchymal stem cells in three dimensions.We defined two precise metrics: Collagen Alignment Index and Cell Dissatisfaction Level, for quantitatively tracking type I collagen and fibrillogenesis remodeling by mesenchymal stem cells over time. Computation of these metrics was based on graph theory and vector calculus. The cells and their three dimensional type I collagen microenvironment were modeled by three dimensional cell-graphs and collagen fiber organization was calculated from gradient vectors. With the enhancement of mesenchymal stem cell differentiation, acceleration through different phases was quantitatively demonstrated. The phases were clustered in a statistically significant manner based on collagen organization, with late phases of remodeling by untreated cells clustering strongly with early phases of remodeling by differentiating cells. The experiments were repeated three times to conclude that the metrics could successfully identify critical phases of collagen remodeling that were dependent upon cooperativity within the cell population.Definition of early metrics that are able to predict long-term functionality by linking engineered tissue structure to function is an important step toward optimizing biomaterials for the purposes of regenerative medicine.
The Epstein-Glaser approach to perturbative quantum field theory: graphs and Hopf algebras
International Nuclear Information System (INIS)
Lange, Alexander
2005-01-01
The paper aims at investigating perturbative quantum field theory in the approach of Epstein and Glaser (EG) and, in particular, its formulation in the language of graphs and Hopf algebras (HAs). Various HAs are encountered, each one associated with a special combination of physical concepts such as normalization, localization, pseudounitarity, causal regularization, and renormalization. The algebraic structures, representing the perturbative expansion of the S-matrix, are imposed on operator-valued distributions equipped with appropriate graph indices. Translation invariance ensures the algebras to be analytically well defined and graded total symmetry allows to formulate bialgebras. The algebraic results are given embedded in the corresponding physical framework, covering the two EG versions by Fredenhagen and Scharf that differ with respect to the concrete recursive implementation of causality. Besides, the ultraviolet divergences occurring in Feynman's representation are mathematically reasoned. As a final result, the change of the renormalization scheme in the context of EG is modeled via a HA and interpreted as the EG analog of Kreimer's HA
Infinite permutations vs. infinite words
Directory of Open Access Journals (Sweden)
Anna E. Frid
2011-08-01
Full Text Available I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis et al. permutations appear in a very similar framework as early as in 1977. I am going to tell about periodicity of permutations, their complexity according to several definitions and their automatic properties, that is, about usual parameters of words, now extended to permutations and behaving sometimes similarly to those for words, sometimes not. Another series of results concerns permutations generated by infinite words and their properties. Although this direction of research is young, many people, including two other speakers of this meeting, have participated in it, and I believe that several more topics for further study are really promising.
Development of a new loss allocation method for a hybrid electricity market using graph theory
International Nuclear Information System (INIS)
Lim, Valerie S.C.; McDonald, John D.F.; Saha, Tapan K.
2009-01-01
This paper introduces a new method for allocating losses in a power system using a loop-based representation of system behaviour. Using the new method, network behaviour is formulated as a series of presumed power transfers directly between market participants. In contrast to many existing loss allocation methods, this makes it easier to justify the resulting loss distribution. In addition to circumventing the problems of non-unique loss allocations, a formalised process of loop identification, using graph theory concepts, is introduced. The proposed method is applied to both the IEEE 14-bus system and a modified CIGRE Nordic 32-bus system. The results provide a demonstration of the capability of the proposed method to allocate losses in the hybrid market, and demonstrate the approach's capacity to link the technical performance of the network to market instruments. (author)
Chiu, Stephanie J.; Toth, Cynthia A.; Bowes Rickman, Catherine; Izatt, Joseph A.; Farsiu, Sina
2012-01-01
This paper presents a generalized framework for segmenting closed-contour anatomical and pathological features using graph theory and dynamic programming (GTDP). More specifically, the GTDP method previously developed for quantifying retinal and corneal layer thicknesses is extended to segment objects such as cells and cysts. The presented technique relies on a transform that maps closed-contour features in the Cartesian domain into lines in the quasi-polar domain. The features of interest are then segmented as layers via GTDP. Application of this method to segment closed-contour features in several ophthalmic image types is shown. Quantitative validation experiments for retinal pigmented epithelium cell segmentation in confocal fluorescence microscopy images attests to the accuracy of the presented technique. PMID:22567602
Hart, Michael G; Ypma, Rolf J F; Romero-Garcia, Rafael; Price, Stephen J; Suckling, John
2016-06-01
Neuroanatomy has entered a new era, culminating in the search for the connectome, otherwise known as the brain's wiring diagram. While this approach has led to landmark discoveries in neuroscience, potential neurosurgical applications and collaborations have been lagging. In this article, the authors describe the ideas and concepts behind the connectome and its analysis with graph theory. Following this they then describe how to form a connectome using resting state functional MRI data as an example. Next they highlight selected insights into healthy brain function that have been derived from connectome analysis and illustrate how studies into normal development, cognitive function, and the effects of synthetic lesioning can be relevant to neurosurgery. Finally, they provide a précis of early applications of the connectome and related techniques to traumatic brain injury, functional neurosurgery, and neurooncology.
Topological quantum field theories in terms of coloured graphs associated to quantum groups
International Nuclear Information System (INIS)
Karowski, M.
1993-01-01
Apart from obvious mathematical applications the investigation is motivated by the problem of braid group statistics in physics. Statistics is one of the central concepts in many body quantum systems. Consider a system of two identical particles located at x 1 and x 2 in R d with Schroedinger wave function ψ(x 1 , x 2 ). Under the exchange of particles with these coordinates one usually has Bose or Fermi statistics in case ψ(x 2 , x 1 )=±ψ(x-1,x T 2). For a quick access to the problem consider the following classical geometric space-time description of the exchange of position for two identical particles, reflecting itself in two quantum mechanical transformation laws. We briefly review the set-up of topological quantum field theory and present our new formulation in terms of coloured graphs. (orig.)
Bryant, Victor
1980-01-01
Combinatorics may very loosely be described as that branch of mathematics which is concerned with the problems of arranging objects in accordance with various imposed constraints. It covers a wide range of ideas and because of its fundamental nature it has applications throughout mathematics. Among the well-established areas of combinatorics may now be included the studies of graphs and networks, block designs, games, transversals, and enumeration problem s concerning permutations and combinations, from which the subject earned its title, as weil as the theory of independence spaces (or matroids). Along this broad front,various central themes link together the very diverse ideas. The theme which we introduce in this book is that of the abstract concept of independence. Here the reason for the abstraction is to unify; and, as we sh all see, this unification pays off handsomely with applications and illuminating sidelights in a wide variety of combinatorial situations. The study of combinatorics in general, and...
Directory of Open Access Journals (Sweden)
P. B. Lanjewar
2016-06-01
Full Text Available The evaluation and selection of energy technologies involve a large number of attributes whose selection and weighting is decided in accordance with the social, environmental, technical and economic framework. In the present work an integrated multiple attribute decision making methodology is developed by combining graph theory and analytic hierarchy process methods to deal with the evaluation and selection of energy technologies. The energy technology selection attributes digraph enables a quick visual appraisal of the energy technology selection attributes and their interrelationships. The preference index provides a total objective score for comparison of energy technologies alternatives. Application of matrix permanent offers a better appreciation of the considered attributes and helps to analyze the different alternatives from combinatorial viewpoint. The AHP is used to assign relative weights to the attributes. Four examples of evaluation and selection of energy technologies are considered in order to demonstrate and validate the proposed method.
Bounds on Gromov hyperbolicity constant in graphs
Indian Academy of Sciences (India)
Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.
Infinity subtraction in a quantum field theory of charges and monopoles
International Nuclear Information System (INIS)
Panagiotakopoulos, C.
1982-03-01
Subtraction of ultraviolet infinities in Zwanziger's local quantum field theory of charges and monopoles is described. It involves an infinite number of graphs. The whole programme rests on the assumption that the infinite summations involved do not give rise to pathological situations and the Ward identities are satisfied even after the string cancellations. The resulting finite theory is Lorentz invariant. (author)
A Modal-Logic Based Graph Abstraction
Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.
2008-01-01
Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract
Graphs whose complement and square are isomorphic
DEFF Research Database (Denmark)
Pedersen, Anders Sune
2014-01-01
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...
Stochastic and infinite dimensional analysis
Carpio-Bernido, Maria; Grothaus, Martin; Kuna, Tobias; Oliveira, Maria; Silva, José
2016-01-01
This volume presents a collection of papers covering applications from a wide range of systems with infinitely many degrees of freedom studied using techniques from stochastic and infinite dimensional analysis, e.g. Feynman path integrals, the statistical mechanics of polymer chains, complex networks, and quantum field theory. Systems of infinitely many degrees of freedom create their particular mathematical challenges which have been addressed by different mathematical theories, namely in the theories of stochastic processes, Malliavin calculus, and especially white noise analysis. These proceedings are inspired by a conference held on the occasion of Prof. Ludwig Streit’s 75th birthday and celebrate his pioneering and ongoing work in these fields.
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms
Chen, Pin-Yu; Hero, Alfred O.
2017-01-01
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analys...
International Nuclear Information System (INIS)
Baccetti, Valentina; Visser, Matt
2013-01-01
Even if a probability distribution is properly normalizable, its associated Shannon (or von Neumann) entropy can easily be infinite. We carefully analyze conditions under which this phenomenon can occur. Roughly speaking, this happens when arbitrarily small amounts of probability are dispersed into an infinite number of states; we shall quantify this observation and make it precise. We develop several particularly simple, elementary, and useful bounds, and also provide some asymptotic estimates, leading to necessary and sufficient conditions for the occurrence of infinite Shannon entropy. We go to some effort to keep technical computations as simple and conceptually clear as possible. In particular, we shall see that large entropies cannot be localized in state space; large entropies can only be supported on an exponentially large number of states. We are for the time being interested in single-channel Shannon entropy in the information theoretic sense, not entropy in a stochastic field theory or quantum field theory defined over some configuration space, on the grounds that this simple problem is a necessary precursor to understanding infinite entropy in a field theoretic context. (paper)
Huang, Yun-An; Jastorff, Jan; Van den Stock, Jan; Van de Vliet, Laura; Dupont, Patrick; Vandenbulcke, Mathieu
2018-05-15
Psychological construction models of emotion state that emotions are variable concepts constructed by fundamental psychological processes, whereas according to basic emotion theory, emotions cannot be divided into more fundamental units and each basic emotion is represented by a unique and innate neural circuitry. In a previous study, we found evidence for the psychological construction account by showing that several brain regions were commonly activated when perceiving different emotions (i.e. a general emotion network). Moreover, this set of brain regions included areas associated with core affect, conceptualization and executive control, as predicted by psychological construction models. Here we investigate directed functional brain connectivity in the same dataset to address two questions: 1) is there a common pathway within the general emotion network for the perception of different emotions and 2) if so, does this common pathway contain information to distinguish between different emotions? We used generalized psychophysiological interactions and information flow indices to examine the connectivity within the general emotion network. The results revealed a general emotion pathway that connects neural nodes involved in core affect, conceptualization, language and executive control. Perception of different emotions could not be accurately classified based on the connectivity patterns from the nodes of the general emotion pathway. Successful classification was achieved when connections outside the general emotion pathway were included. We propose that the general emotion pathway functions as a common pathway within the general emotion network and is involved in shared basic psychological processes across emotions. However, additional connections within the general emotion network are required to classify different emotions, consistent with a constructionist account. Copyright © 2018 Elsevier Inc. All rights reserved.
Exclusivity structures and graph representatives of local complementation orbits
Cabello, Adán; Parker, Matthew G.; Scarpa, Giannicola; Severini, Simone
2013-07-01
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lovász number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.
Applications of automata and graphs: Labeling operators in Hilbert space. II
International Nuclear Information System (INIS)
Cho, Ilwoo; Jorgensen, Palle E. T.
2009-01-01
We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A G . These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von Neumann algebras, and an associated fractal group, we prove a classification theorem for representations of automata.
Keown, Christopher L; Datko, Michael C; Chen, Colleen P; Maximo, José Omar; Jahedi, Afrooz; Müller, Ralph-Axel
2017-01-01
Despite abundant evidence of brain network anomalies in autism spectrum disorder (ASD), findings have varied from broad functional underconnectivity to broad overconnectivity. Rather than pursuing overly simplifying general hypotheses ('under' vs. 'over'), we tested the hypothesis of atypical network distribution in ASD (i.e., participation of unusual loci in distributed functional networks). We used a selective high-quality data subset from the ABIDE datashare (including 111 ASD and 174 typically developing [TD] participants) and several graph theory metrics. Resting state functional MRI data were preprocessed and analyzed for detection of low-frequency intrinsic signal correlations. Groups were tightly matched for available demographics and head motion. As hypothesized, the Rand Index (reflecting how similar network organization was to a normative set of networks) was significantly lower in ASD than TD participants. This was accounted for by globally reduced cohesion and density, but increased dispersion of networks. While differences in hub architecture did not survive correction, rich club connectivity (among the hubs) was increased in the ASD group. Our findings support the model of reduced network integration (connectivity with networks) and differentiation (or segregation; based on connectivity outside network boundaries) in ASD. While the findings applied at the global level, they were not equally robust across all networks and in one case (greater cohesion within ventral attention network in ASD) even reversed.
Quantum walks on quotient graphs
International Nuclear Information System (INIS)
Krovi, Hari; Brun, Todd A.
2007-01-01
A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup
Hell, Pavol
2004-01-01
This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an
International Nuclear Information System (INIS)
Barra, F.; Gaspard, P.
2001-01-01
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes
Ren, Jie
2017-12-01
The process by which a kinesin motor couples its ATPase activity with concerted mechanical hand-over-hand steps is a foremost topic of molecular motor physics. Two major routes toward elucidating kinesin mechanisms are the motility performance characterization of velocity and run length, and single-molecular state detection experiments. However, these two sets of experimental approaches are largely uncoupled to date. Here, we introduce an integrative motility state analysis based on a theorized kinetic graph theory for kinesin, which, on one hand, is validated by a wealth of accumulated motility data, and, on the other hand, allows for rigorous quantification of state occurrences and chemomechanical cycling probabilities. An interesting linear scaling for kinesin motility performance across species is discussed as well. An integrative kinetic graph theory analysis provides a powerful tool to bridge motility and state characterization experiments, so as to forge a unified effort for the elucidation of the working mechanisms of molecular motors.
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar
2017-03-06
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Cytoscape.js: a graph theory library for visualisation and analysis.
Franz, Max; Lopes, Christian T; Huck, Gerardo; Dong, Yue; Sumer, Onur; Bader, Gary D
2016-01-15
Cytoscape.js is an open-source JavaScript-based graph library. Its most common use case is as a visualization software component, so it can be used to render interactive graphs in a web browser. It also can be used in a headless manner, useful for graph operations on a server, such as Node.js. Cytoscape.js is implemented in JavaScript. Documentation, downloads and source code are available at http://js.cytoscape.org. gary.bader@utoronto.ca. © The Author 2015. Published by Oxford University Press.
Directory of Open Access Journals (Sweden)
C. Dalfo
2015-10-01
Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.
The planar cubic Cayley graphs
Georgakopoulos, Agelos
2018-01-01
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.
Fuzzy Graph Language Recognizability
Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros
2012-01-01
Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
Directory of Open Access Journals (Sweden)
Ruggero Gramatica
Full Text Available We introduce a methodology to efficiently exploit natural-language expressed biomedical knowledge for repurposing existing drugs towards diseases for which they were not initially intended. Leveraging on developments in Computational Linguistics and Graph Theory, a methodology is defined to build a graph representation of knowledge, which is automatically analysed to discover hidden relations between any drug and any disease: these relations are specific paths among the biomedical entities of the graph, representing possible Modes of Action for any given pharmacological compound. We propose a measure for the likeliness of these paths based on a stochastic process on the graph. This measure depends on the abundance of indirect paths between a peptide and a disease, rather than solely on the strength of the shortest path connecting them. We provide real-world examples, showing how the method successfully retrieves known pathophysiological Mode of Action and finds new ones by meaningfully selecting and aggregating contributions from known bio-molecular interactions. Applications of this methodology are presented, and prove the efficacy of the method for selecting drugs as treatment options for rare diseases.
Gramatica, Ruggero; Di Matteo, T; Giorgetti, Stefano; Barbiani, Massimo; Bevec, Dorian; Aste, Tomaso
2014-01-01
We introduce a methodology to efficiently exploit natural-language expressed biomedical knowledge for repurposing existing drugs towards diseases for which they were not initially intended. Leveraging on developments in Computational Linguistics and Graph Theory, a methodology is defined to build a graph representation of knowledge, which is automatically analysed to discover hidden relations between any drug and any disease: these relations are specific paths among the biomedical entities of the graph, representing possible Modes of Action for any given pharmacological compound. We propose a measure for the likeliness of these paths based on a stochastic process on the graph. This measure depends on the abundance of indirect paths between a peptide and a disease, rather than solely on the strength of the shortest path connecting them. We provide real-world examples, showing how the method successfully retrieves known pathophysiological Mode of Action and finds new ones by meaningfully selecting and aggregating contributions from known bio-molecular interactions. Applications of this methodology are presented, and prove the efficacy of the method for selecting drugs as treatment options for rare diseases.
Bond graph modelling of engineering systems: theory, applications and software support
National Research Council Canada - National Science Library
Borutzky, Wolfgang; Margolis, Donald L
2011-01-01
... way such that analytical or computer response predictions can be straightforwardly carried out. Bond graphs are a concise pictorial representation of all types of interacting energetic systems. In my experience working with engineers on the development of complex systems it is obvious that these systems suffer from thermal problems, structural problems, vibration and noise problems, and control and stability issues that do not fit into a single discipline. Bond graphs provide the link by which all these different ...
Anticipation-related brain connectivity in bipolar and unipolar depression: a graph theory approach.
Manelis, Anna; Almeida, Jorge R C; Stiffler, Richelle; Lockovich, Jeanette C; Aslam, Haris A; Phillips, Mary L
2016-09-01
Bipolar disorder is often misdiagnosed as major depressive disorder, which leads to inadequate treatment. Depressed individuals versus healthy control subjects, show increased expectation of negative outcomes. Due to increased impulsivity and risk for mania, however, depressed individuals with bipolar disorder may differ from those with major depressive disorder in neural mechanisms underlying anticipation processes. Graph theory methods for neuroimaging data analysis allow the identification of connectivity between multiple brain regions without prior model specification, and may help to identify neurobiological markers differentiating these disorders, thereby facilitating development of better therapeutic interventions. This study aimed to compare brain connectivity among regions involved in win/loss anticipation in depressed individuals with bipolar disorder (BDD) versus depressed individuals with major depressive disorder (MDD) versus healthy control subjects using graph theory methods. The study was conducted at the University of Pittsburgh Medical Center and included 31 BDD, 39 MDD, and 36 healthy control subjects. Participants were scanned while performing a number guessing reward task that included the periods of win and loss anticipation. We first identified the anticipatory network across all 106 participants by contrasting brain activation during all anticipation periods (win anticipation + loss anticipation) versus baseline, and win anticipation versus loss anticipation. Brain connectivity within the identified network was determined using the Independent Multiple sample Greedy Equivalence Search (IMaGES) and Linear non-Gaussian Orientation, Fixed Structure (LOFS) algorithms. Density of connections (the number of connections in the network), path length, and the global connectivity direction ('top-down' versus 'bottom-up') were compared across groups (BDD/MDD/healthy control subjects) and conditions (win/loss anticipation). These analyses showed that
International Nuclear Information System (INIS)
Khakzad, Nima; Reniers, Genserik
2015-01-01
Dealing with large quantities of flammable and explosive materials, usually at high-pressure high-temperature conditions, makes process plants very vulnerable to cascading effects compared with other infrastructures. The combination of the extremely low frequency of cascading effects and the high complexity and interdependencies of process plants makes risk assessment and vulnerability analysis of process plants very challenging in the context of such events. In the present study, cascading effects were represented as a directed graph; accordingly, the efficacy of a set of graph metrics and measurements was examined in both unit and plant-wide vulnerability analysis of process plants. We demonstrated that vertex-level closeness and betweenness can be used in the unit vulnerability analysis of process plants for the identification of critical units within a process plant. Furthermore, the graph-level closeness metric can be used in the plant-wide vulnerability analysis for the identification of the most vulnerable plant layout with respect to the escalation of cascading effects. Furthermore, the results from the application of the graph metrics have been verified using a Bayesian network methodology. - Highlights: • Graph metrics can effectively be employed to identify vulnerable units and layouts in process plants. • Units with larger vertex-level closeness result in more probable and severe cascading effects. • Units with larger vertex-level betweenness contribute more to the escalation of cascading effects. • Layouts with larger graph-level closeness are more vulnerable to the escalation of cascading effects
Directory of Open Access Journals (Sweden)
Ferruccio ePanzica
2013-11-01
Full Text Available In the context of focal drug-resistant epilepsies, the surgical resection of the epileptogenic zone (EZ, the cortical region responsible for the onset, early seizures organization and propagation, may be the only therapeutic option for reducing or suppressing seizures. The rather high rate of failure in epilepsy surgery of extra-temporal epilepsies highlights that the precise identification of the EZ, mandatory objective to achieve seizure freedom, is still an unsolved problem that requires more sophisticated methods of investigation.Despite the wide range of non-invasive investigations, intracranial stereo-EEG (SEEG recordings still represent, in many patients, the gold standard for the EZ identification. In this contest, the EZ localization is still based on visual analysis of SEEG, inevitably affected by the drawback of subjectivity and strongly time-consuming. Over the last years, considerable efforts have been made to develop advanced signal analysis techniques able to improve the identification of the EZ. Particular attention has been paid to those methods aimed at quantifying and characterising the interactions and causal relationships between neuronal populations, since is nowadays well assumed that epileptic phenomena are associated with abnormal changes in brain synchronisation mechanisms, and initial evidence has shown the suitability of this approach for the EZ localisation. The aim of this review is to provide an overview of the different EEG signal processing methods applied to study connectivity between distinct brain cortical regions, namely in focal epilepsies. In addition, with the aim of localizing the EZ, the approach based on graph theory will be described, since the study of the topological properties of the networks has strongly improved the study of brain connectivity mechanisms.
Spectral analysis of growing graphs a quantum probability point of view
Obata, Nobuaki
2017-01-01
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) spectr...
Knopp, Konrad
1956-01-01
One of the finest expositors in the field of modern mathematics, Dr. Konrad Knopp here concentrates on a topic that is of particular interest to 20th-century mathematicians and students. He develops the theory of infinite sequences and series from its beginnings to a point where the reader will be in a position to investigate more advanced stages on his own. The foundations of the theory are therefore presented with special care, while the developmental aspects are limited by the scope and purpose of the book. All definitions are clearly stated; all theorems are proved with enough detail to ma
Simplicial complexes of graphs
Jonsson, Jakob
2008-01-01
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
Introduction to quantum graphs
Berkolaiko, Gregory
2012-01-01
A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...
A new characterization of trivially perfect graphs
Directory of Open Access Journals (Sweden)
Christian Rubio Montiel
2015-03-01
Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Directory of Open Access Journals (Sweden)
Katona Gyula Y.
2014-11-01
Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs
2013-06-28
3380. [DEL12a] Xavier Desquesnes, Abderrahim Elmoataz, and Olivier Lézoray, Eikonal equation adapta- tion on weighted graphs: Fast geometric diffusion...Abderrahim Elmoataz, Olivier Lézoray, and Vinh-Thong Ta, Efficient algorithms for image and high dimensional data processing using eikonal equation on
Weakly infinite-dimensional spaces
International Nuclear Information System (INIS)
Fedorchuk, Vitalii V
2007-01-01
In this survey article two new classes of spaces are considered: m-C-spaces and w-m-C-spaces, m=2,3,...,∞. They are intermediate between the class of weakly infinite-dimensional spaces in the Alexandroff sense and the class of C-spaces. The classes of 2-C-spaces and w-2-C-spaces coincide with the class of weakly infinite-dimensional spaces, while the compact ∞-C-spaces are exactly the C-compact spaces of Haver. The main results of the theory of weakly infinite-dimensional spaces, including classification via transfinite Lebesgue dimensions and Luzin-Sierpinsky indices, extend to these new classes of spaces. Weak m-C-spaces are characterised by means of essential maps to Henderson's m-compacta. The existence of hereditarily m-strongly infinite-dimensional spaces is proved.
Doucet, Gaelle E; Rider, Robert; Taylor, Nathan; Skidmore, Christopher; Sharan, Ashwini; Sperling, Michael; Tracy, Joseph I
2015-04-01
This study determined the ability of resting-state functional connectivity (rsFC) graph-theory measures to predict neurocognitive status postsurgery in patients with temporal lobe epilepsy (TLE) who underwent anterior temporal lobectomy (ATL). A presurgical resting-state functional magnetic resonance imaging (fMRI) condition was collected in 16 left and 16 right TLE patients who underwent ATL. In addition, patients received neuropsychological testing pre- and postsurgery in verbal and nonverbal episodic memory, language, working memory, and attention domains. Regarding the functional data, we investigated three graph-theory properties (local efficiency, distance, and participation), measuring segregation, integration and centrality, respectively. These measures were only computed in regions of functional relevance to the ictal pathology, or the cognitive domain. Linear regression analyses were computed to predict the change in each neurocognitive domain. Our analyses revealed that cognitive outcome was successfully predicted with at least 68% of the variance explained in each model, for both TLE groups. The only model not significantly predictive involved nonverbal episodic memory outcome in right TLE. Measures involving the healthy hippocampus were the most common among the predictors, suggesting that enhanced integration of this structure with the rest of the brain may improve cognitive outcomes. Regardless of TLE group, left inferior frontal regions were the best predictors of language outcome. Working memory outcome was predicted mostly by right-sided regions, in both groups. Overall, the results indicated our integration measure was the most predictive of neurocognitive outcome. In contrast, our segregation measure was the least predictive. This study provides evidence that presurgery rsFC measures may help determine neurocognitive outcomes following ATL. The results have implications for refining our understanding of compensatory reorganization and predicting
International Nuclear Information System (INIS)
Campolongo, Francesca; Braddock, Roger
1999-01-01
Sensitivity analysis screening methods aim to isolate the most important factors in experiments involving a large number of significant factors and interactions. This paper extends the one-factor-at-a-time screening method proposed by Morris. The new method, in addition to the 'overall' sensitivity measures already provided by the traditional Morris method, offers estimates of the two-factor interaction effects. The number of model evaluations required is O(k 2 ), where k is the number of model input factors. The efficient sampling strategy in the parameter space is based on concepts of graph theory and on the solution of the 'handcuffed prisoner problem'
Approach to equilibrium in infinite quantum systems
International Nuclear Information System (INIS)
Haag, R.
1975-01-01
Ergodic theory of infinite quantum systems is discussed. The framework of this theory is based in an algebra of quasi-local observables. Nonrelativistic situation, i.e., Galilei invariance and Clifford algebra, is used [pt
Directory of Open Access Journals (Sweden)
Gabriel Kocevar
2016-10-01
Full Text Available Purpose: In this work, we introduce a method to classify Multiple Sclerosis (MS patients into four clinical profiles using structural connectivity information. For the first time, we try to solve this question in a fully automated way using a computer-based method. The main goal is to show how the combination of graph-derived metrics with machine learning techniques constitutes a powerful tool for a better characterization and classification of MS clinical profiles.Materials and methods: Sixty-four MS patients (12 Clinical Isolated Syndrome (CIS, 24 Relapsing Remitting (RR, 24 Secondary Progressive (SP, and 17 Primary Progressive (PP along with 26 healthy controls (HC underwent MR examination. T1 and diffusion tensor imaging (DTI were used to obtain structural connectivity matrices for each subject. Global graph metrics, such as density and modularity, were estimated and compared between subjects’ groups. These metrics were further used to classify patients using tuned Support Vector Machine (SVM combined with Radial Basic Function (RBF kernel.Results: When comparing MS patients to HC subjects, a greater assortativity, transitivity and characteristic path length as well as a lower global efficiency were found. Using all graph metrics, the best F-Measures (91.8%, 91.8%, 75.6% and 70.6% were obtained for binary (HC-CIS, CIS-RR, RR-PP and multi-class (CIS-RR-SP classification tasks, respectively. When using only one graph metric, the best F-Measures (83.6%, 88.9% and 70.7% were achieved for modularity with previous binary classification tasks.Conclusion: Based on a simple DTI acquisition associated with structural brain connectivity analysis, this automatic method allowed an accurate classification of different MS patients’ clinical profiles.
Chartrand, Gary; Zhang, Ping
2010-01-01
Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...
Garat, Alcides
How complex numbers get into play in a non-trivial way in real theories of gravitation is relevant since in a unified structure they should be able to relate in a natural way with quantum theories. For a long time this issue has been lingering on both relativistic formulations and quantum theories. We will analyze this fundamental subject under the light of new group isomorphism theorems linking local internal groups of transformations and local groups of spacetime transformations. The bridge between these two kinds of transformations is represented by new tetrads introduced previously. It is precisely through these local tetrad structures that we will provide a non-trivial answer to this old issue. These new tetrads have two fundamental building components, the skeletons and the gauge vectors. It is these constructive elements that provide the mathematical support that allows to prove group isomorphism theorems. In addition to this, we will prove a unique new property, the infinite tetrad nesting, alternating the nesting with non-Abelian tetrads in the construction of the tetrad gauge vectors. As an application we will demonstrate an alternative proof of a new group isomorphism theorem.
Comparing Structural Brain Connectivity by the Infinite Relational Model
DEFF Research Database (Denmark)
Ambrosen, Karen Marie Sandø; Herlau, Tue; Dyrby, Tim
2013-01-01
The growing focus in neuroimaging on analyzing brain connectivity calls for powerful and reliable statistical modeling tools. We examine the Infinite Relational Model (IRM) as a tool to identify and compare structure in brain connectivity graphs by contrasting its performance on graphs from...
Optimal Infinite Runs in One-Clock Priced Timed Automata
DEFF Research Database (Denmark)
David, Alexandre; Ejsing-Duun, Daniel; Fontani, Lisa
We address the problem of finding an infinite run with the optimal cost-time ratio in a one-clock priced timed automaton and pro- vide an algorithmic solution. Through refinements of the quotient graph obtained by strong time-abstracting bisimulation partitioning, we con- struct a graph with time...
Endriss, U.; Grandi, U.
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference
A new paradigm for particle tracking velocimetry, based on graph-theory and pulsed neural network
International Nuclear Information System (INIS)
Derou, D.; Herault, L.
1994-01-01
The Particle Tracking Velocimetry (PTV) technique works by recording, at different instances in time, positions of small tracers particles following a flow and illuminated by a sheet, or pseudo sheet, of light. It aims to recognize each particle trajectory, constituted of n different spots and determine thus each particle velocity vector. In this paper, we devise a new method, taking into account a global consistency of the trajectories to be extracted, in terms of visual perception and physical properties. It is based on a graph-theoretic formulation of the particle tracking problem and the use of an original neural network, called pulsed neural network. (authors). 4 figs
KLN theorem and infinite statistics
International Nuclear Information System (INIS)
Grandou, T.
1992-01-01
The possible extension of the Kinoshita-Lee-Nauenberg (KLN) theorem to the case of infinite statistics is examined. It is shown that it appears as a stable structure in a quantum field theory context. The extension is provided by working out the Fock space realization of a 'quantum algebra'. (author) 2 refs
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache
2016-01-01
In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.
Automatic Assignment of Methyl-NMR Spectra of Supramolecular Machines Using Graph Theory.
Pritišanac, Iva; Degiacomi, Matteo T; Alderson, T Reid; Carneiro, Marta G; Ab, Eiso; Siegal, Gregg; Baldwin, Andrew J
2017-07-19
Methyl groups are powerful probes for the analysis of structure, dynamics and function of supramolecular assemblies, using both solution- and solid-state NMR. Widespread application of the methodology has been limited due to the challenges associated with assigning spectral resonances to specific locations within a biomolecule. Here, we present Methyl Assignment by Graph Matching (MAGMA), for the automatic assignment of methyl resonances. A graph matching protocol examines all possibilities for each resonance in order to determine an exact assignment that includes a complete description of any ambiguity. MAGMA gives 100% accuracy in confident assignments when tested against both synthetic data, and 9 cross-validated examples using both solution- and solid-state NMR data. We show that this remarkable accuracy enables a user to distinguish between alternative protein structures. In a drug discovery application on HSP90, we show the method can rapidly and efficiently distinguish between possible ligand binding modes. By providing an exact and robust solution to methyl resonance assignment, MAGMA can facilitate significantly accelerated studies of supramolecular machines using methyl-based NMR spectroscopy.
Foodsheds in Virtual Water Flow Networks: A Spectral Graph Theory Approach
Directory of Open Access Journals (Sweden)
Nina Kshetry
2017-06-01
Full Text Available A foodshed is a geographic area from which a population derives its food supply, but a method to determine boundaries of foodsheds has not been formalized. Drawing on the food–water–energy nexus, we propose a formal network science definition of foodsheds by using data from virtual water flows, i.e., water that is virtually embedded in food. In particular, we use spectral graph partitioning for directed graphs. If foodsheds turn out to be geographically compact, it suggests the food system is local and therefore reduces energy and externality costs of food transport. Using our proposed method we compute foodshed boundaries at the global-scale, and at the national-scale in the case of two of the largest agricultural countries: India and the United States. Based on our determination of foodshed boundaries, we are able to better understand commodity flows and whether foodsheds are contiguous and compact, and other factors that impact environmental sustainability. The formal method we propose may be used more broadly to study commodity flows and their impact on environmental sustainability.
Fundamentals of algebraic graph transformation
Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele
2006-01-01
Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...
Li, Zhigang; Shi, Zhongping; Li, Xin
2014-05-01
Several fermentations with consecutively feeding of acetate/butyrate were conducted in a 7 L fermentor and the results indicated that exogenous acetate/butyrate enhanced solvents productivities by 47.1% and 39.2% respectively, and changed butyrate/acetate ratios greatly. Then extracellular butyrate/acetate ratios were utilized for calculation of acids rates and the results revealed that acetate and butyrate formation pathways were almost blocked by corresponding acids feeding. In addition, models for acetate/butyrate feeding fermentations were constructed by graph theory based on calculation results and relevant reports. Solvents concentrations and butanol/acetone ratios of these fermentations were also calculated and the results of models calculation matched fermentation data accurately which demonstrated that models were constructed in a reasonable way. Copyright © 2014 Elsevier Ltd. All rights reserved.
Rao, R Venkata
2013-01-01
Decision Making in Manufacturing Environment Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods presents the concepts and details of applications of MADM methods. A range of methods are covered including Analytic Hierarchy Process (AHP), Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), VIšekriterijumsko KOmpromisno Rangiranje (VIKOR), Data Envelopment Analysis (DEA), Preference Ranking METHod for Enrichment Evaluations (PROMETHEE), ELimination Et Choix Traduisant la Realité (ELECTRE), COmplex PRoportional ASsessment (COPRAS), Grey Relational Analysis (GRA), UTility Additive (UTA), and Ordered Weighted Averaging (OWA). The existing MADM methods are improved upon and three novel multiple attribute decision making methods for solving the decision making problems of the manufacturing environment are proposed. The concept of integrated weights is introduced in the proposed subjective and objective integrated weights (SOIW) method and the weighted Euclidean distance ba...
Agravity up to infinite energy
Energy Technology Data Exchange (ETDEWEB)
Salvio, Alberto [CERN, Theoretical Physics Department, Geneva (Switzerland); Strumia, Alessandro [Dipartimento di Fisica, Universita di Pisa (Italy); INFN, Pisa (Italy)
2018-02-15
The self-interactions of the conformal mode of the graviton are controlled, in dimensionless gravity theories (agravity), by a coupling f{sub 0} that is not asymptotically free. We show that, nevertheless, agravity can be a complete theory valid up to infinite energy. When f{sub 0} grows to large values, the conformal mode of the graviton decouples from the rest of the theory and does not hit any Landau pole provided that scalars are asymptotically conformally coupled and all other couplings approach fixed points. Then agravity can flow to conformal gravity at infinite energy. We identify scenarios where the Higgs mass does not receive unnaturally large physical corrections. We also show a useful equivalence between agravity and conformal gravity plus two extra conformally coupled scalars, and we give a simpler form for the renormalization group equations of dimensionless couplings as well as of massive parameters in the presence of the most general matter sector. (orig.)
A Study towards Building An Optimal Graph Theory Based Model For The Design of Tourism Website
Panigrahi, Goutam; Das, Anirban; Basu, Kajla
2010-10-01
Effective tourism website is a key to attract tourists from different parts of the world. Here we identify the factors of improving the effectiveness of website by considering it as a graph, where web pages including homepage are the nodes and hyperlinks are the edges between the nodes. In this model, the design constraints for building a tourism website are taken into consideration. Our objectives are to build a framework of an effective tourism website providing adequate level of information, service and also to enable the users to reach to the desired page by spending minimal loading time. In this paper an information hierarchy specifying the upper limit of outgoing link of a page has also been proposed. Following the hierarchy, the web developer can prepare an effective tourism website. Here loading time depends on page size and network traffic. We have assumed network traffic as uniform and the loading time is directly proportional with page size. This approach is done by quantifying the link structure of a tourism website. In this approach we also propose a page size distribution pattern of a tourism website.
An Analysis of the Influence of Graph Theory When Preparing for Programming Contests
Directory of Open Access Journals (Sweden)
Cristina Jordán
2017-01-01
Full Text Available The subject known as Programming Contests in the Bachelor’s Degree in Computer Engineering course focuses on solving programming problems frequently met within contests such as the Southwest Europe Regional Contest (SWERC. In order to solve these problems one first needs to model the problem correctly, find the ideal solution, and then be able to program it without making any mistakes in a very short period of time. Leading multinationals such as Google, Apple, IBM, Facebook and Microsoft place a very high value on these abilities when selecting candidates for posts in their companies. In this communication we present some preliminary results of an analysis of the interaction between two optional subjects in the Computer Science Degree course: Programming Contests (PC and Graphs, Models and Applications (GMA. The results of this analysis enabled us to make changes to some of the contents in GMA in order to better prepare the students to deal with the challenges they have to face in programming contests.
A systematic composite service design modeling method using graph-based theory.
Elhag, Arafat Abdulgader Mohammed; Mohamad, Radziah; Aziz, Muhammad Waqar; Zeshan, Furkh
2015-01-01
The composite service design modeling is an essential process of the service-oriented software development life cycle, where the candidate services, composite services, operations and their dependencies are required to be identified and specified before their design. However, a systematic service-oriented design modeling method for composite services is still in its infancy as most of the existing approaches provide the modeling of atomic services only. For these reasons, a new method (ComSDM) is proposed in this work for modeling the concept of service-oriented design to increase the reusability and decrease the complexity of system while keeping the service composition considerations in mind. Furthermore, the ComSDM method provides the mathematical representation of the components of service-oriented design using the graph-based theoryto facilitate the design quality measurement. To demonstrate that the ComSDM method is also suitable for composite service design modeling of distributed embedded real-time systems along with enterprise software development, it is implemented in the case study of a smart home. The results of the case study not only check the applicability of ComSDM, but can also be used to validate the complexity and reusability of ComSDM. This also guides the future research towards the design quality measurement such as using the ComSDM method to measure the quality of composite service design in service-oriented software system.
Abnormal brain white matter network in young smokers: a graph theory analysis study.
Zhang, Yajuan; Li, Min; Wang, Ruonan; Bi, Yanzhi; Li, Yangding; Yi, Zhang; Liu, Jixin; Yu, Dahua; Yuan, Kai
2018-04-01
Previous diffusion tensor imaging (DTI) studies had investigated the white matter (WM) integrity abnormalities in some specific fiber bundles in smokers. However, little is known about the changes in topological organization of WM structural network in young smokers. In current study, we acquired DTI datasets from 58 male young smokers and 51 matched nonsmokers and constructed the WM networks by the deterministic fiber tracking approach. Graph theoretical analysis was used to compare the topological parameters of WM network (global and nodal) and the inter-regional fractional anisotropy (FA) weighted WM connections between groups. The results demonstrated that both young smokers and nonsmokers had small-world topology in WM network. Further analysis revealed that the young smokers exhibited the abnormal topological organization, i.e., increased network strength, global efficiency, and decreased shortest path length. In addition, the increased nodal efficiency predominately was located in frontal cortex, striatum and anterior cingulate gyrus (ACG) in smokers. Moreover, based on network-based statistic (NBS) approach, the significant increased FA-weighted WM connections were mainly found in the PFC, ACG and supplementary motor area (SMA) regions. Meanwhile, the network parameters were correlated with the nicotine dependence severity (FTND) scores, and the nodal efficiency of orbitofrontal cortex was positive correlation with the cigarette per day (CPD) in young smokers. We revealed the abnormal topological organization of WM network in young smokers, which may improve our understanding of the neural mechanism of young smokers form WM topological organization level.
Highlighting the Structure-Function Relationship of the Brain with the Ising Model and Graph Theory
Directory of Open Access Journals (Sweden)
T. K. Das
2014-01-01
Full Text Available With the advent of neuroimaging techniques, it becomes feasible to explore the structure-function relationships in the brain. When the brain is not involved in any cognitive task or stimulated by any external output, it preserves important activities which follow well-defined spatial distribution patterns. Understanding the self-organization of the brain from its anatomical structure, it has been recently suggested to model the observed functional pattern from the structure of white matter fiber bundles. Different models which study synchronization (e.g., the Kuramoto model or global dynamics (e.g., the Ising model have shown success in capturing fundamental properties of the brain. In particular, these models can explain the competition between modularity and specialization and the need for integration in the brain. Graphing the functional and structural brain organization supports the model and can also highlight the strategy used to process and organize large amount of information traveling between the different modules. How the flow of information can be prevented or partially destroyed in pathological states, like in severe brain injured patients with disorders of consciousness or by pharmacological induction like in anaesthesia, will also help us to better understand how global or integrated behavior can emerge from local and modular interactions.
International Nuclear Information System (INIS)
Connes, A.; Kreimer, D.
2000-01-01
This paper gives a complete selfcontained proof of our result (1999) showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on the Riemann-Hilbert problem. We shall first show that for any quantum field theory, the combinatorics of Feynman graphs gives rise to a Hopf algebra H which is commutative asan algebra. It is the dual Hopf algebra of the enveloping algebra of a Lie algebra G whose basis is labelled by the one particle irreducible Feynman graphs. The Lie bracket of two such graphs is computed from insertions of one graph in the other and vice versa. The corresponding Lie group G is the group of characters of H. We show then that, using dimensional regularization, the bare (unrenormalized) theory gives rise to a loop γ(z) element of G, z element of C, where C is a small circle of complex dimensions around the integer dimension D of space-time. Our main result is that the renormalized theory is just the evaluation at z=D of the holomorphic part γ + of the Birkhoff decomposition of γ. We begin to analyse the group G and show that it is a semi-direct product of an easily understood abelian group by a highly non-trivial group closely tied up with groups of diffeomorphisms. (orig.)
Generalized connectivity of graphs
Li, Xueliang
2016-01-01
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
Some remarks on definability of process graphs
Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.
2006-01-01
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or
Hybrid Model For Reverberant Indoor Radio Channels Using Rays and Graphs
DEFF Research Database (Denmark)
Steinböck, Gerhard; Gan, Mingming; Meissner, Paul
2016-01-01
efficient calculation of the channel transfer function considering infinitely many components. We use ray-tracing and the theory of room electromagnetics to obtain the parameter settings for the propagation graph. Thus the proposed hybrid model does not require new or additional parameters in comparison...... to ray-tracing. Simulation results show good agreement with measurements with respect to the inclusion of the diffuse tail in both the delay power spectrum and the azimuth delay power spectrum....
Zhou, Chaoyang; Hu, Xiaofei; Hu, Jun; Liang, Minglong; Yin, Xuntao; Chen, Lin; Zhang, Jiuquan; Wang, Jian
2016-01-01
Amyotrophic lateral sclerosis (ALS) is a rare degenerative disorder characterized by loss of upper and lower motor neurons. Neuroimaging has provided noticeable evidence that ALS is a complex disease, and shown that anatomical and functional lesions extend beyond precentral cortices and corticospinal tracts, to include the corpus callosum; frontal, sensory, and premotor cortices; thalamus; and midbrain. The aim of this study is to investigate graph theory-based functional network abnormalities at voxel-wise level in ALS patients on a whole brain scale. Forty-three ALS patients and 44 age- and sex-matched healthy volunteers were enrolled. The voxel-wise network degree centrality (DC), a commonly employed graph-based measure of network organization, was used to characterize the alteration of whole brain functional network. Compared with the controls, the ALS patients showed significant increase of DC in the left cerebellum posterior lobes, bilateral cerebellum crus, bilateral occipital poles, right orbital frontal lobe, and bilateral prefrontal lobes; significant decrease of DC in the bilateral primary motor cortex, bilateral sensory motor region, right prefrontal lobe, left bilateral precuneus, bilateral lateral temporal lobes, left cingulate cortex, and bilateral visual processing cortex. The DC's z-scores of right inferior occipital gyrus were significant negative correlated with the ALSFRS-r scores. Our findings confirm that the regions with abnormal network DC in ALS patients were located in multiple brain regions including primary motor, somatosensory and extra-motor areas, supporting the concept that ALS is a multisystem disorder. Specifically, our study found that DC in the visual areas was altered and ALS patients with higher DC in right inferior occipital gyrus have more severity of disease. The result demonstrated that the altered DC value in this region can probably be used to assess severity of ALS.
Directory of Open Access Journals (Sweden)
Chaoyang eZhou
2016-05-01
Full Text Available Amyotrophic lateral sclerosis (ALS is a rare degenerative disorder characterized by loss of upper and lower motor neurons. Neuroimaging has provided noticeable evidence that ALS is a complex disease, and shown that anatomical and functional lesions extend beyond precentral cortices and corticospinal tracts, to include the corpus callosum; frontal, sensory, and premotor cortices; thalamus; and midbrain. The aim of this study is to investigate graph theory-based functional network abnormalities at voxel-wise level in ALS patients on a whole brain scale. Forty-three ALS patients and 44 age- and sex- matched healthy volunteers were enrolled. The voxel-wise network degree centrality (DC, a commonly employed graph-based measure of network organization, was used to characterize the alteration of whole brain functional network. Compared with the controls, the ALS patients showed significant increase of DC in the left cerebellum posterior lobes, bilateral cerebellum crus, bilateral occipital poles, right orbital frontal lobe and bilateral prefrontal lobes; significant decrease of DC in the bilateral primary motor cortex, bilateral sensory motor region, right prefrontal lobe, left bilateral precuneus, bilateral lateral temporal lobes, left cingulate cortex, and bilateral visual processing cortex. The DC’s z-scores of right inferior occipital gyrus were significant negative correlated with the ALSFRS-r scores. Our findings confirm that the regions with abnormal network DC in ALS patients were located in multiple brain regions including primary motor, somatosensory and extra-motor areas, supporting the concept that ALS is a multisystem disorder. Specifically, our study found that DC in the visual areas was altered and ALS patients with higher DC in right inferior occipital gyrus have more severity of disease. The result demonstrated that the altered DC value in this region can probably be used to assess severity of ALS.
Density conditions for triangles in multipartite graphs
DEFF Research Database (Denmark)
Bondy, Adrian; Shen, Jin; Thomassé, Stephan
2006-01-01
subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has...... a triangle, provided that the edge density between any two parts is greater than 1/2....
On infinitely divisible semimartingales
DEFF Research Database (Denmark)
Basse-O'Connor, Andreas; Rosiński, Jan
2015-01-01
to non Gaussian infinitely divisible processes. First we show that the class of infinitely divisible semimartingales is so large that the natural analog of Stricker's theorem fails to hold. Then, as the main result, we prove that an infinitely divisible semimartingale relative to the filtration generated...... by a random measure admits a unique decomposition into an independent increment process and an infinitely divisible process of finite variation. Consequently, the natural analog of Stricker's theorem holds for all strictly representable processes (as defined in this paper). Since Gaussian processes...... are strictly representable due to Hida's multiplicity theorem, the classical Stricker's theorem follows from our result. Another consequence is that the question when an infinitely divisible process is a semimartingale can often be reduced to a path property, when a certain associated infinitely divisible...
On the discrete spectrum of the Dirac operator on bent chain quantum graph
Directory of Open Access Journals (Sweden)
Belov Michail
2017-01-01
Full Text Available We study Dirac operators on an infinite quantum graph of a bent chain form which consists of identical rings connected at the touching points by δ-couplings with a parameter α ∈ ℝ. We are interested in the discrete spectrum of the corresponding Hamiltonian. It can be non-empty due to a local (geometrical perturbation of the corresponding infinite chain of rings. The quantum graph of analogous geometry with the Schrodinger operator on the edges was considered by Duclos, Exner and Turek in 2008. They showed that the absence of δ-couplings at vertices (i.e. the Kirchhoff condition at the vertices lead to the absence of eigenvalues. We consider the relativistic particle (the Dirac operator instead of the Schrodinger one but the result is analogous. Quantum graphs of such type are suitable for description of grapheme-based nanostructures. It is established that the negativity of α is the necessary and sufficient condition for the existence of eigenvalues of the Dirac operator (i.e. the discrete spectrum of the Hamiltonian in this case is not empty. The continuous spectrum of the Hamiltonian for bent chain graph coincides with that for the corresponding straight infinite chain. Conditions for appearance of more than one eigenvalue are obtained. It is related to the bending angle. The investigation is based on the transfer-matrix approach. It allows one to reduce the problem to an algebraic task. δ-couplings was introduced by the operator extensions theory method.
Eulerian Graphs and Related Topics
Fleischner, Herbert
1990-01-01
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a
Energy Technology Data Exchange (ETDEWEB)
Kasselmann, S., E-mail: s.kasselmann@fz-juelich.de [Forschungszentrum Jülich, 52425 Jülich (Germany); Schitthelm, O. [Forschungszentrum Jülich, 52425 Jülich (Germany); Tantillo, F. [Forschungszentrum Jülich, 52425 Jülich (Germany); Institute for Reactor Safety and Reactor Technology, RWTH-Aachen, 52064 Aachen (Germany); Scholthaus, S.; Rössel, C. [Forschungszentrum Jülich, 52425 Jülich (Germany); Allelein, H.-J. [Forschungszentrum Jülich, 52425 Jülich (Germany); Institute for Reactor Safety and Reactor Technology, RWTH-Aachen, 52064 Aachen (Germany)
2016-09-15
The problem of calculating the amounts of a coupled nuclide system varying with time especially when exposed to a neutron flux is a well-known problem and has been addressed by a number of computer codes. These codes cover a broad spectrum of applications, are based on comprehensive validation work and are therefore justifiably renowned among their users. However, due to their long development history, they are lacking a modern interface, which impedes a fast and robust internal coupling to other codes applied in the field of nuclear reactor physics. Therefore a project has been initiated to develop a new object-oriented nuclide transmutation code. It comprises an innovative solver based on graph theory, which exploits the topology of nuclide chains and therefore speeds up the calculation scheme. Highest priority has been given to the existence of a generic software interface well as an easy handling by making use of XML files for the user input. In this paper we report on the status of the code development and present first benchmark results, which prove the applicability of the selected approach.
International Nuclear Information System (INIS)
Kasselmann, S.; Scholthaus, S.; Rössel, C.; Allelein, H.-J.
2014-01-01
The problem of calculating the amounts of a coupled nuclide system varying with time especially when exposed to a neutron flux is a well-known problem and has been addressed by a number of computer codes. These codes cover a broad spectrum of applications, are based on comprehensive validation work and are therefore justifiably renowned among their users. However, due to their long development history, they are lacking a modern interface, which impedes a fast and robust internal coupling to other codes applied in the field of nuclear reactor physics. Therefore a project has been initiated to develop a new object-oriented nuclide transmutation code. It comprises an innovative solver based on graph theory, which exploits the topology of nuclide chains. This allows to always deal with the smallest nuclide system for the problem of interest. Highest priority has been given to the existence of a generic software interfaces well as an easy handling by making use of XML files for input and output. In this paper we report on the status of the code development and present first benchmark results, which prove the applicability of the selected approach. (author)
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
van der Hofstad, Remco; Kliem, Sandra; van Leeuwaarden, Johan S. H.
2018-04-01
Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299-2361, 2012). It was proved that when the degrees obey a power law with exponent τ \\in (3,4), the sequence of clusters ordered in decreasing size and multiplied through by n^{-(τ -2)/(τ -1)} converges as n→ ∞ to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237-269, 2001) for the Erdős-Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.
Quark ensembles with infinite correlation length
Molodtsov, S. V.; Zinovjev, G. M.
2014-01-01
By studying quark ensembles with infinite correlation length we formulate the quantum field theory model that, as we show, is exactly integrable and develops an instability of its standard vacuum ensemble (the Dirac sea). We argue such an instability is rooted in high ground state degeneracy (for 'realistic' space-time dimensions) featuring a fairly specific form of energy distribution, and with the cutoff parameter going to infinity this inherent energy distribution becomes infinitely narrow...
Directory of Open Access Journals (Sweden)
Amedeo Ganciu
2018-02-01
Full Text Available The distribution of services across a territory generates daily commuting flows, which have a significant influence on the development of the territory and often causes congestion in large areas. This negatively affects the environmental, economic and social components of the metropolitan landscape. Using the graph theory, we constructed and analyzed various (in typologies of transportation and moving time flow networks in the two main Italian metropolitan areas: Rome (MCR and Milan (MCM. The analysis of these networks provided us with strategic information on the dynamics of the two urban macro-systems. In particular, the aim of our study was to: (i identify the characteristics, distribution and direction of the main attractive forces within the regional systems under study; (ii identify the main differences in size and structure of commuter networks between the two metropolitan areas and between the two regional systems that include the two mother cities; and, (iii identify the main differences in the size and structure of the two commuting networks by transport modes (private, public, non-motorized mobility and the travel time. The results highlighted significant differences between the two case studies regarding volume flows, complexity and structure networks, and the spatial extension of the territories that are governed by the two metropolitan areas. MCR is a strongly monocentric urban system with a regional influence centred on the mother city of Rome, while MCM is a diffused polycentric regional metropolitan system centred on multiple mother cities. The findings many have a role in urban planning choices and in the evaluation of policies aimed to favor sustainable mobility.
Directory of Open Access Journals (Sweden)
Marie-Christine eOttet
2013-09-01
Full Text Available Schizophrenia is postulated to be the prototypical dysconnection disorder, in which hallucinations are the core symptom. Due to high heterogeneity in methodology across studies and the clinical phenotype, it remains unclear whether the structural brain dysconnection is global or focal and if clinical symptoms result from this dysconnection. In the present work, we attempt to clarify this issue by studying a population considered as a homogeneous genetic sub-type of schizophrenia, namely the 22q11.2 deletion syndrome (22q11.2DS. Cerebral MRIs were acquired for 46 patients and 48 age and gender matched controls (aged 6 to 26, respectively mean age = 15.20 ± 4.53 and 15.28 ± 4.35 years old. Using the Connectome mapper pipeline (connectomics.org that combines structural and diffusion MRI, we created a whole brain network for each individual. The graph theory was used to quantify the global and local properties in the brain network organization for each participant. A global degree loss of 6% was found in patients’ network along with an increased Characteristic Path Length. After identifying and comparing hubs, a significant loss of degree in patients’ hubs was found in 58% of them. Based on Allen’s brain network model for hallucinations, we explored the association between local efficiency and symptom severity. Negative correlations were found in the Broca’s area (p<0.004, the Wernicke area (p<0.023 and a positive correlation was found in the dorsolateral prefrontal cortex (DLPFC (p<0.014. In line with the dysconnection findings in schizophrenia, our results provide preliminary evidence for a targeted alteration in the brain network hubs’organisation in individuals with a genetic risk for schizophrenia. The study of specific disorganization in language, speech and thought regulation networks sharing similar network properties may help to understand their role in the hallucination mechanism.
Butler, William E; Atai, Nadia; Carter, Bob; Hochberg, Fred
2014-01-01
The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs) found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies in other fields. The informatic system provides specimen inventory tracking with bar codes assigned to specimens and containers and projects, is hosted on globalized cloud computing resources, and embeds a suite of shared documents, calendars, and video-conferencing features. Clinical data are recorded in relation to molecular EV attributes and may be tagged with terms drawn from a network of externally maintained ontologies thus offering expansion of the system as the field matures. We fashioned the graphical user interface (GUI) around a web-based data visualization package. This system is now in an early stage of deployment, mainly focused on specimen tracking and clinical, laboratory, and imaging data capture in support of studies to optimize detection and analysis of brain tumour-specific mutations. It currently includes 4,392 specimens drawn from 611 subjects, the majority with brain tumours. As EV science evolves, we plan biorepository changes which may reflect multi-institutional collaborations, proteomic interfaces, additional biofluids, changes in operating procedures and kits for specimen handling, novel procedures for detection of tumour-specific EVs, and for RNA extraction and changes in the taxonomy of EVs. We have used an ontology-driven data model and web-based architecture with a graph theory-driven GUI to accommodate and stimulate the semantic web of EV science.
Decomposing a graph into bistars
DEFF Research Database (Denmark)
Thomassen, Carsten
2013-01-01
Bárat and the present author conjectured that, for each tree T, there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which...... is isomorphic to T. The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)....
Ribes, Luis
2017-01-01
This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...
Combinatorics and graph theory
Vasudev, C
2007-01-01
About the Book: This text has been carefully designed for flexible use for First Semester M.C.A. course of Uttar Pradesh Technical University (U.P.T.U.), and it contains the following features: Precise mathematical language is used without excessive formalism and abstraction. Over 900 exercises (problem sets) in the text with many different types of questions posed. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets (exercises) are stated clearly and unambiguously and all are carefully graded for various levels of difficulty. Contents:
Graph theory with applications
Vasudev, C
2006-01-01
Salient Features Over 1500 problems are used to illustrate concepts, related to different topics, and introduce applications. Over 1000 exercises in the text with many different types of questions posed. Precise mathematical language is used without excessive formalism and abstraction. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets are stated clearly and unambiguously, and all are carefully graded for various levels of difficulty. This text has been carefully designed for flexible use.
Hierarchy of modular graph identities
International Nuclear Information System (INIS)
D’Hoker, Eric; Kaidi, Justin
2016-01-01
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Hierarchy of modular graph identities
Energy Technology Data Exchange (ETDEWEB)
D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)
2016-11-09
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Graph-based modelling in engineering
Rysiński, Jacek
2017-01-01
This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .
DEFF Research Database (Denmark)
Vestergaard, Preben Dahl; Hartnell, Bert L.
2006-01-01
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...
Symmetry Reduction in Infinite Games with Finite Branching
DEFF Research Database (Denmark)
Markey, Nicolas; Vester, Steen
2014-01-01
infinite-state games on graphs with finite branching where the objectives of the players can be very general. As particular applications, it is shown that the technique can be applied to reduce the state space in parity games as well as when doing modelchecking of the Alternating-time temporal logic ATL....
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar
2017-04-25
In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.
Yu, C. W.; Hodges, B. R.; Liu, F.
2017-12-01
Development of continental-scale river network models creates challenges where the massive amount of boundary condition data encounters the sensitivity of a dynamic nu- merical model. The topographic data sets used to define the river channel characteristics may include either corrupt data or complex configurations that cause instabilities in a numerical solution of the Saint-Venant equations. For local-scale river models (e.g. HEC- RAS), modelers typically rely on past experience to make ad hoc boundary condition adjustments that ensure a stable solution - the proof of the adjustment is merely the sta- bility of the solution. To date, there do not exist any formal methodologies or automated procedures for a priori detecting/fixing boundary conditions that cause instabilities in a dynamic model. Formal methodologies for data screening and adjustment are a critical need for simulations with a large number of river reaches that draw their boundary con- dition data from a wide variety of sources. At the continental scale, we simply cannot assume that we will have access to river-channel cross-section data that has been ade- quately analyzed and processed. Herein, we argue that problematic boundary condition data for unsteady dynamic modeling can be identified through numerical modeling with the steady-state Saint-Venant equations. The fragility of numerical stability increases with the complexity of branching in river network system and instabilities (even in an unsteady solution) are typically triggered by the nonlinear advection term in Saint-Venant equations. It follows that the behavior of the simpler steady-state equations (which retain the nonlin- ear term) can be used to screen the boundary condition data for problematic regions. In this research, we propose a graph-theory based method to isolate the location of corrupted boundary condition data in a continental-scale river network and demonstrate its utility with a network of O(10^4) elements. Acknowledgement
International Nuclear Information System (INIS)
Sprung, D.W.L.
1975-01-01
This paper is a brief review of those aspects of the effective interaction problem that can be grouped under the heading of infinite partial summations of the perturbation series. After a brief mention of the classic examples of infinite summations, the author turns to the effective interaction problem for two extra core particles. Their direct interaction is summed to produce the G matrix, while their indirect interaction through the core is summed in a variety of ways under the heading of core polarization. (orig./WL) [de
Determinantal spanning forests on planar graphs
Kenyon, Richard
2017-01-01
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures arise naturally from the laplacian on the graph. More generally these results hold for the "massive" laplacian determinant which counts rooted spanning forests with weight $M$ per finite component. These measures typically have a form of conformal invariance, ...
Oyama, Takuro; Ikabata, Yasuhiro; Seino, Junji; Nakai, Hiromi
2017-07-01
This Letter proposes a density functional treatment based on the two-component relativistic scheme at the infinite-order Douglas-Kroll-Hess (IODKH) level. The exchange-correlation energy and potential are calculated using the electron density based on the picture-change corrected density operator transformed by the IODKH method. Numerical assessments indicated that the picture-change uncorrected density functional terms generate significant errors, on the order of hartree for heavy atoms. The present scheme was found to reproduce the energetics in the four-component treatment with high accuracy.
Optimization Problems on Threshold Graphs
Directory of Open Access Journals (Sweden)
Elena Nechita
2010-06-01
Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
DEFF Research Database (Denmark)
Srba, Jiří
2002-01-01
This paper provides a comprehensive summary of equivalence checking results for infinite-state systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the web-page http://www.brics.dk/~srba/roadmap....
Wanko, Jeffrey J.
2009-01-01
This article provides a historical context for the debate between Georg Cantor and Leopold Kronecker regarding the cardinality of different infinities and incorporates the short story "Welcome to the Hotel Infinity," which uses the analogy of a hotel with an infinite number of rooms to help explain this concept. Wanko makes use of this history and…
Glassman, Robert B
2003-04-15
Cognitive experimentation suggests that at any single instant only three or four items ("chunks") are simultaneously prominent as a working memory (WM) trace, if we disregard the rehearsal component of WM. The reason for small WM capacity may concern combinatorial manageability. How might the neural representations of these few coactive chunks occupy a spatially distributed set of areas of the sheet-like cortex, while providing both order and flexibility to associate items in WM? Each attribute of each simultaneously active WM item must have broad access to the representational facilities of the cortical sheet, comprising tens of thousands of modular "cortical columns." The two hypothesized neural levels of WM during any moment of cognition comprise (a) "binding" together of many distributed attribute representations within each respective WM chunk, and (b) combinatorial play among three or four WM chunk-representations. Anatomical and functional evidence of cortical unity through its depth suggests that cortex may be viewed as essentially planar in its distribution of activations. Thus, a moment's WM is hypothesized here to reside in myriad activated cortical planar "patches," each subdivided into up to four amoeboid "subpatches." Two different lines of topological reasoning suggest orderly associations of such representations. (1) The four-color principle of map topology, and the related K(4) is planar theorem of graph theory, imply that if a small cortical area is dynamically subdivided into no more than four, discretely bounded planar subareas, then each such segment has ample free access to each of the others. (2) A hypothetical alternative to such associative adjacency of simultaneously active cortical representations of chunk-attributes is associative overlap, whereby, in dense cortical neuropil, activated subpatches behave like Venn diagrams of intersecting sets. As the number of Venn-like coactive subpatches within a patch increases, maintaining ad hoc
Cheung, King Sing
2014-01-01
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume
Guan, Yanpeng; Wang, Enzhi; Liu, Xiaoli; Wang, Sijing; Luan, Hebing
2017-08-03
We have attempted a multiscale and quantified characterization method of the contact in three-dimensional granular material made of spherical particles, particularly in cemented granular material. Particle contact is defined as a type of surface contact with voids in its surroundings, rather than a point contact. Macro contact is a particle contact set satisfying the restrictive condition of a two-dimensional manifold with a boundary. On the basis of graph theory, two dual geometrical systems are abstracted from the granular pack. The face and the face set, which satisfies the two-dimensional manifold with a boundary in the solid cell system, are extracted to characterize the particle contact and the macro contact, respectively. This characterization method is utilized to improve the post-processing in DEM (Discrete Element Method) from a micro perspective to describe the macro effect of the cemented granular material made of spherical particles. Since the crack has the same shape as its corresponding contact, this method is adopted to characterize the crack and realize its visualization. The integral failure route of the sample can be determined by a graph theory algorithm. The contact force is assigned to the weight value of the face characterizing the particle contact. Since the force vectors can be added, the macro contact force can be solved by adding the weight of its corresponding faces.
Probabilistic Infinite Secret Sharing
Csirmaz, László
2013-01-01
The study of probabilistic secret sharing schemes using arbitrary probability spaces and possibly infinite number of participants lets us investigate abstract properties of such schemes. It highlights important properties, explains why certain definitions work better than others, connects this topic to other branches of mathematics, and might yield new design paradigms. A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a colle...
The infinite limit as an eliminable approximation for phase transitions
Ardourel, Vincent
2018-05-01
It is generally claimed that infinite idealizations are required for explaining phase transitions within statistical mechanics (e.g. Batterman 2011). Nevertheless, Menon and Callender (2013) have outlined theoretical approaches that describe phase transitions without using the infinite limit. This paper closely investigates one of these approaches, which consists of studying the complex zeros of the partition function (Borrmann et al., 2000). Based on this theory, I argue for the plausibility for eliminating the infinite limit for studying phase transitions. I offer a new account for phase transitions in finite systems, and I argue for the use of the infinite limit as an approximation for studying phase transitions in large systems.
Computing decay rates for new physics theories with FeynRules and MadGraph 5 _aMC@NLO
Alwall, Johan; Fuks, Benjamin; Mattelaer, Olivier; Öztürk, Deniz Gizem; Shen, Chia-Hsien
2015-01-01
We present new features of the FeynRules and MadGraph5/aMC@NLO programs for the automatic computation of decay widths that consistently include channels of arbitrary final-state multiplicity. The implementations are generic enough so that they can be used in the framework of any quantum field theory, possibly including higher-dimensional operators. We extend at the same time the conventions of the Universal FeynRules Output (or UFO) format to include decay tables and information on the total widths. We finally provide a set of representative examples of the usage of the new functions of the different codes in the framework of the Standard Model, the Higgs Effective Field Theory, the Strongly Interacting Light Higgs model and the Minimal Supersymmetric Standard Model and compare the results to available literature and programs for validation purposes.
White, AT
1985-01-01
The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.
On the problem of existence of quantum field theory
International Nuclear Information System (INIS)
Chaichian, M.; Hayashi, M.; Nelipa, N.F.; Pukhov, E.A.
1978-01-01
Existence of quantum field theory is considered for the four-dimensional phi 3 -model. The mathematical tool of contraction mapping principle is used to investigate the question of existence of solution for the infinite system of coupled equations for the Green functions of the theory in the Euclidean region. Formulation of the problem for this model with one divergent part is interesting in itself and provides the first attempt towards the study of other renormalizable quantum field theory models with infinite number of divergent graphs. For sufficiently small values of coupling constant, the theory has a unique solution for the truncated system of equations for the Green functions. However, for the complete, infinite set of equations, the Banach fixed point theorem admits a solution only when the coupling constant tends to zero. Possible reasons for such a result are discussed. (author)
An algebraic approach to graph codes
DEFF Research Database (Denmark)
Pinero, Fernando
This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...
DEFF Research Database (Denmark)
Seiller, Thomas
2016-01-01
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...
Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J; Torrens, Francisco
2012-11-01
In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ([Formula: see text]) of a molecular graph (MG) with respect to a given event (E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub-graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns (n) and rows (m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ(i), can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ(i) for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating
Infinite matrices and sequence spaces
Cooke, Richard G
2014-01-01
This clear and correct summation of basic results from a specialized field focuses on the behavior of infinite matrices in general, rather than on properties of special matrices. Three introductory chapters guide students to the manipulation of infinite matrices, covering definitions and preliminary ideas, reciprocals of infinite matrices, and linear equations involving infinite matrices.From the fourth chapter onward, the author treats the application of infinite matrices to the summability of divergent sequences and series from various points of view. Topics include consistency, mutual consi
On the number of longest and almost longest cycles in cubic graphs
DEFF Research Database (Denmark)
Chia, Gek Ling; Thomassen, Carsten
2012-01-01
We consider the questions: How many longest cycles must a cubic graph have, and how many may it have? For each k >= 2 there are infinitely many p such that there is a cubic graph with p vertices and precisely one longest cycle of length p-k. On the other hand, if G is a graph with p vertices, all...
Hadronic currents in the infinite momentum frame
International Nuclear Information System (INIS)
Toth, K.
1975-01-01
The problem of the transformation properties of hadronic currents in the infinite momentum frame (IMF) is investigated. A general method is proposed to deal with the problem which is based upon the concept of group contraction. The two-dimensional aspects of the IMF description are studied in detail, and the current matrix elements of a three-dimensional Poincare covariant theory are reduced to those of a two-dimensional one. It is explicitlyshown that the covariance group of the two-dimensional theory may either be a 'non-relativistic' (Galilei) group, or a 'relativistic' (Poincare) one depending on the value of a parameter reminiscent of the light velocity in the three-dimensional theory. The value of this parameter cannot be determined by kinematical argument. These results offer a natural generalization of models which assume Galilean symmetry in the infinite momentum frame
Vanicek, Thomas; Hahn, Andreas; Traub-Weidinger, Tatjana; Hilger, Eva; Spies, Marie; Wadsak, Wolfgang; Lanzenberger, Rupert; Pataraia, Ekaterina; Asenbaum-Nan, Susanne
2016-06-28
The human brain exhibits marked hemispheric differences, though it is not fully understood to what extent lateralization of the epileptic focus is relevant. Preoperative [(18)F]FDG-PET depicts lateralization of seizure focus in patients with temporal lobe epilepsy and reveals dysfunctional metabolic brain connectivity. The aim of the present study was to compare metabolic connectivity, inferred from inter-regional [(18)F]FDG PET uptake correlations, in right-sided (RTLE; n = 30) and left-sided TLE (LTLE; n = 32) with healthy controls (HC; n = 31) using graph theory based network analysis. Comparing LTLE and RTLE and patient groups separately to HC, we observed higher lobar connectivity weights in RTLE compared to LTLE for connections of the temporal and the parietal lobe of the contralateral hemisphere (CH). Moreover, especially in RTLE compared to LTLE higher local efficiency were found in the temporal cortices and other brain regions of the CH. The results of this investigation implicate altered metabolic networks in patients with TLE specific to the lateralization of seizure focus, and describe compensatory mechanisms especially in the CH of patients with RTLE. We propose that graph theoretical analysis of metabolic connectivity using [(18)F]FDG-PET offers an important additional modality to explore brain networks.
Polanía, Rafael; Paulus, Walter; Antal, Andrea; Nitsche, Michael A
2011-02-01
Transcranial direct current stimulation (tDCS) is a non-invasive brain stimulation technique that alters cortical excitability and activity in a polarity-dependent way. Stimulation for a few minutes has been shown to induce plastic alterations of cortical excitability and to improve cognitive performance. These effects might be related to stimulation-induced alterations of functional cortical network connectivity. We aimed to investigate the impact of tDCS on cortical network function by functional connectivity and graph theoretical analysis of the BOLD fMRI spontaneous activity. fMRI resting-state datasets were acquired immediately before and after 10-min bipolar tDCS during rest, with the anode placed over the left primary motor cortex (M1) and the cathode over the contralateral frontopolar cortex. For each dataset, grey matter voxel-based synchronization matrices were calculated and thresholded to construct undirected graphs. Nodal connectivity degree and minimum path length maps were calculated and compared before and after tDCS. Nodal minimum path lengths significantly increased in the left somatomotor (SM1) cortex after anodal tDCS, which means that the number of direct functional connections from the left SM1 to topologically distant grey matter voxels significantly decreased. In contrast, functional coupling between premotor and superior parietal areas with the left SM1 significantly increased. Additionally, the nodal connectivity degree in the left posterior cingulate cortex (PCC) area as well as in the right dorsolateral prefrontal cortex (right DLPFC) significantly increased. In summary, we provide initial support that tDCS-induced neuroplastic alterations might be related to functional connectivity changes in the human brain. Additionally, we propose our approach as a powerful method to track for neuroplastic changes in the human brain. Copyright © 2010 Elsevier Inc. All rights reserved.
Bell inequalities for graph states
International Nuclear Information System (INIS)
Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.
2005-01-01
Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)
Generating random networks and graphs
Coolen, Ton; Roberts, Ekaterina
2017-01-01
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...
Graphs with Eulerian unit spheres
Knill, Oliver
2015-01-01
d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...
Proving relations between modular graph functions
International Nuclear Information System (INIS)
Basu, Anirban
2016-01-01
We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)
Representations of the infinite symmetric group
Borodin, Alexei
2016-01-01
Representation theory of big groups is an important and quickly developing part of modern mathematics, giving rise to a variety of important applications in probability and mathematical physics. This book provides the first concise and self-contained introduction to the theory on the simplest yet very nontrivial example of the infinite symmetric group, focusing on its deep connections to probability, mathematical physics, and algebraic combinatorics. Following a discussion of the classical Thoma's theorem which describes the characters of the infinite symmetric group, the authors describe explicit constructions of an important class of representations, including both the irreducible and generalized ones. Complete with detailed proofs, as well as numerous examples and exercises which help to summarize recent developments in the field, this book will enable graduates to enhance their understanding of the topic, while also aiding lecturers and researchers in related areas.
Evolutionary dynamics on infinite strategy spaces
Oechssler, Jörg; Riedel, Frank
1998-01-01
The study of evolutionary dynamics was so far mainly restricted to finite strategy spaces. In this paper we show that this unsatisfying restriction is unnecessary. We specify a simple condition under which the continuous time replicator dynamics are well defined for the case of infinite strategy spaces. Furthermore, we provide new conditions for the stability of rest points and show that even strict equilibria may be unstable. Finally, we apply this general theory to a number of applications ...
Infinite Responsibility: An expression of Saintliness
Conceição Soares
2009-01-01
In this paper I will focus my attention in the distinctions embedded in standard moral philosophy, especially in the philosophy of Kant between, on the one hand, duty and supererogation on the other hand, with the aim to contrast them with the Levinas’s perspective, namely his notion of infinite responsibility. My account of Levinas’s philosophy will show that it challenges – breaking down – deeply entrenched distinctions in the dominant strands of moral philosophy, within which the theory of...
Vecchio, Fabrizio; Miraglia, Francesca; Curcio, Giuseppe; Altavilla, Riccardo; Scrascia, Federica; Giambattistelli, Federica; Quattrocchi, Carlo Cosimo; Bramanti, Placido; Vernieri, Fabrizio; Rossini, Paolo Maria
2015-01-01
A relatively new approach to brain function in neuroscience is the "functional connectivity", namely the synchrony in time of activity in anatomically-distinct but functionally-collaborating brain regions. On the other hand, diffusion tensor imaging (DTI) is a recently developed magnetic resonance imaging (MRI)-based technique with the capability to detect brain structural connection with fractional anisotropy (FA) identification. FA decrease has been observed in the corpus callosum of subjects with Alzheimer's disease (AD) and mild cognitive impairment (MCI, an AD prodromal stage). Corpus callosum splenium DTI abnormalities are thought to be associated with functional disconnections among cortical areas. This study aimed to investigate possible correlations between structural damage, measured by MRI-DTI, and functional abnormalities of brain integration, measured by characteristic path length detected in resting state EEG source activity (40 participants: 9 healthy controls, 10 MCI, 10 mild AD, 11 moderate AD). For each subject, undirected and weighted brain network was built to evaluate graph core measures. eLORETA lagged linear connectivity values were used as weight of the edges of the network. Results showed that callosal FA reduction is associated to a loss of brain interhemispheric functional connectivity characterized by increased delta and decreased alpha path length. These findings suggest that "global" (average network shortest path length representing an index of how efficient is the information transfer between two parts of the network) functional measure can reflect the reduction of fiber connecting the two hemispheres as revealed by DTI analysis and also anticipate in time this structural loss.
Fixation Time for Evolutionary Graphs
Nie, Pu-Yan; Zhang, Pei-Ai
Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.
On infinite-dimensional state spaces
International Nuclear Information System (INIS)
Fritz, Tobias
2013-01-01
It is well known that the canonical commutation relation [x, p]=i can be realized only on an infinite-dimensional Hilbert space. While any finite set of experimental data can also be explained in terms of a finite-dimensional Hilbert space by approximating the commutation relation, Occam's razor prefers the infinite-dimensional model in which [x, p]=i holds on the nose. This reasoning one will necessarily have to make in any approach which tries to detect the infinite-dimensionality. One drawback of using the canonical commutation relation for this purpose is that it has unclear operational meaning. Here, we identify an operationally well-defined context from which an analogous conclusion can be drawn: if two unitary transformations U, V on a quantum system satisfy the relation V −1 U 2 V=U 3 , then finite-dimensionality entails the relation UV −1 UV=V −1 UVU; this implication strongly fails in some infinite-dimensional realizations. This is a result from combinatorial group theory for which we give a new proof. This proof adapts to the consideration of cases where the assumed relation V −1 U 2 V=U 3 holds only up to ε and then yields a lower bound on the dimension.
On infinite-dimensional state spaces
Fritz, Tobias
2013-05-01
It is well known that the canonical commutation relation [x, p] = i can be realized only on an infinite-dimensional Hilbert space. While any finite set of experimental data can also be explained in terms of a finite-dimensional Hilbert space by approximating the commutation relation, Occam's razor prefers the infinite-dimensional model in which [x, p] = i holds on the nose. This reasoning one will necessarily have to make in any approach which tries to detect the infinite-dimensionality. One drawback of using the canonical commutation relation for this purpose is that it has unclear operational meaning. Here, we identify an operationally well-defined context from which an analogous conclusion can be drawn: if two unitary transformations U, V on a quantum system satisfy the relation V-1U2V = U3, then finite-dimensionality entails the relation UV-1UV = V-1UVU; this implication strongly fails in some infinite-dimensional realizations. This is a result from combinatorial group theory for which we give a new proof. This proof adapts to the consideration of cases where the assumed relation V-1U2V = U3 holds only up to ɛ and then yields a lower bound on the dimension.
Fixation probability on clique-based graphs
Choi, Jeong-Ok; Yu, Unjong
2018-02-01
The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs. It is shown that the complete suppression of fixation can be realized with the generalized clique-wheel graph in the limit of small wheel-clique ratio and infinite size. The family of clique-star is an amplifier, and clique-arms graph changes from amplifier to suppressor as the fitness of the mutant increases. We demonstrate that the overall structure of a graph can be more important to determine the fixation probability than the degree or the heat heterogeneity. The dependence of the fixation probability on the position of the first mutant is discussed.
Selfadjoint operators in spaces of functions of infinitely many variables
Berezanskiĭ, Yu M
1986-01-01
Questions in the spectral theory of selfadjoint and normal operators acting in spaces of functions of infinitely many variables are studied in this book, and, in particular, the theory of expansions in generalized eigenfunctions of such operators. Both individual operators and arbitrary commuting families of them are considered. A theory of generalized functions of infinitely many variables is constructed. The circle of questions presented has evolved in recent years, especially in connection with problems in quantum field theory. This book will be useful to mathematicians and physicists interested in the indicated questions, as well as to graduate students and students in advanced university courses.
Ambiguities about infinite nuclear matter
International Nuclear Information System (INIS)
Fabre de la Ripelle, M.
1978-01-01
Exact solutions of the harmonic-oscillator and infinite hyperspherical well are given for the ground state of a infinitely heavy (N=Z) nucleus. The density of matter is a steadily decreasing function. The kinetic energy per particle is 12% smaller than the one predicted by the Fermi sea
The Infinitive Marker across Scandinavian
DEFF Research Database (Denmark)
Christensen, Ken Ramshøj
2007-01-01
In this paper I argue that the base-position of the infinitive marker in the Scandinavian languages and English share a common origin site. It is inserted as the top-most head in the VP-domain. The cross-linguistic variation in the syntactic distribution of the infinitive marker can be accounted...
International Nuclear Information System (INIS)
Liu Guan-Ting; Yang Li-Ying
2017-01-01
By means of analytic function theory, the problems of interaction between infinitely many parallel dislocations and a semi-infinite crack in one-dimensional hexagonal quasicrystal are studied. The analytic solutions of stress fields of the interaction between infinitely many parallel dislocations and a semi-infinite crack in one-dimensional hexagonal quasicrystal are obtained. They indicate that the stress concentration occurs at the dislocation source and the tip of the crack, and the value of the stress increases with the number of the dislocations increasing. These results are the development of interaction among the finitely many defects of quasicrystals, which possesses an important reference value for studying the interaction problems of infinitely many defects in fracture mechanics of quasicrystal. (paper)
Xu, Kexiang; Trinajstić, Nenad
2015-01-01
This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...
Identification of Functional Clusters in the Striatum Using Infinite Relational Modeling
DEFF Research Database (Denmark)
Andersen, Kasper Winther; Madsen, Kristoffer Hougaard; Siebner, Hartwig
2011-01-01
In this paper we investigate how the Infinite Relational Model can be used to infer functional groupings of the human striatum using resting state fMRI data from 30 healthy subjects. The Infinite Relational Model is a non-parametric Bayesian method for infering community structure in complex netw...... and non-links in the graphs as missing. We find that the model is performing well above chance for all subjects....
Replica methods for loopy sparse random graphs
International Nuclear Information System (INIS)
Coolen, ACC
2016-01-01
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)
The n-th Power Signed Graphs-II
Reddyy, P. Siva Kota; Vijay, S.; Lokeshaz, V.
2010-01-01
For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.
Quark ensembles with the infinite correlation length
Zinov'ev, G. M.; Molodtsov, S. V.
2015-01-01
A number of exactly integrable (quark) models of quantum field theory with the infinite correlation length have been considered. It has been shown that the standard vacuum quark ensemble—Dirac sea (in the case of the space-time dimension higher than three)—is unstable because of the strong degeneracy of a state, which is due to the character of the energy distribution. When the momentum cutoff parameter tends to infinity, the distribution becomes infinitely narrow, leading to large (unlimited) fluctuations. Various vacuum ensembles—Dirac sea, neutral ensemble, color superconductor, and BCS state—have been compared. In the case of the color interaction between quarks, the BCS state has been certainly chosen as the ground state of the quark ensemble.
Quark ensembles with the infinite correlation length
International Nuclear Information System (INIS)
Zinov’ev, G. M.; Molodtsov, S. V.
2015-01-01
A number of exactly integrable (quark) models of quantum field theory with the infinite correlation length have been considered. It has been shown that the standard vacuum quark ensemble—Dirac sea (in the case of the space-time dimension higher than three)—is unstable because of the strong degeneracy of a state, which is due to the character of the energy distribution. When the momentum cutoff parameter tends to infinity, the distribution becomes infinitely narrow, leading to large (unlimited) fluctuations. Various vacuum ensembles—Dirac sea, neutral ensemble, color superconductor, and BCS state—have been compared. In the case of the color interaction between quarks, the BCS state has been certainly chosen as the ground state of the quark ensemble
Quark ensembles with the infinite correlation length
Energy Technology Data Exchange (ETDEWEB)
Zinov’ev, G. M. [National Academy of Sciences of Ukraine, Bogoliubov Institute for Theoretical Physics (Ukraine); Molodtsov, S. V., E-mail: molodtsov@itep.ru [Joint Institute for Nuclear Research (Russian Federation)
2015-01-15
A number of exactly integrable (quark) models of quantum field theory with the infinite correlation length have been considered. It has been shown that the standard vacuum quark ensemble—Dirac sea (in the case of the space-time dimension higher than three)—is unstable because of the strong degeneracy of a state, which is due to the character of the energy distribution. When the momentum cutoff parameter tends to infinity, the distribution becomes infinitely narrow, leading to large (unlimited) fluctuations. Various vacuum ensembles—Dirac sea, neutral ensemble, color superconductor, and BCS state—have been compared. In the case of the color interaction between quarks, the BCS state has been certainly chosen as the ground state of the quark ensemble.
On path hypercompositions in graphs and automata
Directory of Open Access Journals (Sweden)
Massouros Christos G.
2016-01-01
Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.
Directory of Open Access Journals (Sweden)
Bouillé F.
2006-11-01
Full Text Available La saisie des informations d'une carte géologique par les méthodes classiques (grilles ou relevés aléatoires de courbes ne constitue pas une base de données opérationnelle. Par contre, l'assimilation des limites géologiques à un graphe orienté répond aux critères d'optimalité (encombrement très réduit, temps minimal, fiabilité, et permet une digitalisation rationnelle de la carte, une bonne structuration du fichier, et la réalisation d'applications intéressantes : restitutions graphiques sélectives à toutes échelles, calculs de pendages, surfaces, volumes, études de corrélation. Nous avons donc établi une chaîne de traitement de la carte géologique dont chaque maillon (saisie des informations; contrôle, mise à jour, consultation, application opère sur un ou plusieurs graphes. Obtaining data from geological maps by conventional methods (grids or random curve plotting is not an operational data base. However, the comparison of geological boundaries with a directional graph meets criteria of optimalness (very small bulk, minimum time, reliability and makes it possible to digitize the map rationally, to structure the file properly and to achieve significant applications such as selective graph plotting on all scales, calculating dips, areas and volumes, and making correlotion analyses. Therefore, we worked out a geological map processing sequence in which each element (data acquisition, checking, updating, consulting, applications operates on one or several graphs.
Yap, Hian-Poh
1996-01-01
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
Chromatic polynomials of random graphs
International Nuclear Information System (INIS)
Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian
2010-01-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Graphs of groups on surfaces interactions and models
White, AT
2001-01-01
The book, suitable as both an introductory reference and as a text book in the rapidly growing field of topological graph theory, models both maps (as in map-coloring problems) and groups by means of graph imbeddings on sufaces. Automorphism groups of both graphs and maps are studied. In addition connections are made to other areas of mathematics, such as hypergraphs, block designs, finite geometries, and finite fields. There are chapters on the emerging subfields of enumerative topological graph theory and random topological graph theory, as well as a chapter on the composition of English
Quantum graphs: a simple model for chaotic scattering
International Nuclear Information System (INIS)
Kottos, Tsampikos; Smilansky, Uzy
2003-01-01
We connect quantum graphs with infinite leads, and turn them into scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay time and conductance distributions, Ericson fluctuations, and when considered statistically, the ensemble of scattering matrices reproduces quite well the predictions of the appropriately defined random matrix ensembles. The underlying classical dynamics can be defined, and it provides important parameters which are needed for the quantum theory. In particular, we derive exact expressions for the scattering matrix, and an exact trace formula for the density of resonances, in terms of classical orbits, analogous to the semiclassical theory of chaotic scattering. We use this in order to investigate the origin of the connection between random matrix theory and the underlying classical chaotic dynamics. Being an exact theory, and due to its relative simplicity, it offers new insights into this problem which is at the forefront of the research in chaotic scattering and related fields
Eigenfunction statistics on quantum graphs
International Nuclear Information System (INIS)
Gnutzmann, S.; Keating, J.P.; Piotet, F.
2010-01-01
We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.
Dynamics with infinitely many derivatives: variable coefficient equations
International Nuclear Information System (INIS)
Barnaby, Neil; Kamran, Niky
2008-01-01
Infinite order differential equations have come to play an increasingly significant role in theoretical physics. Field theories with infinitely many derivatives are ubiquitous in string field theory and have attracted interest recently also from cosmologists. Crucial to any application is a firm understanding of the mathematical structure of infinite order partial differential equations. In our previous work we developed a formalism to study the initial value problem for linear infinite order equations with constant coefficients. Our approach relied on the use of a contour integral representation for the functions under consideration. In many applications, including the study of cosmological perturbations in nonlocal inflation, one must solve linearized partial differential equations about some time-dependent background. This typically leads to variable coefficient equations, in which case the contour integral methods employed previously become inappropriate. In this paper we develop the theory of a particular class of linear infinite order partial differential equations with variable coefficients. Our formalism is particularly well suited to the types of equations that arise in nonlocal cosmological perturbation theory. As an example to illustrate our formalism we compute the leading corrections to the scalar field perturbations in p-adic inflation and show explicitly that these are small on large scales.
Wigner's infinite spin representations and inert matter
Energy Technology Data Exchange (ETDEWEB)
Schroer, Bert [CBPF, Rio de Janeiro (Brazil); Institut fuer Theoretische Physik FU-Berlin, Berlin (Germany)
2017-06-15
Positive energy ray representations of the Poincare group are naturally subdivided into three classes according to their mass and spin content: m > 0, m = 0 finite helicity and m = 0 infinite spin. For a long time the localization properties of the massless infinite spin class remained unknown, until it became clear that such matter does not permit compact spacetime localization and its generating covariant fields are localized on semi-infinite space-like strings. Using a new perturbation theory for higher spin fields we present arguments which support the idea that infinite spin matter cannot interact with normal matter and we formulate conditions under which this also could happen for finite spin s > 1 fields. This raises the question of a possible connection between inert matter and dark matter. (orig.)
Instanton Operators and the Higgs Branch at Infinite Coupling
Cremonesi, Stefano; Hanany, Amihay; Mekareeya, Noppadol
2017-01-01
The richness of 5d $\\mathcal{N}=1$ theories with a UV fixed point at infinite coupling is due to the existence of local disorder operators known as instanton operators. By considering the Higgs branch of $SU(2)$ gauge theories with $N_f \\leq 7$ flavours at finite and infinite coupling, we write down the explicit chiral ring relations between instanton operators, the glueball superfield and mesons. Exciting phenomena appear at infinite coupling: the glueball superfield is no longer nilpotent and the classical chiral ring relations are quantum corrected by instanton operators bilinears. We also find expressions for the dressing of instanton operators of arbitrary charge. The same analysis is performed for $USp(2k)$ with an antisymmetric hypermultiplet and pure $SU(N)$ gauge theories.
Instanton operators and the Higgs branch at infinite coupling
Energy Technology Data Exchange (ETDEWEB)
Cremonesi, Stefano [Department of Mathematics, King’s College London,The Strand, London WC2R 2LS (United Kingdom); Ferlito, Giulia; Hanany, Amihay [Theoretical Physics Group, Imperial College London,Prince Consort Road, London, SW7 2AZ (United Kingdom); Mekareeya, Noppadol [Theory Division, Physics Department, CERN,CH-1211, Geneva 23 (Switzerland)
2017-04-10
The richness of 5d N=1 theories with a UV fixed point at infinite coupling is due to the existence of local disorder operators known as instanton operators. By considering the Higgs branch of SU(2) gauge theories with N{sub f}≤7 flavours at finite and infinite coupling, we write down the explicit chiral ring relations between instanton operators, the glueball superfield and mesons. Exciting phenomena appear at infinite coupling: the glueball superfield is no longer nilpotent and the classical chiral ring relations are quantum corrected by instanton operators bilinears. We also find expressions for the dressing of instanton operators of arbitrary charge. The same analysis is performed for USp(2k) with an antisymmetric hypermultiplet and pure SU(N) gauge theories.
Graph visualization (Invited talk)
Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.
2012-01-01
Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.
Groups, graphs and random walks
Salvatori, Maura; Sava-Huss, Ecaterina
2017-01-01
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...
A new perturbative approximation applied to supersymmetric quantum field theory
International Nuclear Information System (INIS)
Bender, C.M.; Milton, K.A.; Pinsky, S.S.; Simmons, L.M. Jr.; Los Alamos National Lab.
1988-01-01
We show that a recently proposed graphical perturbative calculational scheme in quantum field theory is consistent with global supersymmetry invariance. We examine a two-dimensional supersymmetric quantum field theory in which we do not known of any other means for doing analytical calculations. We illustrate the power of this new technique by computing the ground-state energy density E to second order in this new perturbation theory. We show that there is a beautiful and delicate cancellation between infinite classes of graphs which leads to the result that E=0. (orig.)
Pragmatic Graph Rewriting Modifications
Rodgers, Peter; Vidal, Natalia
1999-01-01
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...
Rutkevich, Sergei B; Diehl, H W
2015-06-01
The O(n) ϕ(4) model on a strip bounded by a pair of planar free surfaces at separation L can be solved exactly in the large-n limit in terms of the eigenvalues and eigenfunctions of a self-consistent one-dimensional Schrödinger equation. The scaling limit of a continuum version of this model is considered. It is shown that the self-consistent potential can be eliminated in favor of scattering data by means of appropriately extended methods of inverse scattering theory. The scattering data (Jost function) associated with the self-consistent potential are determined for the L=∞ semi-infinite case in the scaling regime for all values of the temperature scaling field t=(T-T(c))/T(c) above and below the bulk critical temperature T(c). These results are used in conjunction with semiclassical and boundary-operator expansions and a trace formula to derive exact analytical results for a number of quantities such as two-point functions, universal amplitudes of two excess surface quantities, the universal amplitude difference associated with the thermal singularity of the surface free energy, and potential coefficients. The asymptotic behaviors of the scaled eigenenergies and eigenfunctions of the self-consistent Schrödinger equation as function of x=t(L/ξ(+))(1/ν) are determined for x→-∞. In addition, the asymptotic x→-∞ forms of the universal finite-size scaling functions Θ(x) and ϑ(x) of the residual free energy and the Casimir force are computed exactly to order 1/x, including their x(-1)ln|x| anomalies.
Engineering Object-Oriented Semantics Using Graph Transformations
Kastenberg, H.; Kleppe, A.G.; Rensink, Arend
In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph
External memory K-bisimulation reduction of big graphs
Luo, Y.; Fletcher, G.H.L.; Hidders, A.J.H.; Wu, Y.; De Bra, P.M.E.
2013-01-01
In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying graph. Ubiquitous in the theory and application of graph data,
Semi-infinite fractional programming
Verma, Ram U
2017-01-01
This book presents a smooth and unified transitional framework from generalised fractional programming, with a finite number of variables and a finite number of constraints, to semi-infinite fractional programming, where a number of variables are finite but with infinite constraints. It focuses on empowering graduate students, faculty and other research enthusiasts to pursue more accelerated research advances with significant interdisciplinary applications without borders. In terms of developing general frameworks for theoretical foundations and real-world applications, it discusses a number of new classes of generalised second-order invex functions and second-order univex functions, new sets of second-order necessary optimality conditions, second-order sufficient optimality conditions, and second-order duality models for establishing numerous duality theorems for discrete minmax (or maxmin) semi-infinite fractional programming problems. In the current interdisciplinary supercomputer-oriented research envi...
Expander graphs in pure and applied mathematics
Lubotzky, Alexander
2012-01-01
Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry and more. This expository article describes their constructions and various applications in pure and applied mathematics.
Quantum control in infinite dimensions
International Nuclear Information System (INIS)
Karwowski, Witold; Vilela Mendes, R.
2004-01-01
Accurate control of quantum evolution is an essential requirement for quantum state engineering, laser chemistry, quantum information and quantum computing. Conditions of controllability for systems with a finite number of energy levels have been extensively studied. By contrast, results for controllability in infinite dimensions have been mostly negative, stating that full control cannot be achieved with a finite-dimensional control Lie algebra. Here we show that by adding a discrete operation to a Lie algebra it is possible to obtain full control in infinite dimensions with a small number of control operators
Cluster tails for critical power-law inhomogeneous random graphs
van der Hofstad, R.; Kliem, S.; van Leeuwaarden, J.S.H.
2018-01-01
Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299–2361, 2012). It was proved that when the degrees obey a power law with exponent τ∈ (3 , 4)
Rhombic embeddings of planar graphs with faces of degree 4
Kenyon, Richard; Schlenker, Jean-Marc
2003-01-01
Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the existence of such an embedding, as well as a description of the set of all such embeddings.
The chromatic number of a graph of girth 5 on a fixed surface
DEFF Research Database (Denmark)
Thomassen, Carsten
2003-01-01
We prove a color extension result implying that, for every fixed surface S, there are only finitely many 4-color-critical graphs of girth 5 on S. The result is best possible in the sense that there are infinitely many 4-color-critical graphs of girth 4 on S, except when S is the sphere, As a cons......, As a consequence, the chromatic number of graphs of girth 5 on S can be found in polynomial time....
Adaptive Graph Convolutional Neural Networks
Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou
2018-01-01
Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...
Analysis of infinite dimensional diffusions
Maas, J.
2009-01-01
Stochastic processes in infinite dimensional state spaces provide a mathematical description of various phenomena in physics, population biology, finance, and other fields of science. Several aspects of these processes have been studied in this thesis by means of new analytic methods. Firstly,
Automated Analysis of Infinite Scenarios
DEFF Research Database (Denmark)
Buchholtz, Mikael
2005-01-01
The security of a network protocol crucially relies on the scenario in which the protocol is deployed. This paper describes syntactic constructs for modelling network scenarios and presents an automated analysis tool, which can guarantee that security properties hold in all of the (infinitely many...
Gini estimation under infinite variance
A. Fontanari (Andrea); N.N. Taleb (Nassim Nicholas); P. Cirillo (Pasquale)
2018-01-01
textabstractWe study the problems related to the estimation of the Gini index in presence of a fat-tailed data generating process, i.e. one in the stable distribution class with finite mean but infinite variance (i.e. with tail index α∈(1,2)). We show that, in such a case, the Gini coefficient
Directory of Open Access Journals (Sweden)
Mladen Skelin
2014-03-01
Full Text Available Scenario-aware dataflow (SADF is a prominent tool for modeling and analysis of dynamic embedded dataflow applications. In SADF the application is represented as a finite collection of synchronous dataflow (SDF graphs, each of which represents one possible application behaviour or scenario. A finite state machine (FSM specifies the possible orders of scenario occurrences. The SADF model renders the tightest possible performance guarantees, but is limited by its finiteness. This means that from a practical point of view, it can only handle dynamic dataflow applications that are characterized by a reasonably sized set of possible behaviours or scenarios. In this paper we remove this limitation for a class of SADF graphs by means of SADF model parametrization in terms of graph port rates and actor execution times. First, we formally define the semantics of the model relevant for throughput analysis based on (max,+ linear system theory and (max,+ automata. Second, by generalizing some of the existing results, we give the algorithms for worst-case throughput analysis of parametric rate and parametric actor execution time acyclic SADF graphs with a fully connected, possibly infinite state transition system. Third, we demonstrate our approach on a few realistic applications from digital signal processing (DSP domain mapped onto an embedded multi-processor architecture.
Some topics on permutable subgroups in infinite groups
Ialenti, Roberto
2017-01-01
The aim of this thesis is to study permutability in different aspects of the theory of infinite groups. In particular, it will be studied the structure of groups in which all the members of a relevant system of subgroups satisfy a suitable generalized condition of permutability.
Linear measure functional differential equations with infinite delay
Monteiro, G. (Giselle Antunes); Slavík, A.
2014-01-01
We use the theory of generalized linear ordinary differential equations in Banach spaces to study linear measure functional differential equations with infinite delay. We obtain new results concerning the existence, uniqueness, and continuous dependence of solutions. Even for equations with a finite delay, our results are stronger than the existing ones. Finally, we present an application to functional differential equations with impulses.
Disease management research using event graphs.
Allore, H G; Schruben, L W
2000-08-01
Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course. Copyright 2000 Academic Press.
Soetevent, A.R.
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial
Graphing Inequalities, Connecting Meaning
Switzer, J. Matt
2014-01-01
Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…
Directory of Open Access Journals (Sweden)
Amine Labriji
2017-07-01
Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and offers a contribution to solving the problem mentioned above.
van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime
2016-01-01
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,
Brouwer, A.E.; Haemers, W.H.
2012-01-01
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association
Directory of Open Access Journals (Sweden)
Marshall Naylor
2018-01-01
Full Text Available Prominent approaches to the problems of evil assume that even if the Anselmian God exists, some worlds are better than others, all else being equal. But the assumptions that the Anselmian God exists and that some worlds are better than others cannot be true together. One description, by Mark Johnston and Georg Cantor, values God’s existence as exceeding any transfinite cardinal value. For any finite or infinite amount of goodness in any possible world, God’s value infinitely exceeds that amount. This conception is not obviously inconsistent with the Anselmian God. As a result, the prominent approaches to the problems of evil are mistaken. The elimination of evil does not, in fact, improve the value of any world as commonly thought. Permitting evil does not, in fact, diminish the value of any world as commonly thought.
Infinite Particle Systems: Complex Systems III
Directory of Open Access Journals (Sweden)
Editorial Board
2008-06-01
Full Text Available In the years 2002-2005, a group of German and Polish mathematicians worked under a DFG research project No 436 POL 113/98/0-1 entitled "Methods of stochastic analysis in the theory of collective phenomena: Gibbs states and statistical hydrodynamics". The results of their study were summarized at the German-Polish conference, which took place in Poland in October 2005. The venue of the conference was Kazimierz Dolny upon Vistula - a lovely town and a popular place for various cultural, scientific, and even political events of an international significance. The conference was also attended by scientists from France, Italy, Portugal, UK, Ukraine, and USA, which predetermined its international character. Since that time, the conference, entitled "Infinite Particle Systems: Complex Systems" has become an annual international event, attended by leading scientists from Germany, Poland and many other countries. The present volume of the "Condensed Matter Physics" contains proceedings of the conference "Infinite Particle Systems: Complex Systems III", which took place in June 2007.
Integer Flows and Circuit Covers of Graphs and Signed Graphs
Cheng, Jian
The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it
Spectral clustering and biclustering learning large graphs and contingency tables
Bolla, Marianna
2013-01-01
Explores regular structures in graphs and contingency tables by spectral theory and statistical methods This book bridges the gap between graph theory and statistics by giving answers to the demanding questions which arise when statisticians are confronted with large weighted graphs or rectangular arrays. Classical and modern statistical methods applicable to biological, social, communication networks, or microarrays are presented together with the theoretical background and proofs. This book is suitable for a one-semester course for graduate students in data mining, mult
Infinite games with uncertain moves
Directory of Open Access Journals (Sweden)
Nicholas Asher
2013-03-01
Full Text Available We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore what happens to sets in various levels of the Borel hierarchy under such a situation. We show that the sets at every alternate level of the hierarchy jump to the next higher level.
International Nuclear Information System (INIS)
Agarwal, Ravi P.; Baghli, Selma; Benchohra, Mouffak
2009-01-01
The controllability of mild solutions defined on the semi-infinite positive real interval for two classes of first order semilinear functional and neutral functional differential evolution equations with infinite delay is studied in this paper. Our results are obtained using a recent nonlinear alternative due to Avramescu for sum of compact and contraction operators in Frechet spaces, combined with the semigroup theory
Criterion for the nuclearity of spaces of functions of infinite number of variables
International Nuclear Information System (INIS)
Gali, I.M.
1977-08-01
The paper formulates a new necessary and sufficient condition for the nuclearity of spaces of infinite number of variables, and defines new nuclear spaces which play an important role in the field of functional analysis and quantum field theory. Also the condition for nuclearity of the infinite weighted tensor product of nuclear spaces is given
Teleportation schemes in infinite dimensional Hilbert spaces
International Nuclear Information System (INIS)
Fichtner, Karl-Heinz; Freudenberg, Wolfgang; Ohya, Masanori
2005-01-01
The success of quantum mechanics is due to the discovery that nature is described in infinite dimension Hilbert spaces, so that it is desirable to demonstrate the quantum teleportation process in a certain infinite dimensional Hilbert space. We describe the teleportation process in an infinite dimensional Hilbert space by giving simple examples
Semi-infinite assignment and transportation games
Timmer, Judith B.; Sánchez-Soriano, Joaqu´ın; Llorca, Navidad; Tijs, Stef; Goberna, Miguel A.; López, Marco A.
2001-01-01
Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An
On infinite regular and chiral maps
Arredondo, John A.; Valdez, Camilo Ramírez y Ferrán
2015-01-01
We prove that infinite regular and chiral maps take place on surfaces with at most one end. Moreover, we prove that an infinite regular or chiral map on an orientable surface with genus can only be realized on the Loch Ness monster, that is, the topological surface of infinite genus with one end.
Interacting particle systems on graphs
Sood, Vishal
In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations
On a Fuzzy Algebra for Querying Graph Databases
Pivert , Olivier; Thion , Virginie; Jaudoin , Hélène; Smits , Grégory
2014-01-01
International audience; This paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra that makes it possible to handle such database, which may be fuzzy or not, in a flexible way. The algebra, based on fuzzy set theory and the concept of a fuzzy graph, is composed of a set of operators that can be used to express preference queries on fuzzy graph databases. The preferences concern i) the content of the vertices of the graph and ii) the structure of the graph. In a s...
Infinite order quantum-gravitational correlations
Knorr, Benjamin
2018-06-01
A new approximation scheme for nonperturbative renormalisation group equations for quantum gravity is introduced. Correlation functions of arbitrarily high order can be studied by resolving the full dependence of the renormalisation group equations on the fluctuation field (graviton). This is reminiscent of a local potential approximation in O(N)-symmetric field theories. As a first proof of principle, we derive the flow equation for the ‘graviton potential’ induced by a conformal fluctuation and corrections induced by a gravitational wave fluctuation. Indications are found that quantum gravity might be in a non-metric phase in the deep ultraviolet. The present setup significantly improves the quality of previous fluctuation vertex studies by including infinitely many couplings, thereby testing the reliability of schemes to identify different couplings to close the equations, and represents an important step towards the resolution of the Nielsen identity. The setup further allows one, in principle, to address the question of putative gravitational condensates.
Infinite symmetry in the quantum Hall effect
Directory of Open Access Journals (Sweden)
Lütken C.A.
2014-04-01
Full Text Available The new states of matter and concomitant quantum critical phenomena revealed by the quantum Hall effect appear to be accompanied by an emergent modular symmetry. The extreme rigidity of this infinite symmetry makes it easy to falsify, but two decades of experiments have failed to do so, and the location of quantum critical points predicted by the symmetry is in increasingly accurate agreement with scaling experiments. The symmetry severely constrains the structure of the effective quantum field theory that encodes the low energy limit of quantum electrodynamics of 1010 charges in two dirty dimensions. If this is a non-linear σ-model the target space is a torus, rather than the more familiar sphere. One of the simplest toroidal models gives a critical (correlation length exponent that agrees with the value obtained from numerical simulations of the quantum Hall effect.
Graphing trillions of triangles.
Burkhardt, Paul
2017-07-01
The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.
arXiv Agravity up to infinite energy
Salvio, Alberto
2018-02-10
The self-interactions of the conformal mode of the graviton are controlled, in dimensionless gravity theories (agravity), by a coupling $f_0$ that is not asymptotically free. We show that, nevertheless, agravity can be a complete theory valid up to infinite energy. When $f_0$ grows to large values, the conformal mode of the graviton decouples from the rest of the theory and does not hit any Landau pole provided that scalars are asymptotically conformally coupled and all other couplings approach fixed points. Then agravity can flow to conformal gravity at infinite energy. We identify scenarios where the Higgs mass does not receive unnaturally large physical corrections. We also show a useful equivalence between agravity and conformal gravity plus two extra conformally coupled scalars, and we give a simpler form for the renormalization group equations of dimensionless couplings as well as of massive parameters in the presence of the most general matter sector.
Szabó, György; Fáth, Gábor
2007-07-01
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Integrability of conformal fishnet theory
Gromov, Nikolay; Kazakov, Vladimir; Korchemsky, Gregory; Negro, Stefano; Sizov, Grigory
2018-01-01
We study integrability of fishnet-type Feynman graphs arising in planar four-dimensional bi-scalar chiral theory recently proposed in arXiv:1512.06704 as a special double scaling limit of gamma-deformed N = 4 SYM theory. We show that the transfer matrix "building" the fishnet graphs emerges from the R-matrix of non-compact conformal SU(2 , 2) Heisenberg spin chain with spins belonging to principal series representations of the four-dimensional conformal group. We demonstrate explicitly a relationship between this integrable spin chain and the Quantum Spectral Curve (QSC) of N = 4 SYM. Using QSC and spin chain methods, we construct Baxter equation for Q-functions of the conformal spin chain needed for computation of the anomalous dimensions of operators of the type tr( ϕ 1 J ) where ϕ 1 is one of the two scalars of the theory. For J = 3 we derive from QSC a quantization condition that fixes the relevant solution of Baxter equation. The scaling dimensions of the operators only receive contributions from wheel-like graphs. We develop integrability techniques to compute the divergent part of these graphs and use it to present the weak coupling expansion of dimensions to very high orders. Then we apply our exact equations to calculate the anomalous dimensions with J = 3 to practically unlimited precision at any coupling. These equations also describe an infinite tower of local conformal operators all carrying the same charge J = 3. The method should be applicable for any J and, in principle, to any local operators of bi-scalar theory. We show that at strong coupling the scaling dimensions can be derived from semiclassical quantization of finite gap solutions describing an integrable system of noncompact SU(2 , 2) spins. This bears similarities with the classical strings arising in the strongly coupled limit of N = 4 SYM.
Reduction of infinite dimensional equations
Directory of Open Access Journals (Sweden)
Zhongding Li
2006-02-01
Full Text Available In this paper, we use the general Legendre transformation to show the infinite dimensional integrable equations can be reduced to a finite dimensional integrable Hamiltonian system on an invariant set under the flow of the integrable equations. Then we obtain the periodic or quasi-periodic solution of the equation. This generalizes the results of Lax and Novikov regarding the periodic or quasi-periodic solution of the KdV equation to the general case of isospectral Hamiltonian integrable equation. And finally, we discuss the AKNS hierarchy as a special example.
Existence of infinitely many periodic solutions for second-order nonautonomous Hamiltonian systems
Directory of Open Access Journals (Sweden)
Wen Guan
2015-04-01
Full Text Available By using minimax methods and critical point theory, we obtain infinitely many periodic solutions for a second-order nonautonomous Hamiltonian systems, when the gradient of potential energy does not exceed linear growth.
Stochastic optimal control in infinite dimension dynamic programming and HJB equations
Fabbri, Giorgio; Święch, Andrzej
2017-01-01
Providing an introduction to stochastic optimal control in infinite dimension, this book gives a complete account of the theory of second-order HJB equations in infinite-dimensional Hilbert spaces, focusing on its applicability to associated stochastic optimal control problems. It features a general introduction to optimal stochastic control, including basic results (e.g. the dynamic programming principle) with proofs, and provides examples of applications. A complete and up-to-date exposition of the existing theory of viscosity solutions and regular solutions of second-order HJB equations in Hilbert spaces is given, together with an extensive survey of other methods, with a full bibliography. In particular, Chapter 6, written by M. Fuhrman and G. Tessitore, surveys the theory of regular solutions of HJB equations arising in infinite-dimensional stochastic control, via BSDEs. The book is of interest to both pure and applied researchers working in the control theory of stochastic PDEs, and in PDEs in infinite ...
Applications of the infinite momentum method to quantum electrodynamics and bound state problem
International Nuclear Information System (INIS)
Brodsky, S.J.
1973-01-01
It is shown that the infinite momentum method is a valid and useful calculational alternative to standard perturbation theory methods. The most exciting future applications may be in bound state problems in quantum electrodynamics
Squashed entanglement in infinite dimensions
International Nuclear Information System (INIS)
Shirokov, M. E.
2016-01-01
We analyse two possible definitions of the squashed entanglement in an infinite-dimensional bipartite system: direct translation of the finite-dimensional definition and its universal extension. It is shown that the both definitions produce the same lower semicontinuous entanglement measure possessing all basis properties of the squashed entanglement on the set of states having at least one finite marginal entropy. It is also shown that the second definition gives an adequate lower semicontinuous extension of this measure to all states of the infinite-dimensional bipartite system. A general condition relating continuity of the squashed entanglement to continuity of the quantum mutual information is proved and its corollaries are considered. Continuity bound for the squashed entanglement under the energy constraint on one subsystem is obtained by using the tight continuity bound for quantum conditional mutual information (proved in the Appendix by using Winter’s technique). It is shown that the same continuity bound is valid for the entanglement of formation. As a result the asymptotic continuity of the both entanglement measures under the energy constraint on one subsystem is proved.
Adriaan R. Soetevent
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...
Pim Heijnen; Adriaan Soetevent
2014-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...
Gelfand, I M; Shnol, E E
1969-01-01
The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu
Creating more effective graphs
Robbins, Naomi B
2012-01-01
A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr
Energy Technology Data Exchange (ETDEWEB)
Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2013-10-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
DEFF Research Database (Denmark)
Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
2017-01-01
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...
Directory of Open Access Journals (Sweden)
Alberto Apostolico
2009-08-01
Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
Quantum complexity of graph and algebraic problems
International Nuclear Information System (INIS)
Doern, Sebastian
2008-01-01
This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)
Quantum complexity of graph and algebraic problems
Energy Technology Data Exchange (ETDEWEB)
Doern, Sebastian
2008-02-04
This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)
The signed permutation group on Feynman graphs
Energy Technology Data Exchange (ETDEWEB)
Purkart, Julian, E-mail: purkart@physik.hu-berlin.de [Institute of Physics, Humboldt University, D-12489 Berlin (Germany)
2016-08-15
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalization group are small, we can expand the integral and only consider the lowest orders in the scaling. The aim of this article is to determine specific combinations of graphs in a scalar quantum field theory that lead to a remarkable simplification of the first non-trivial term in the perturbation series. It will be seen that the result is independent of the renormalization scheme and the scattering angles. To achieve that goal we will utilize the parametric representation of scalar Feynman integrals as well as the Hopf algebraic structure of the Feynman graphs under consideration. Moreover, we will present a formula which reduces the effort of determining the first-order term in the perturbation series for the specific combination of graphs to a minimum.
A graph rewriting programming language for graph drawing
Rodgers, Peter
1998-01-01
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...
Directory of Open Access Journals (Sweden)
David T. Williams
1995-03-01
Full Text Available The idea of the infinity of God has recently come under pressure due to the modern world-view, and due to the difficulty of proving the doctrine. However, the idea of the infinite, as qualitatively different from the merely very large, has properties which may be applied to some traditional difficulties in Christian theology, such as the ideas of the Trinity and the Incarnation, particularly in regard to the limitation and subordination of the Son. Predication of infinity to God may then make the doctrine of God more comprehensible and rational At the same time, however, this has implications fo r the nature of God, particularly in his relation to the material and to time. Not to be overlooked is the value of the idea from a pastoral perspective.
de Mol, M.J.; Rensink, Arend; Hunt, James J.
This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class
Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.
2004-01-01
In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite
Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM
1999-01-01
Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...
Packing Degenerate Graphs Greedily
Czech Academy of Sciences Publication Activity Database
Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
Newtonian potential and geodesic completeness in infinite derivative gravity
Edholm, James; Conroy, Aindriú
2017-08-01
Recent study has shown that a nonsingular oscillating potential—a feature of infinite derivative gravity theories—matches current experimental data better than the standard General Relativity potential. In this work, we show that this nonsingular oscillating potential can be given by a wider class of theories which allows the defocusing of null rays and therefore geodesic completeness. We consolidate the conditions whereby null geodesic congruences may be made past complete, via the Raychaudhuri equation, with the requirement of a nonsingular Newtonian potential in an infinite derivative gravity theory. In doing so, we examine a class of Newtonian potentials characterized by an additional degree of freedom in the scalar propagator, which returns the familiar potential of General Relativity at large distances.
Quantum spin systems on infinite lattices a concise introduction
Naaijkens, Pieter
2017-01-01
This course-based primer offers readers a concise introduction to the description of quantum mechanical systems with infinitely many degrees of freedom – and quantum spin systems in particular – using the operator algebraic approach. Here, the observables are modeled using elements of some operator algebra, usually a C*-algebra. This text introduces readers to the framework and the necessary mathematical tools without assuming much mathematical background, making it more accessible than advanced monographs. The book also highlights the usefulness of the so-called thermodynamic limit of quantum spin systems, which is the limit of infinite system size. For example, this makes it possible to clearly distinguish between local and global properties, without having to keep track of the system size. Together with Lieb-Robinson bounds, which play a similar role in quantum spin systems to that of the speed of light in relativistic theories, this approach allows ideas from relativistic field theories to be implemen...
Hilbert schemes of points and infinite dimensional Lie algebras
Qin, Zhenbo
2018-01-01
Hilbert schemes, which parametrize subschemes in algebraic varieties, have been extensively studied in algebraic geometry for the last 50 years. The most interesting class of Hilbert schemes are schemes X^{[n]} of collections of n points (zero-dimensional subschemes) in a smooth algebraic surface X. Schemes X^{[n]} turn out to be closely related to many areas of mathematics, such as algebraic combinatorics, integrable systems, representation theory, and mathematical physics, among others. This book surveys recent developments of the theory of Hilbert schemes of points on complex surfaces and its interplay with infinite dimensional Lie algebras. It starts with the basics of Hilbert schemes of points and presents in detail an example of Hilbert schemes of points on the projective plane. Then the author turns to the study of cohomology of X^{[n]}, including the construction of the action of infinite dimensional Lie algebras on this cohomology, the ring structure of cohomology, equivariant cohomology of X^{[n]} a...
Infinite-genus surfaces and the universal Grassmannian
Davis, Simon
1995-01-01
Correlation functions can be calculated on Riemann surfaces using the operator formalism. The state in the Hilbert space of the free field theory on the punctured disc, corresponding to the Riemann surface, is constructed at infinite genus, verifying the inclusion of these surfaces in the Grassmannian. In particular, a subset of the class of $O_{HD}$ surfaces can be identified with a subset of the Grassmannian. The concept of flux through the ideal boundary is used to study the connection bet...
Autoregressive Moving Average Graph Filtering
Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert
2016-01-01
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...
Directory of Open Access Journals (Sweden)
Meili Li
2015-01-01
Full Text Available The approximate controllability of semilinear neutral stochastic integrodifferential inclusions with infinite delay in an abstract space is studied. Sufficient conditions are established for the approximate controllability. The results are obtained by using the theory of analytic resolvent operator, the fractional power theory, and the theorem of nonlinear alternative for Kakutani maps. Finally, an example is provided to illustrate the theory.
A librarian's guide to graphs, data and the semantic web
Powell, James
2015-01-01
Graphs are about connections, and are an important part of our connected and data-driven world. A Librarian's Guide to Graphs, Data and the Semantic Web is geared toward library and information science professionals, including librarians, software developers and information systems architects who want to understand the fundamentals of graph theory, how it is used to represent and explore data, and how it relates to the semantic web. This title provides a firm grounding in the field at a level suitable for a broad audience, with an emphasis on open source solutions and what problems these tools solve at a conceptual level, with minimal emphasis on algorithms or mathematics. The text will also be of special interest to data science librarians and data professionals, since it introduces many graph theory concepts by exploring data-driven networks from various scientific disciplines. The first two chapters consider graphs in theory and the science of networks, before the following chapters cover networks in vario...
Rare events in finite and infinite dimensions
Reznikoff, Maria G.
Thermal noise introduces stochasticity into deterministic equations and makes possible events which are never seen in the zero temperature setting. The driving force behind the thesis work is a desire to bring analysis and probability to bear on a class of relevant and intriguing physical problems, and in so doing, to allow applications to drive the development of new mathematical theory. The unifying theme is the study of rare events under the influence of small, random perturbations, and the manifold mathematical problems which ensue. In the first part, we apply large deviation theory and prefactor estimates to a coherent rotation micromagnetic model in order to analyze thermally activated magnetic switching. We consider recent physical experiments and the mathematical questions "asked" by them. A stochastic resonance type phenomenon is discovered, leading to the definition of finite temperature astroids. Non-Arrhenius behavior is discussed. The analysis is extended to ramped astroids. In addition, we discover that for low damping and ultrashort pulses, deterministic effects can override thermal effects, in accord with very recent ultrashort pulse experiments. Even more interesting, perhaps, is the study of large deviations in the infinite dimensional context, i.e. in spatially extended systems. Inspired by recent numerical investigations, we study the stochastically perturbed Allen Cahn and Cahn Hilliard equations. For the Allen Cahn equation, we study the action minimization problem (a deterministic variational problem) and prove the action scaling in four parameter regimes, via upper and lower bounds. The sharp interface limit is studied. We formally derive a reduced action functional which lends insight into the connection between action minimization and curvature flow. For the Cahn Hilliard equation, we prove upper and lower bounds for the scaling of the energy barrier in the nucleation and growth regime. Finally, we consider rare events in large or infinite
Arosio, Marcello; Martina, Mario L. V.
2017-04-01
The emergent behaviour of the contemporary complex, socio-technical and interconnected society makes the collective risk greater than the sum of the parts and this requires a holistic, systematic and integrated approach. Although there have been major improvements in recent years, there are still some limitation in term of a holistic approach that is able to include the emergent value hidden in the connections between exposed elements and the interactions between the different spheres of the multi-hazards, vulnerability, exposure and resilience. To deal with these challenges it is necessary to consider the connections between the exposed elements (e.g. populations, schools, hospital, etc.) and to quantify the relative importance of the elements and their interconnections (e.g. the need of injured people to go to hospital or children to school). In a system (e.g. road, hospital and ecological network, etc.), or in a System of System (e.g. socio-technical urban service), there are critical elements that, beyond the intrinsic vulnerability, can be characterized by greater or lower vulnerability because of their physical, geographical, cyber or logical connections. To this aim, we propose in this study a comparative analysis between traditional reductionist approach and a new holistic approach to vulnerability assessment to natural hazards. The analysis considers a study case of a socio-economic complex system through an innovative approach based on the properties of graph G=(N,L). A graph consists of two sets N (nodes) and L (links): the nodes represent the single exposed elements (physical, social, environmental, etc.) to a hazard, while the links (or connections) represent the interaction between the elements. The final goal is to illustrate an application of this innovative approach of integrated collective vulnerability assessment.
Resistance Distances in Vertex-Face Graphs
Shangguan, Yingmin; Chen, Haiyan
2018-01-01
The computation of two-point resistances in networks is a classical problem in electric circuit theory and graph theory. Let G be a triangulation graph with n vertices embedded on an orientable surface. Define K(G) to be the graph obtained from G by inserting a new vertex vϕ to each face ϕ of G and adding three new edges (u, vϕ), (v, vϕ) and (w, vϕ), where u, v and w are three vertices on the boundary of ϕ. In this paper, using star-triangle transformation and resistance local-sum rules, explicit relations between resistance distances in K(G) and those in G are obtained. These relations enable us to compute resistance distance between any two points of Kk(G) recursively. As explanation examples, some resistances in several networks are computed, including the modified Apollonian network and networks constructed from tetrahedron, octahedron and icosahedron, respectively.
Counting the number of Feynman graphs in QCD
Kaneko, T.
2018-05-01
Information about the number of Feynman graphs for a given physical process in a given field theory is especially useful for confirming the result of a Feynman graph generator used in an automatic system of perturbative calculations. A method of counting the number of Feynman graphs with weight of symmetry factor was established based on zero-dimensional field theory, and was used in scalar theories and QED. In this article this method is generalized to more complicated models by direct calculation of generating functions on a computer algebra system. This method is applied to QCD with and without counter terms, where many higher order are being calculated automatically.
A Median-Type Condition for Graph Tiling
Czech Academy of Sciences Publication Activity Database
Piguet, Diana; Saumell, Maria
2017-01-01
Roč. 61, August (2017), s. 979-985 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Grant - others:GA MŠk(CZ) LO1506 Institutional support: RVO:67985807 Keywords : extremal graph theory * graph tiling * regularity lemma * LP-duality Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
Improving the Instruction of Infinite Series
Lindaman, Brian; Gay, A. Susan
2012-01-01
Calculus instructors struggle to teach infinite series, and students have difficulty understanding series and related concepts. Four instructional strategies, prominently used during the calculus reform movement, were implemented during a 3-week unit on infinite series in one class of second-semester calculus students. A description of each…
On the Infinite Loch Ness monster
Arredondo, John A.; Maluendas, Camilo Ramírez
2017-01-01
In this paper we present in a topological way the construction of the orientable surface with only one end and infinite genus, called \\emph{The Infinite Loch Ness Monster}. In fact, we introduce a flat and hyperbolic construction of this surface. We discuss how the name of this surface has evolved and how it has been historically understood.
Properties of semi-infinite nuclei
International Nuclear Information System (INIS)
El-Jaick, L.J.; Kodama, T.
1976-04-01
Several relations among density distributions and energies of semi-infinite and infinite nuclei are iventigated in the framework of Wilets's statistical model. The model is shown to be consistent with the theorem of surface tension given by Myers and Swiatecki. Some numerical results are shown by using an appropriate nuclear matter equation of state
Dynamical entropy for infinite quantum systems
International Nuclear Information System (INIS)
Hudetz, T.
1990-01-01
We review the recent physical application of the so-called Connes-Narnhofer-Thirring entropy, which is the successful quantum mechanical generalization of the classical Kolmogorov-Sinai entropy and, by its very conception, is a dynamical entropy for infinite quantum systems. We thus comparingly review also the physical applications of the classical dynamical entropy for infinite classical systems. 41 refs. (Author)
Infinite Dimensional Differential Games with Hybrid Controls
Indian Academy of Sciences (India)
... zero-sum infinite dimensional differential game of infinite duration with discounted payoff involving hybrid controls is studied. The minimizing player is allowed to take continuous, switching and impulse controls whereas the maximizing player is allowed to take continuous and switching controls. By taking strategies in the ...
Degrees of infinite words, polynomials and atoms
J. Endrullis; J. Karhumaki; J.W. Klop (Jan Willem); A. Saarela
2016-01-01
textabstractOur objects of study are finite state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite automata for recognising and
Degrees of infinite words, polynomials and atoms
Endrullis, Jörg; Karhumäki, Juhani; Klop, Jan Willem; Saarela, Aleksi
2016-01-01
Our objects of study are finite state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite automata for recognising and transforming
Proving productivity in infinite data structures
Zantema, H.; Raffelsieper, M.; Lynch, C.
2010-01-01
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate the notion of productivity. This generalizes stream productivity. We develop a general technique to prove productivity based on proving context-sensitive
Negating the Infinitive in Biblical Hebrew
DEFF Research Database (Denmark)
Ehrensvärd, Martin Gustaf
1999-01-01
The article examines the negating of the infinitive in biblical and post-biblical Hebrew. The combination of the negation ayin with infinitive is widely claimed to belong to the linguistic layer commonly referred to as late biblical Hebrew and scholars use it to late-date texts. The article showa...
Variational Infinite Hidden Conditional Random Fields
Bousmalis, Konstantinos; Zafeiriou, Stefanos; Morency, Louis-Philippe; Pantic, Maja; Ghahramani, Zoubin
2015-01-01
Hidden conditional random fields (HCRFs) are discriminative latent variable models which have been shown to successfully learn the hidden structure of a given classification problem. An Infinite hidden conditional random field is a hidden conditional random field with a countably infinite number of
Orthogonality preserving infinite dimensional quadratic stochastic operators
International Nuclear Information System (INIS)
Akın, Hasan; Mukhamedov, Farrukh
2015-01-01
In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators
Understanding the Behaviour of Infinite Ladder Circuits
Ucak, C.; Yegin, K.
2008-01-01
Infinite ladder circuits are often encountered in undergraduate electrical engineering and physics curricula when dealing with series and parallel combination of impedances, as a part of filter design or wave propagation on transmission lines. The input impedance of such infinite ladder circuits is derived by assuming that the input impedance does…
IMSF: Infinite Methodology Set Framework
Ota, Martin; Jelínek, Ivan
Software development is usually an integration task in enterprise environment - few software applications work autonomously now. It is usually a collaboration of heterogeneous and unstable teams. One serious problem is lack of resources, a popular result being outsourcing, ‘body shopping’, and indirectly team and team member fluctuation. Outsourced sub-deliveries easily become black boxes with no clear development method used, which has a negative impact on supportability. Such environments then often face the problems of quality assurance and enterprise know-how management. The used methodology is one of the key factors. Each methodology was created as a generalization of a number of solved projects, and each methodology is thus more or less connected with a set of task types. When the task type is not suitable, it causes problems that usually result in an undocumented ad-hoc solution. This was the motivation behind formalizing a simple process for collaborative software engineering. Infinite Methodology Set Framework (IMSF) defines the ICT business process of adaptive use of methods for classified types of tasks. The article introduces IMSF and briefly comments its meta-model.
Are There Infinite Irrigation Trees?
Bernot, M.; Caselles, V.; Morel, J. M.
2006-08-01
In many natural or artificial flow systems, a fluid flow network succeeds in irrigating every point of a volume from a source. Examples are the blood vessels, the bronchial tree and many irrigation and draining systems. Such systems have raised recently a lot of interest and some attempts have been made to formalize their description, as a finite tree of tubes, and their scaling laws [25], [26]. In contrast, several mathematical models [5], [22], [10], propose an idealization of these irrigation trees, where a countable set of tubes irrigates any point of a volume with positive Lebesgue measure. There is no geometric obstruction to this infinitesimal model and general existence and structure theorems have been proved. As we show, there may instead be an energetic obstruction. Under Poiseuille law R(s) = s -2 for the resistance of tubes with section s, the dissipated power of a volume irrigating tree cannot be finite. In other terms, infinite irrigation trees seem to be impossible from the fluid mechanics viewpoint. This also implies that the usual principle analysis performed for the biological models needs not to impose a minimal size for the tubes of an irrigating tree; the existence of the minimal size can be proven from the only two obvious conditions for such irrigation trees, namely the Kirchhoff and Poiseuille laws.
Directory of Open Access Journals (Sweden)
Namhee Kim
Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs
Linear Port-Hamiltonian Systems on Infinite-dimensional Spaces
Jacob, Birgit
2012-01-01
This book provides a self-contained introduction to the theory of infinite-dimensional systems theory and its applications to port-Hamiltonian systems. The textbook starts with elementary known results, then progresses smoothly to advanced topics in current research. Many physical systems can be formulated using a Hamiltonian framework, leading to models described by ordinary or partial differential equations. For the purpose of control and for the interconnection of two or more Hamiltonian systems it is essential to take into account this interaction with the environment. This book is the fir
Directory of Open Access Journals (Sweden)
Haynes Teresa W.
2014-08-01
Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds
Tailored Random Graph Ensembles
International Nuclear Information System (INIS)
Roberts, E S; Annibale, A; Coolen, A C C
2013-01-01
Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.
Alspach, BR
1985-01-01
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.
Hyperbolicity in median graphs
Indian Academy of Sciences (India)
mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.
Electromagnetic interactions in relativistic infinite component wave equations
International Nuclear Information System (INIS)
Gerry, C.C.
1979-01-01
The electromagnetic interactions of a composite system described by relativistic infinite-component wave equations are considered. The noncompact group SO(4,2) is taken as the dynamical group of the systems, and its unitary irreducible representations, which are infinite dimensional, are used to find the energy spectra and to specify the states of the systems. First the interaction mechanism is examined in the nonrelativistic SO(4,2) formulation of the hydrogen atom as a heuristic guide. A way of making a minimal relativistic generalization of the minimal ineractions in the nonrelativistic equation for the hydrogen atom is proposed. In order to calculate the effects of the relativistic minimal interactions, a covariant perturbation theory suitable for infinite-component wave equations, which is an algebraic and relativistic version of the Rayleigh-Schroedinger perturbation theory, is developed. The electric and magnetic polarizabilities for the ground state of the hydrogen atom are calculated. The results have the correct nonrelativistic limits. Next, the relativistic cross section of photon absorption by the atom is evaluated. A relativistic expression for the cross section of light scattering corresponding to the seagull diagram is derived. The Born amplitude is combusted and the role of spacelike solutions is discussed. Finally, internal electromagnetic interactions that give rise to the fine structure splittings, the Lamb shifts and the hyperfine splittings are considered. The spin effects are introduced by extending the dynamical group
Uniform Single Valued Neutrosophic Graphs
Directory of Open Access Journals (Sweden)
S. Broumi
2017-09-01
Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
Collective Rationality in Graph Aggregation
Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.
2014-01-01
Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the
Wen, Hongwei; Liu, Yue; Wang, Shengpei; Zhang, Jishui; Peng, Yun; He, Huiguang
2017-03-01
Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. At present, the topological disruptions of the whole brain white matter (WM) structural networks remain poorly understood in TS children. Considering the unique position of the topologically central role of densely interconnected brain hubs, namely the rich club regions, therefore, we aimed to investigate whether the rich club regions and their related connections would be particularly vulnerable in early TS children. In our study, we used diffusion tractography and graph theoretical analyses to explore the rich club structures in 44 TS children and 48 healthy children. The structural networks of TS children exhibited significantly increased normalized rich club coefficient, suggesting that TS is characterized by increased structural integrity of this centrally embedded rich club backbone, potentially resulting in increased global communication capacity. In addition, TS children showed a reorganization of rich club regions, as well as significantly increased density and decreased number in feeder connections. Furthermore, the increased rich club coefficients and feeder connections density of TS children were significantly positively correlated to tic severity, indicating that TS may be characterized by a selective alteration of the structural connectivity of the rich club regions, tending to have higher bridging with non-rich club regions, which may increase the integration among tic-related brain circuits with more excitability but less inhibition for information exchanges between highly centered brain regions and peripheral areas. In all, our results suggest the disrupted rich club organization in early TS children and provide structural insights into the brain networks.
Statistical inference using weak chaos and infinite memory
International Nuclear Information System (INIS)
Welling, Max; Chen Yutian
2010-01-01
We describe a class of deterministic weakly chaotic dynamical systems with infinite memory. These 'herding systems' combine learning and inference into one algorithm, where moments or data-items are converted directly into an arbitrarily long sequence of pseudo-samples. This sequence has infinite range correlations and as such is highly structured. We show that its information content, as measured by sub-extensive entropy, can grow as fast as K log T, which is faster than the usual 1/2 K log T for exchangeable sequences generated by random posterior sampling from a Bayesian model. In one dimension we prove that herding sequences are equivalent to Sturmian sequences which have complexity exactly log(T + 1). More generally, we advocate the application of the rich theoretical framework around nonlinear dynamical systems, chaos theory and fractal geometry to statistical learning.
Statistical inference using weak chaos and infinite memory
Energy Technology Data Exchange (ETDEWEB)
Welling, Max; Chen Yutian, E-mail: welling@ics.uci.ed, E-mail: yutian.chen@uci.ed [Donald Bren School of Information and Computer Science, University of California Irvine CA 92697-3425 (United States)
2010-06-01
We describe a class of deterministic weakly chaotic dynamical systems with infinite memory. These 'herding systems' combine learning and inference into one algorithm, where moments or data-items are converted directly into an arbitrarily long sequence of pseudo-samples. This sequence has infinite range correlations and as such is highly structured. We show that its information content, as measured by sub-extensive entropy, can grow as fast as K log T, which is faster than the usual 1/2 K log T for exchangeable sequences generated by random posterior sampling from a Bayesian model. In one dimension we prove that herding sequences are equivalent to Sturmian sequences which have complexity exactly log(T + 1). More generally, we advocate the application of the rich theoretical framework around nonlinear dynamical systems, chaos theory and fractal geometry to statistical learning.
Infinite-dimensional Z2sup(k)-supermanifolds
International Nuclear Information System (INIS)
Molotkov, V.
1984-10-01
In this paper the theory of finite-dimensional supermanifolds of Berezin, Leites and Kostant is generalized in two directions. First, we introduce infinite-dimensional supermanifolds ''locally isomorphic'' to arbitrary Banach (or, more generally, locally convex) superspaces. This is achieved by considering supermanifolds as functors (equipped with some additional structure) from the category of finite-dimensional Grassman superalgebras into the category of the corresponding smooth manifolds (Banach or locally convex). As examples, flag supermanifolds of Banach superspaces as well as unitary supergroups of Hilbert superspaces are constructed. Second, we define ''generalized'' supermanifolds, graded by Abelian groups Z 2 sup(k), instead of the group Z 2 (Z 2 sup(k)-supermanifolds). The corresponding superfields, describing, potentially, particles with more general statistics than Bose + Fermi, generally speaking, turn out to have an infinite number of components. (author)
Infinite-horizon optimal control problems in economics
Energy Technology Data Exchange (ETDEWEB)
Aseev, Sergei M; Besov, Konstantin O; Kryazhimskii, Arkadii V
2012-04-30
This paper extends optimal control theory to a class of infinite-horizon problems that arise in studying models of optimal dynamic allocation of economic resources. In a typical problem of this sort the initial state is fixed, no constraints are imposed on the behaviour of the admissible trajectories at large times, and the objective functional is given by a discounted improper integral. We develop the method of finite-horizon approximations in a broad context and use it to derive complete versions of the Pontryagin maximum principle for such problems. We provide sufficient conditions for the normality of infinite-horizon optimal control problems and for the validity of the 'standard' limit transversality conditions with time going to infinity. As a meaningful example, we consider a new two-sector model of optimal economic growth subject to a random jump in prices. Bibliography: 53 titles.
Infinite-horizon optimal control problems in economics
International Nuclear Information System (INIS)
Aseev, Sergei M; Besov, Konstantin O; Kryazhimskii, Arkadii V
2012-01-01
This paper extends optimal control theory to a class of infinite-horizon problems that arise in studying models of optimal dynamic allocation of economic resources. In a typical problem of this sort the initial state is fixed, no constraints are imposed on the behaviour of the admissible trajectories at large times, and the objective functional is given by a discounted improper integral. We develop the method of finite-horizon approximations in a broad context and use it to derive complete versions of the Pontryagin maximum principle for such problems. We provide sufficient conditions for the normality of infinite-horizon optimal control problems and for the validity of the 'standard' limit transversality conditions with time going to infinity. As a meaningful example, we consider a new two-sector model of optimal economic growth subject to a random jump in prices. Bibliography: 53 titles.
Infinite Dimensional Stochastic Analysis : in Honor of Hui-Hsiung Kuo
Sundar, Pushpa
2008-01-01
This volume contains current work at the frontiers of research in infinite dimensional stochastic analysis. It presents a carefully chosen collection of articles by experts to highlight the latest developments in white noise theory, infinite dimensional transforms, quantum probability, stochastic partial differential equations, and applications to mathematical finance. Included in this volume are expository papers which will help increase communication between researchers working in these areas. The tools and techniques presented here will be of great value to research mathematicians, graduate
Plummer, MD
1986-01-01
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.
Lyapunov exponents for infinite dimensional dynamical systems
Mhuiris, Nessan Mac Giolla
1987-01-01
Classically it was held that solutions to deterministic partial differential equations (i.e., ones with smooth coefficients and boundary data) could become random only through one mechanism, namely by the activation of more and more of the infinite number of degrees of freedom that are available to such a system. It is only recently that researchers have come to suspect that many infinite dimensional nonlinear systems may in fact possess finite dimensional chaotic attractors. Lyapunov exponents provide a tool for probing the nature of these attractors. This paper examines how these exponents might be measured for infinite dimensional systems.
chromatic number of a complete balanced multipartite graph
African Journals Online (AJOL)
2006-12-29
Dec 29, 2006 ... †Applied Mathematics Division, Department of Mathematical Sciences, University of ..... classes originally comprising discrete entities (graph vertices) are replaced by collections of ...... Journal of Combinatorial Theory, 6, pp.
Representation and integration of sociological knowledge using knowledge graphs
Popping, R; Strijker, [No Value
1997-01-01
The representation and integration of sociological knowledge using knowledge graphs, a specific kind of semantic network, is discussed. Knowledge it systematically searched this reveals. inconsistencies, reducing superfluous research and knowledge, and showing gaps in a theory. This representation
Evolutionary Graphs with Frequency Dependent Fitness
Nie, Pu-Yan; Zhang, Pei-Ai
Evolutionary graph theory was recently proposed by Lieberman et al. in 2005. In the previous papers about evolutionary graphs (EGs), the fitness of the residents in the EGs is in general assumed to be unity, and the fitness of a mutant is assumed to be a constant r. We aim to extend EG to general cases in this paper, namely, the fitness of a mutant is heavily dependent upon frequency. The corresponding properties for these new EGs are analyzed, and the fixation probability is obtained for large population.
Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization
Canale, Eduardo A.
2015-02-01
© 2015 AIP Publishing LLC. This work is concerned with stability of equilibria in the homogeneous (equal frequencies) Kuramoto model of weakly coupled oscillators. In 2012 [R. Taylor, J. Phys. A: Math. Theor. 45, 1-15 (2012)], a sufficient condition for almost global synchronization was found in terms of the minimum degree-order ratio of the graph. In this work, a new lower bound for this ratio is given. The improvement is achieved by a concrete infinite sequence of regular graphs. Besides, non standard unstable equilibria of the graphs studied in Wiley et al. [Chaos 16, 015103 (2006)] are shown to exist as conjectured in that work.
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra
2017-06-01
Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.
On some covering graphs of a graph
Directory of Open Access Journals (Sweden)
Shariefuddin Pirzada
2016-10-01
Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\
Infinite genus surfaces and irrational polygonal billiards
Valdez, Ferrán
2009-01-01
We prove that the natural invariant surface associated with the billiard game on an irrational polygonal table is homeomorphic to the Loch Ness monster, that is, the only orientable infinite genus topological real surface with exactly one end.
Herdable Systems Over Signed, Directed Graphs
Ruf, Sebastian F.
2018-04-11
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.
Learning molecular energies using localized graph kernels
Ferré, Grégoire; Haut, Terry; Barros, Kipton
2017-03-01
Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. We benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.
Herdable Systems Over Signed, Directed Graphs
Ruf, Sebastian F.; Egerstedt, Magnus; Shamma, Jeff S.
2018-01-01
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.
Fractional supersymmetry and infinite dimensional lie algebras
International Nuclear Information System (INIS)
Rausch de Traubenberg, M.
2001-01-01
In an earlier work extensions of supersymmetry and super Lie algebras were constructed consistently starting from any representation D of any Lie algebra g. Here it is shown how infinite dimensional Lie algebras appear naturally within the framework of fractional supersymmetry. Using a differential realization of g this infinite dimensional Lie algebra, containing the Lie algebra g as a sub-algebra, is explicitly constructed
The investigation of social networks based on multi-component random graphs
Zadorozhnyi, V. N.; Yudin, E. B.
2018-01-01
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdôs-Rényi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network projects.
Do massive compact objects without event horizon exist in infinite derivative gravity
Koshelev, Alexey S.; Mazumdar, Anupam
2017-01-01
Einstein’s general theory of relativity is plagued by cosmological and black-hole type singularities Recently, it has been shown that infinite derivative, ghost free, gravity can yield nonsingular cosmological and mini-black hole solutions. In particular, the theory possesses a mass-gap determined
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
Subdominant pseudoultrametric on graphs
Energy Technology Data Exchange (ETDEWEB)
Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Infinite slope stability under steady unsaturated seepage conditions
Lu, Ning; Godt, Jonathan W.
2008-01-01
We present a generalized framework for the stability of infinite slopes under steady unsaturated seepage conditions. The analytical framework allows the water table to be located at any depth below the ground surface and variation of soil suction and moisture content above the water table under steady infiltration conditions. The framework also explicitly considers the effect of weathering and porosity increase near the ground surface on changes in the friction angle of the soil. The factor of safety is conceptualized as a function of the depth within the vadose zone and can be reduced to the classical analytical solution for subaerial infinite slopes in the saturated zone. Slope stability analyses with hypothetical sandy and silty soils are conducted to illustrate the effectiveness of the framework. These analyses indicate that for hillslopes of both sandy and silty soils, failure can occur above the water table under steady infiltration conditions, which is consistent with some field observations that cannot be predicted by the classical infinite slope theory. A case study of shallow slope failures of sandy colluvium on steep coastal hillslopes near Seattle, Washington, is presented to examine the predictive utility of the proposed framework.
Energy Technology Data Exchange (ETDEWEB)
Arreola V, G. [IPN, Escuela Superior de Fisica y Matematicas, Posgrado en Ciencias Fisicomatematicas, area en Ingenieria Nuclear, Unidad Profesional Adolfo Lopez Mateos, Edificio 9, Col. San Pedro Zacatenco, 07730 Mexico D. F. (Mexico); Vazquez R, R.; Guzman A, J. R., E-mail: energia.arreola.uam@gmail.com [Universidad Autonoma Metropolitana, Unidad Iztapalapa, Area de Ingenieria en Recursos Energeticos, Av. San Rafael Atlixco 186, Col. Vicentina, 09340 Mexico D. F. (Mexico)
2012-10-15
In this work a comparative analysis of the results for the neutrons dispersion in a not multiplicative semi-infinite medium is presented. One of the frontiers of this medium is located in the origin of coordinates, where a neutrons source in beam form, i.e., {mu}{omicron}=1 is also. The neutrons dispersion is studied on the statistical method of Monte Carlo and through the unidimensional transport theory and for an energy group. The application of transport theory gives a semi-analytic solution for this problem while the statistical solution for the flow was obtained applying the MCNPX code. The dispersion in light water and heavy water was studied. A first remarkable result is that both methods locate the maximum of the neutrons distribution to less than two mean free trajectories of transport for heavy water, while for the light water is less than ten mean free trajectories of transport; the differences between both methods is major for the light water case. A second remarkable result is that the tendency of both distributions is similar in small mean free trajectories, while in big mean free trajectories the transport theory spreads to an asymptote value and the solution in base statistical method spreads to zero. The existence of a neutron current of low energy and toward the source is demonstrated, in contrary sense to the neutron current of high energy coming from the own source. (Author)
Nonperturbative perturbation theory
International Nuclear Information System (INIS)
Bender, C.M.
1989-01-01
In this talk we describe a recently proposed graphical perturbative calculational scheme for quantum field theory. The basic idea is to expand in the power of the interaction term. For example, to solve a λφ 4 theory in d-dimensional space-time, we introduce a small parameter δ and consider a λ(φ 2 ) 1+δ field theory. We show how to expand such a theory as a series in powers of δ. The resulting perturbation series appears to have a finite radius of convergence and numerical results for low-dimensional models are good. We have computed the two-point and four-point Green's functions to second order in powers of δ and the 2n-point Green's functions (n>2) to order δ. We explain how to renormalize the theory and show that, to first order in powers of δ, when δ>0 and d≥4 the theory is free. This conclusion remains valid to second order in powers of δ, and we believe that it remains valid to all orders in powers of δ. The new perturbative scheme is consistent with global supersymmetry invariance. We examine a two-dimensional supersymmetric quantum field theory in which we do not know of any other means for doing analytical calculations. We illustrate the power of this new technique by computing the ground-state energy density E to second order in this new perturbation theory. We show that there is a beautiful and delicate cancellation between infinite classes of graphs which leads to the result that E=0. (orig.)
Dayal, Amit; Brock, David
2018-01-01
Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...
Stevanovic, Dragan
2015-01-01
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-01-01
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
Directory of Open Access Journals (Sweden)
Tomasz Kajdanowicz
2016-09-01
Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.
Handbook of graph grammars and computing by graph transformation
Engels, G; Kreowski, H J; Rozenberg, G
1999-01-01
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran
Probability on graphs random processes on graphs and lattices
Grimmett, Geoffrey
2018-01-01
This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.
Two dimensional infinite conformal symmetry
International Nuclear Information System (INIS)
Mohanta, N.N.; Tripathy, K.C.
1993-01-01
The invariant discontinuous (discrete) conformal transformation groups, namely the Kleinian and Fuchsian groups Gamma (with an arbitrary signature) of H (the Poincare upper half-plane l) and the unit disc Delta are explicitly constructed from the fundamental domain D. The Riemann surface with signatures of Gamma and conformally invariant automorphic forms (functions) with Peterson scalar product are discussed. The functor, where the category of complex Hilbert spaces spanned by the space of cusp forms constitutes the two dimensional conformal field theory. (Author) 7 refs
Entanglement evolution after connecting finite to infinite quantum chains
International Nuclear Information System (INIS)
Eisler, V; Peschel, I; Karevski, D; Platini, T
2008-01-01
We study zero-temperature XX chains and transverse Ising chains and join an initially separate finite piece on one or on both sides to an infinite remainder. In both critical and non-critical systems we find a typical increase of the entanglement entropy after the quench, followed by a slow decay towards the value of the homogeneous chain. In the critical case, the predictions of conformal field theory are verified for the first phase of the evolution, while at late times a step structure can be observed
Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.
2006-01-01
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to
Coloring geographical threshold graphs
Energy Technology Data Exchange (ETDEWEB)
Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH
2008-01-01
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.
Budhiraja, A.S.; Mukherjee, D.; Wu, R.
2017-01-01
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson
DEFF Research Database (Denmark)
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
International Nuclear Information System (INIS)
Xu Hao; Shi Tianjun
2011-01-01
In this article,the qualities of Wigner function and the corresponding stationary perturbation theory are introduced and applied to one-dimensional infinite potential well and one-dimensional harmonic oscillator, and then the particular Wigner function of one-dimensional infinite potential well is specified and a special constriction effect in its pure state Wigner function is discovered, to which,simultaneously, a detailed and reasonable explanation is elaborated from the perspective of uncertainty principle. Ultimately, the amendment of Wigner function and energy of one-dimensional infinite potential well and one-dimensional harmonic oscillator under perturbation are calculated according to stationary phase space perturbation theory. (authors)
Energy Technology Data Exchange (ETDEWEB)
Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
Groupies in multitype random graphs
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Groupies in multitype random graphs.
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Temporal Representation in Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
A Maximum Resonant Set of Polyomino Graphs
Directory of Open Access Journals (Sweden)
Zhang Heping
2016-05-01
Full Text Available A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. A dimer covering of P corresponds to a perfect matching. Different dimer coverings can interact via an alternating cycle (or square with respect to them. A set of disjoint squares of P is a resonant set if P has a perfect matching M so that each one of those squares is M-alternating. In this paper, we show that if K is a maximum resonant set of P, then P − K has a unique perfect matching. We further prove that the maximum forcing number of a polyomino graph is equal to the cardinality of a maximum resonant set. This confirms a conjecture of Xu et al. [26]. We also show that if K is a maximal alternating set of P, then P − K has a unique perfect matching.
Query optimization for graph analytics on linked data using SPARQL
Energy Technology Data Exchange (ETDEWEB)
Hong, Seokyong [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lim, Seung -Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sukumar, Sreenivas R. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Vatsavai, Ranga Raju [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2015-07-01
Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.
Isotropic covariance functions on graphs and their edges
DEFF Research Database (Denmark)
Anderes, E.; Møller, Jesper; Rasmussen, Jakob Gulddahl
We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, i.e., graphs with edges viewed as line segments or more general sets with a coordinate system allowing us to consider points on the graph which are vertices or points...... on an edge. Our covariance functions are defined on the vertices and edge points of these graphs and are isotropic in the sense that they depend only on the geodesic distance or on a new metric called the resistance metric (which extends the classical resistance metric developed in electrical network theory...... functions in the spatial statistics literature (the power exponential, Matérn, generalized Cauchy, and Dagum classes) are shown to be valid with respect to the resistance metric for any graph with Euclidean edges, whilst they are only valid with respect to the geodesic metric in more special cases....
A generalization of total graphs
Indian Academy of Sciences (India)
M Afkhami
2018-04-12
Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.
Graph transformation tool contest 2008
Rensink, Arend; van Gorp, Pieter
This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case
On dominator colorings in graphs
Indian Academy of Sciences (India)
colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.
Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng
2015-12-01
Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.
Do massive compact objects without event horizon exist in infinite derivative gravity?
Koshelev, Alexey S.; Mazumdar, Anupam
2017-10-01
Einstein's general theory of relativity is plagued by cosmological and black-hole type singularities Recently, it has been shown that infinite derivative, ghost free, gravity can yield nonsingular cosmological and mini-black hole solutions. In particular, the theory possesses a mass-gap determined by the scale of new physics. This paper provides a plausible argument, not a no-go theorem, based on the Area-law of gravitational entropy that within infinite derivative, ghost free, gravity nonsingular compact objects in the static limit need not have horizons.
Algorithms for Planar Graphs and Graphs in Metric Spaces
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...
Macintosh Wilson, Alistair
1996-01-01
A conversation between Euclid and the ghost of Socrates. . . the paths of the moon and the sun charted by the stone-builders of ancient Europe. . .the Greek ideal of the golden mean by which they measured beauty. . . Combining historical fact with a retelling of ancient myths and legends, this lively and engaging book describes the historical, religious and geographical background that gave rise to mathematics in ancient Egypt, Babylon, China, Greece, India, and the Arab world. Each chapter contains a case study where mathematics is applied to the problems of the era, including the area of triangles and volume of the Egyptian pyramids; the Babylonian sexagesimal number system and our present measure of space and time which grew out of it; the use of the abacus and remainder theory in China; the invention of trigonometry by Arab mathematicians; and the solution of quadratic equations by completing the square developed in India. These insightful commentaries will give mathematicians and general historians a better understanding of why and how mathematics arose from the problems of everyday life, while the author's easy, accessible writing style will open fascinating chapters in the history of mathematics to a wide audience of general readers.
Polynomial sequences generated by infinite Hessenberg matrices
Directory of Open Access Journals (Sweden)
Verde-Star Luis
2017-01-01
Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.
Dynamic Representations of Sparse Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf
1999-01-01
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....
Domination criticality in product graphs
Directory of Open Access Journals (Sweden)
M.R. Chithra
2015-07-01
Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.
Graph Creation, Visualisation and Transformation
Directory of Open Access Journals (Sweden)
Maribel Fernández
2010-03-01
Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
Nagarathinam, R.; Parvathi, N.
2018-04-01
Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat
Thermal operator representation of finite temperature graphs
International Nuclear Information System (INIS)
Brandt, F.T.; Frenkel, J.; Das, Ashok; Espinosa, Olivier; Perez, Silvana
2005-01-01
Using the mixed space representation (t,p→) in the context of scalar field theories, we prove in a simple manner that the Feynman graphs at finite temperature are related to the corresponding zero temperature diagrams through a simple thermal operator, both in the imaginary time as well as in the real time formalisms. This result is generalized to the case when there is a nontrivial chemical potential present. Several interesting properties of the thermal operator are also discussed
Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan
2014-01-01
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...
Canonical Labelling of Site Graphs
Directory of Open Access Journals (Sweden)
Nicolas Oury
2013-06-01
Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
On the BRST charge over infinite-dimensional algebras
International Nuclear Information System (INIS)
Hlousek, Zvonimir.
1988-01-01
The author studies the BRST charge defined over an infinite algebra of gauged local symmetries. This is of great importance to string theories. The BRST charge of the gauge symmetry must be nilpotent. In string theories this implies the cancellation of conformal anomalies in critical dimension; 26 for bosonic string, 10 for superstring, and 2 for O(2) string. Furthermore, the O(2) symmetry of the O(2) string (a string theory with two, two-dimensional supersymmetries) is realized as a Kac-Moody symmetry. In general, the BRST quantization of the local, gauged KAC-Moody symmetry requires special care due to chiral anomaly. The chiral anomaly breaks the chiral gauge invariance, and the corresponding BRST charge is not nilpotent. To arrive at the nilpotent BRST charge for the gauged Kac-Moody symmetry, one has to modify the theory by adding a one-cocycle over the gauge group. A similar problem and its solution exist in the case of supersymmetric Kac-Moody algebras. The BRST charge of the first quantized string theory is a building block of the covariant string field theory. The BRST invariance of the first quantized theory generalizes to gauge invariance of string field theory. In Witten's open string field theory the BRST charge plays a role of exterior derivation on the space of string field functionals. The Fock space realization of the theory was given by Gross and Jevicki. For the consistency of the theory it is crucial that all the vertex operators are BRST invariant. The ghost part of the vertex comes in few varieties. The author has shown that all the versions of the ghost vertex are equivalent, as long as the total vertex is BRST invariant
Learning heat diffusion graphs
Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal
2016-01-01
Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...
Syed, M. Qasim; Lovatt, Ian
2014-01-01
This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…
Understanding Charts and Graphs.
1987-07-28
Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected