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

Pristine transfinite graphs and permissive electrical networks

CERN Document Server

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

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

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

A first course in graph theory

CERN Document Server

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

Graph theory and its applications

CERN Document Server

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.

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

Introduction to the theory of infinite systems. Theory and practices

Science.gov (United States)

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.

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

Graph theory

CERN Document Server

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

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)

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

The $K$-theory of real graph $C*$-algebras

OpenAIRE

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

Pattern graph rewrite systems

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.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

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

Planar graphs theory and algorithms

CERN Document Server

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.

Positive operator semigroups from finite to infinite dimensions

CERN Document Server

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

Infinite graphs in systematic biology, with an application to the species problem.

Science.gov (United States)

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?"

High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

Science.gov (United States)

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.

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 for alternating hydrocarbons with attached ports

NARCIS (Netherlands)

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

An infinite-dimensional weak KAM theory via random variables

KAUST Repository

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.

An infinite-dimensional weak KAM theory via random variables

KAUST Repository

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.

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.

Quantum field theory with infinite component local fields as an alternative to the string theories

Science.gov (United States)

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.

Graphs on Surfaces and the Partition Function of String Theory

OpenAIRE

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

Introduction to graph theory

CERN Document Server

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.

Classical dynamics on graphs

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

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.

A first course in graph theory and combinatorics

CERN Document Server

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.

An infinite-dimensional calculus for gauge theories

OpenAIRE

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

Spectral analysis of growing graphs a quantum probability point of view

CERN Document Server

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

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.

A Modal-Logic Based Graph Abstraction

NARCIS (Netherlands)

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

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

Exclusivity structures and graph representatives of local complementation orbits

Science.gov (United States)

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.

Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs

Science.gov (United States)

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.

Fractional graph theory a rational approach to the theory of graphs

CERN Document Server

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

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

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

Applying Graph Theory to Problems in Air Traffic Management

Science.gov (United States)

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.

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

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

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

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.

Spectral theory of infinite-area hyperbolic surfaces

CERN Document Server

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

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

Science.gov (United States)

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

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.

Introduction to graph theory

CERN Document Server

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

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

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)

Graph Theory in Paris : Conference in Memory of Claude Berge

CERN Document Server

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.

Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees

Science.gov (United States)

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.

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.

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

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

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.

Algebraic Graph Theory Morphisms, Monoids and Matrices

CERN Document Server

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

Infinite Multiplets

Science.gov (United States)

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.

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.

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

Kuramoto model for infinite graphs with kernels

KAUST Repository

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

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

Vertex maps on graphs -- Perron-Frobenius Theory

OpenAIRE

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.

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.

The planar cubic Cayley graphs

CERN Document Server

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.

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

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.

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

Band connectivity for topological quantum chemistry: Band structures as a graph theory problem

Science.gov (United States)

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.

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)

Graph sampling

OpenAIRE

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.

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

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.

Graph theory favorite conjectures and open problems 1

CERN Document Server

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

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

Stochastic and infinite dimensional analysis

CERN Document Server

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.

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

Graphs and Homomorphisms

CERN Document Server

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

Some remarks on definability of process graphs

NARCIS (Netherlands)

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

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

Graphs and matrices

CERN Document Server

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

Infinite Shannon entropy

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)

Absence of higher derivatives in the renormalization of propagators in quantum field theories with infinitely many couplings

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

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.

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

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

Determinantal spanning forests on planar graphs

OpenAIRE

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

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

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

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.

Quantum entanglement in non-local games, graph parameters and zero-error information theory

NARCIS (Netherlands)

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

Fixation probability on clique-based graphs

Science.gov (United States)

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.

Simplicial complexes of graphs

CERN Document Server

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.

PROBLEMS IN TOPOLOGICAL GRAPH THEORY : QUESTIONS I CAN'T ANSWER

OpenAIRE

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.

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.

Introduction to quantum graphs

CERN Document Server

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

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.

A Brief Historical Introduction to Euler's Formula for Polyhedra, Topology, Graph Theory and Networks

Science.gov (United States)

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…

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

Interaction between infinitely many dislocations and a semi-infinite crack in one-dimensional hexagonal quasicrystal

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)

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

Subgraph detection using graph signals

KAUST Repository

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

KAUST Repository

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.

Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs

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

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

Science.gov (United States)

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.

Science.gov (United States)

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.

Discrete Mathematics - Special Issue: Graph Theory - dedicated to Carsten Thomassen on his 60th birthday

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

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)

Graph-based modelling in engineering

CERN Document Server

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

The Canopy Graph and Level Statistics for Random Operators on Trees

International Nuclear Information System (INIS)

Aizenman, Michael; Warzel, Simone

2006-01-01

For operators with homogeneous disorder, it is generally expected that there is a relation between the spectral characteristics of a random operator in the infinite setup and the distribution of the energy gaps in its finite volume versions, in corresponding energy ranges. Whereas pure point spectrum of the infinite operator goes along with Poisson level statistics, it is expected that purely absolutely continuous spectrum would be associated with gap distributions resembling the corresponding random matrix ensemble. We prove that on regular rooted trees, which exhibit both spectral types, the eigenstate point process has always Poissonian limit. However, we also find that this does not contradict the picture described above if that is carefully interpreted, as the relevant limit of finite trees is not the infinite homogenous tree graph but rather a single-ended 'canopy graph.' For this tree graph, the random Schroedinger operator is proven here to have only pure-point spectrum at any strength of the disorder. For more general single-ended trees it is shown that the spectrum is always singular - pure point possibly with singular continuous component which is proven to occur in some cases

Graph Theory Approach for Studying Food Webs

Science.gov (United States)

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.

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.

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.

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.

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.

The Harary index of a graph

CERN Document Server

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

Connections between the Sznajd model with general confidence rules and graph theory

Science.gov (United States)

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

Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions

Science.gov (United States)

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.

Science.gov (United States)

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

Graph spectrum

NARCIS (Netherlands)

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.

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.

A graph-theory framework for evaluating landscape connectivity and conservation planning.

Science.gov (United States)

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.

Eulerian Graphs and Related Topics

CERN Document Server

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

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.

Generalized connectivity of graphs

CERN Document Server

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.

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

Dynamical graph theory networks techniques for the analysis of sparse connectivity networks in dementia

Science.gov (United States)

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.

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

Infinite series

CERN Document Server

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

Fundamentals of algebraic graph transformation

CERN Document Server

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

A Qualitative Analysis Framework Using Natural Language Processing and Graph Theory

Science.gov (United States)

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…

Graph theory applied to noise and vibration control in statistical energy analysis models.

Science.gov (United States)

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.

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)

Domain configurations in dislocations embedded hexagonal manganite systems: From the view of graph theory

Science.gov (United States)

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.

Support vector machine classification of major depressive disorder using diffusion-weighted neuroimaging and graph theory.

Science.gov (United States)

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.

Using Zipf-Mandelbrot law and graph theory to evaluate animal welfare

Science.gov (United States)

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

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

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

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

Class of very simple gauge theories which remain renormalizable even in the limit of infinite gauge coupling constant

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

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Science.gov (United States)

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

Efficient Algorithmic Frameworks via Structural Graph Theory

Science.gov (United States)

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

Instanton Operators and the Higgs Branch at Infinite Coupling

CERN Document Server

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.

Graphs of groups on surfaces interactions and models

CERN Document Server

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

ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

OpenAIRE

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.

Support vector machine classification of Major Depressive Disorder using diffusion-weighted neuroimaging and graph theory

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.

Partial molar volume of n-alcohols at infinite dilution in water calculated by means of scaled particle theory.

Science.gov (United States)

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.

Fuzzy Graph Language Recognizability

OpenAIRE

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.

On middle cube graphs

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.

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

Stochastic optimal control in infinite dimension dynamic programming and HJB equations

CERN Document Server

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

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

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

Quark ensembles with infinite correlation length

OpenAIRE

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

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.

Worst-case Throughput Analysis for Parametric Rate and Parametric Actor Execution Time Scenario-Aware Dataflow Graphs

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.

Poor textural image tie point matching via graph theory

Science.gov (United States)

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.

Integrability of conformal fishnet theory

Science.gov (United States)

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.

Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.

Science.gov (United States)

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.

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

Cluster tails for critical power-law inhomogeneous random graphs

NARCIS (Netherlands)

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)

Renormalization in quantum field theory and the Riemann-Hilbert problem. I. Hopf algebra structure of graphs and the main theorem

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

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.

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

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)

Selfadjoint operators in spaces of functions of infinitely many variables

CERN Document Server

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.

Graphs & digraphs

CERN Document Server

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

Profinite graphs and groups

CERN Document Server

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

Сlassification of methods of production of computer forensic by usage approach of graph theory

OpenAIRE

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.

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

The depression of a graph and k-kernels

Directory of Open Access Journals (Sweden)

Schurch Mark

2014-05-01

Full Text Available An edge ordering of a graph G is an injection f : E(G → R, the set of real numbers. A path in G for which the edge ordering f increases along its edge sequence is called an f-ascent ; an f-ascent is maximal if it is not contained in a longer f-ascent. The depression of G is the smallest integer k such that any edge ordering f has a maximal f-ascent of length at most k. A k-kernel of a graph G is a set of vertices U ⊆ V (G such that for any edge ordering f of G there exists a maximal f-ascent of length at most k which neither starts nor ends in U. Identifying a k-kernel of a graph G enables one to construct an infinite family of graphs from G which have depression at most k. We discuss various results related to the concept of k-kernels, including an improved upper bound for the depression of trees.

Multiscale connectivity and graph theory highlight critical areas for conservation under climate change.

Science.gov (United States)

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.

Molecular orbital calculations using chemical graph theory

CERN Document Server

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

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

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

Common misconceptions about the dynamical theory of crystal lattices: Cauchy relations, lattice potentials and infinite crystals

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.

Representations of the infinite symmetric group

CERN Document Server

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.

Generating random networks and graphs

CERN Document Server

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

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.

Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program

Science.gov (United States)

Manin, Yuri I.

Introduction. The main observable quantities in Quantum Field Theory, correlation functions, are expressed by the celebrated Feynman path integrals. A mathematical definition of them involving a measure and actual integration is still lacking. Instead, it is replaced by a series of ad hoc but highly efficient and suggestive heuristic formulas such as perturbation formalism. The latter interprets such an integral as a formal series of finite-dimensional but divergent integrals, indexed by Feynman graphs, the list of which is determined by the Lagrangian of the theory. Renormalization is a prescription that allows one to systematically "subtract infinities" from these divergent terms producing an asymptotic series for quantum correlation functions. On the other hand, graphs treated as "flowcharts", also form a combinatorial skeleton of the abstract computation theory. Partial recursive functions that according to Church's thesis exhaust the universe of (semi)computable maps are generally not everywhere defined due to potentially infinite searches and loops. In this paper I argue that such infinities can be addressed in the same way as Feynman divergences. More details can be found in [9,10].

Engineering Object-Oriented Semantics Using Graph Transformations

NARCIS (Netherlands)

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

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

Science.gov (United States)

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.

arXiv Agravity up to infinite energy

CERN Document Server

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.

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

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

The infinite limit as an eliminable approximation for phase transitions

Science.gov (United States)

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.

Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization

KAUST Repository

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.

Infinite sequences and series

CERN Document Server

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

Multi-scale connectivity and graph theory highlight critical areas for conservation under climate change

Science.gov (United States)

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.

Application of graph theory to the morphological analysis of settlements

OpenAIRE

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

Rhombic embeddings of planar graphs with faces of degree 4

OpenAIRE

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.

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

One-particle reducibility in effective scattering theory

International Nuclear Information System (INIS)

Vereshagin, V.

2016-01-01

To construct the reasonable renormalization scheme suitable for the effective theories one needs to resolve the “problem of couplings” because the number of free parameters in a theory should be finite. Otherwise the theory would loose its predictive power. In the case of effective theory already the first step on this way shows the necessity to solve the above-mentioned problem for the 1-loop 2-leg function traditionally called self energy. In contrast to the customary renormalizable models the corresponding Feynman graph demonstrates divergencies that require introducing of an infinite number of prescriptions. In the recent paper [1] it has been shown that the way out of this difficulty requires the revision of the notion of one-particle reducibility. The point is that in effective scattering theory one can introduce two different notions: the graphic reducibility and the analytic one. Below we explain the main ideas of the paper [1] and recall some notions and definitions introduced earlier in [2] and [3

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.

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)

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.

Counting the number of Feynman graphs in QCD

Science.gov (United States)

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.

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)

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.

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

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

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)

Expander graphs in pure and applied mathematics

OpenAIRE

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.

Visibility graph analysis on quarterly macroeconomic series of China based on complex network theory

Science.gov (United States)

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

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

The investigation of social networks based on multi-component random graphs

Science.gov (United States)

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.

Analysis of the enzyme network involved in cattle milk production using graph theory.

Science.gov (United States)

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.

Differences in graph theory functional connectivity in left and right temporal lobe epilepsy.

Science.gov (United States)

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.

External memory K-bisimulation reduction of big graphs

NARCIS (Netherlands)

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,

The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI.

Science.gov (United States)

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

Science.gov (United States)

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

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.

Analyzing Spatial Behavior of Backcountry Skiers in Mountain Protected Areas Combining GPS Tracking and Graph Theory

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.

Graphs with Eulerian unit spheres

OpenAIRE

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

A Graph Theory Approach for Geovisualization of Anthropogenic Land Use Change: An application to Lisbon

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

Detectable states, cycle fluxes, and motility scaling of molecular motor kinesin: An integrative kinetic graph theory analysis

Science.gov (United States)

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.

The n-th Power Signed Graphs-II

OpenAIRE

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.

Augmented marked graphs

CERN Document Server

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

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.

Graph theory enables drug repurposing--how a mathematical model can drive the discovery of hidden mechanisms of action.

Science.gov (United States)

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.

Graph theory enables drug repurposing--how a mathematical model can drive the discovery of hidden mechanisms of action.

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.

Do massive compact objects without event horizon exist in infinite derivative gravity?

Science.gov (United States)

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.

Newtonian potential and geodesic completeness in infinite derivative gravity

Science.gov (United States)

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.

A librarian's guide to graphs, data and the semantic web

CERN Document Server

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

Graphs, groups and surfaces

CERN Document Server

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

Groups, graphs and random walks

CERN Document Server

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

On a Fuzzy Algebra for Querying Graph Databases

OpenAIRE

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

Cytoscape.js: a graph theory library for visualisation and analysis.

Science.gov (United States)

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.

Graph Sampling for Covariance Estimation

KAUST Repository

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.

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

Spectral clustering and biclustering learning large graphs and contingency tables

CERN Document Server

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

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.

Quantification of three-dimensional cell-mediated collagen remodeling using graph theory.

Science.gov (United States)

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.

Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms

OpenAIRE

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

Resistance Distances in Vertex-Face Graphs

Science.gov (United States)

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.

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

Geographic information modeling of Econet of Northwestern Federal District territory on graph theory basis

Science.gov (United States)

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.

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

Genetic Algorithm and Graph Theory Based Matrix Factorization Method for Online Friend Recommendation

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.

Complementation of coalgebra automata

NARCIS (Netherlands)

Kissig, C.; Venema, Y.

2009-01-01

Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This coalgebraic perspective on automata lays foundation to a universal theory of automata operating on infinite models of computation.

Infinite Dimensional Stochastic Analysis : in Honor of Hui-Hsiung Kuo

CERN Document Server

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

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

Some topics on permutable subgroups in infinite groups

OpenAIRE

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.

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

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

Field theoretical construction of an infinite set of quantum commuting operators related with soliton equations

International Nuclear Information System (INIS)

Sasaki, Ryu; Yamanaka, Itaru

1987-01-01

The quantum version of an infinite set of polynomial conserved quantities of a class of soliton equations is discussed from the point of view of naive continuum field theory. By using techniques of two dimensional field theories, we show that an infinite set of quantum commuting operators can be constructed explicitly from the knowledge of its classical counterparts. The quantum operators are so constructed as to coincide with the classical ones in the ℎ → 0 limit (ℎ; Planck's constant divided by 2π). It is expected that the explicit forms of these operators would shed some light on the structure of the infinite dimensional Lie algebras which underlie a certain class of quantum integrable systems. (orig.)

Field theoretical construction of an infinite set of quantum commuting operators related with soliton equations

International Nuclear Information System (INIS)

Sasaki, Ryu; Yamanaka, Itaru.

1986-08-01

The quantum version of an infinite set of polynomial conserved quantities of a class of soliton equations is discussed from the point of view of naive continuum field theory. By using techniques of two dimensional field theories, we show that an infinite set of quantum commuting operators can be constructed explicitly from the knowledge of its classical counterparts. The quantum operators are so constructed as to coincide with the classical ones in the ℎ → 0 limit (ℎ; Planck's constant divided by 2π). It is expected that the explicit forms of these operators would shed some light on the structure of the infinite dimensional Lie algebras which underlie certain class of quantum integrable systems. (author)

Quark ensembles with the infinite correlation length

Science.gov (United States)

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.

Approximate Controllability of Semilinear Neutral Stochastic Integrodifferential Inclusions with Infinite Delay

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.

Brain Graph Topology Changes Associated with Anti-Epileptic Drug Use

Science.gov (United States)

Levin, Harvey S.; Chiang, Sharon

2015-01-01

Abstract Neuroimaging studies of functional connectivity using graph theory have furthered our understanding of the network structure in temporal lobe epilepsy (TLE). Brain network effects of anti-epileptic drugs could influence such studies, but have not been systematically studied. Resting-state functional MRI was analyzed in 25 patients with TLE using graph theory analysis. Patients were divided into two groups based on anti-epileptic medication use: those taking carbamazepine/oxcarbazepine (CBZ/OXC) (n=9) and those not taking CBZ/OXC (n=16) as a part of their medication regimen. The following graph topology metrics were analyzed: global efficiency, betweenness centrality (BC), clustering coefficient, and small-world index. Multiple linear regression was used to examine the association of CBZ/OXC with graph topology. The two groups did not differ from each other based on epilepsy characteristics. Use of CBZ/OXC was associated with a lower BC. Longer epilepsy duration was also associated with a lower BC. These findings can inform graph theory-based studies in patients with TLE. The changes observed are discussed in relation to the anti-epileptic mechanism of action and adverse effects of CBZ/OXC. PMID:25492633

Qualities of Wigner function and its applications to one-dimensional infinite potential and one-dimensional harmonic oscillator

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)

Bounds for percolation thresholds on directed and undirected graphs

Science.gov (United States)

Hamilton, Kathleen; Pryadko, Leonid

2015-03-01

Percolation theory is an efficient approach to problems with strong disorder, e.g., in quantum or classical transport, composite materials, and diluted magnets. Recently, the growing role of big data in scientific and industrial applications has led to a renewed interest in graph theory as a tool for describing complex connections in various kinds of networks: social, biological, technological, etc. In particular, percolation on graphs has been used to describe internet stability, spread of contagious diseases and computer viruses; related models describe market crashes and viral spread in social networks. We consider site-dependent percolation on directed and undirected graphs, and present several exact bounds for location of the percolation transition in terms of the eigenvalues of matrices associated with graphs, including the adjacency matrix and the Hashimoto matrix used to enumerate non-backtracking walks. These bounds correspond t0 a mean field approximation and become asymptotically exact for graphs with no short cycles. We illustrate this convergence numerically by simulating percolation on several families of graphs with different cycle lengths. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.

Fixation Time for Evolutionary Graphs

Science.gov (United States)

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.

The Stability Analysis Method of the Cohesive Granular Slope on the Basis of Graph Theory.

Science.gov (United States)

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.

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.

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

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.

Do massive compact objects without event horizon exist in infinite derivative gravity

NARCIS (Netherlands)

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

Disease management research using event graphs.

Science.gov (United States)

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.

Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings.

Science.gov (United States)

Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

2017-12-15

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory-such as Hall's marriage problem-are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

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.

Presurgery resting-state local graph-theory measures predict neurocognitive outcomes after brain surgery in temporal lobe epilepsy.

Science.gov (United States)

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

Coloring triangle-free graphs with fixed size

DEFF Research Database (Denmark)

Thomassen, Carsten; Gimbel, John

2000-01-01

Combining recent results on colorings and Ramsey theory, we show that if G is a triangle-free graph with e edges then the chromatic number of G is at most cel(1/3)(log e)(-2/3) for some constant c. In a previous paper, we found an upper bound on the chromatic number of a triangle-free graph of ge...

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 Quantum Graphs

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

Bond graphs : an integrating tool for design of mechatronic systems

International Nuclear Information System (INIS)

Ould Bouamama, B.

2011-01-01

Bond graph is a powerful tool well known for dynamic modelling of multi physical systems: This is the only modelling technique to generate automatically state space or non-linear models using dedicated software tools (CAMP-G, 20-Sim, Symbols, Dymola...). Recently several fundamental theories have been developed for using a bond graph model not only for modeling but also as a real integrated tool from conceptual ideas to optimal practical realization of mechatronic system. This keynote presents a synthesis of those new theories which exploit some particular properties (such as causal, structural and behavioral) of this graphical methodology. Based on a pedagogical example, it will be shown how from a physical system (not a transfer function or state equation) and using only one representation (Bond graph), the following results can be performed: modeling (formal state equations generation), Control analysis (observability, controllability, Structural I/O decouplability, dynamic decoupling,...) diagnosis analysis (automatic generation of robust fault indicators, sensor placement, structural diagnosability) and finally sizing of actuators. The presentation will be illustrated by real industrial applications. Limits and perspectives of bond graph theory conclude the keynote.

Bond graphs for modelling, control and fault diagnosis of engineering systems

CERN Document Server

2017-01-01

This book presents theory and latest application work in Bond Graph methodology with a focus on: • Hybrid dynamical system models, • Model-based fault diagnosis, model-based fault tolerant control, fault prognosis • and also addresses • Open thermodynamic systems with compressible fluid flow, • Distributed parameter models of mechanical subsystems. In addition, the book covers various applications of current interest ranging from motorised wheelchairs, in-vivo surgery robots, walking machines to wind-turbines.The up-to-date presentation has been made possible by experts who are active members of the worldwide bond graph modelling community. This book is the completely revised 2nd edition of the 2011 Springer compilation text titled Bond Graph Modelling of Engineering Systems – Theory, Applications and Software Support. It extends the presentation of theory and applications of graph methodology by new developments and latest research results. Like the first edition, this book addresses readers in a...

Quantum spin systems on infinite lattices a concise introduction

CERN Document Server

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

CERN Document Server

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

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

Evolutionary dynamics on infinite strategy spaces

OpenAIRE

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

Local adjacency metric dimension of sun graph and stacked book graph

Science.gov (United States)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

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.

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.

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.

Infinite matrices and sequence spaces

CERN Document Server

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

Linear Port-Hamiltonian Systems on Infinite-dimensional Spaces

CERN Document Server

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

Infinitely many N=1 dualities from m+1−m=1

Energy Technology Data Exchange (ETDEWEB)

Agarwal, Prarit; Intriligator, Kenneth; Song, Jaewon [Department of Physics, University of California,San Diego, La Jolla, CA 92093 (United States)

2015-10-06

We discuss two infinite classes of 4d supersymmetric theories, T{sub N}{sup (m)} and U{sub N}{sup (m)}, labelled by an arbitrary non-negative integer, m. The T{sub N}{sup (m)} theory arises from the 6d, A{sub N−1} type N=(2,0) theory reduced on a 3-punctured sphere, with normal bundle given by line bundles of degree (m+1,−m); the m=0 case is the N=2 supersymmetric T{sub N} theory. The novelty is the negative-degree line bundle. The U{sub N}{sup (m)} theories likewise arise from the 6d N=(2,0) theory on a 4-punctured sphere, and can be regarded as gluing together two (partially Higgsed) T{sub N}{sup (m)} theories. The T{sub N}{sup (m)} and U{sub N}{sup (m)} theories can be represented, in various duality frames, as quiver gauge theories, built from T{sub N} components via gauging and nilpotent Higgsing. We analyze the RG flow of the U{sub N}{sup (m)} theories, and find that, for all integer m>0, they end up at the same IR SCFT as SU(N) SQCD with 2N flavors and quartic superpotential. The U{sub N}{sup (m)} theories can thus be regarded as an infinite set of UV completions, dual to SQCD with N{sub f}=2N{sub c}. The U{sub N}{sup (m)} duals have different duality frame quiver representations, with 2m+1 gauge nodes.

Infinite Responsibility: An expression of Saintliness

OpenAIRE

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

Linear measure functional differential equations with infinite delay

OpenAIRE

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.

Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games

Science.gov (United States)

Peña, Jorge; Rochat, Yannick

2012-01-01

By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures. PMID:22970237

Guide for the 2 infinities - the infinitely big and the infinitely small

International Nuclear Information System (INIS)

Armengaud, E.; Arnaud, N.; Aubourg, E.; Bassler, U.; Binetruy, P.; Bouquet, A.; Boutigny, D.; Brun, P.; Chassande-Mottin, E.; Chardin, G.; Coustenis, A.; Descotes-Genon, S.; Dole, H.; Drouart, A.; Elbaz, D.; Ferrando, Ph.; Glicenstein, J.F.; Giraud-Heraud, Y.; Halloin, H.; Kerhoas-Cavata, S.; De Kerret, H.; Klein, E.; Lachieze-Rey, M.; Lagage, P.O.; Langer, M.; Lebrun, F.; Lequeux, J.; Meheut, H.; Moniez, M.; Palanque-Delabrouille, N.; Paul, J.; Piquemal, F.; Polci, F.; Proust, D.; Richard, F.; Robert, J.L.; Rosnet, Ph.; Roudeau, P.; Royole-Degieux, P.; Sacquin, Y.; Serreau, J.; Shifrin, G.; Sida, J.L.; Smith, D.; Sordini, V.; Spiro, M.; Stolarczyk, Th.; Suomijdrvi, T.; Tagger, M.; Vangioni, E.; Vauclair, S.; Vial, J.C.; Viaud, B.; Vignaud, D.

2010-01-01

This book is to be read from both ends: one is dedicated to the path towards the infinitely big and the other to the infinitely small. Each path is made of a series of various subject entries illustrating important concepts or achievements in the quest for the understanding of the concerned infinity. For instance the part concerning the infinitely small includes entries like: quarks, Higgs bosons, radiation detection, Chooz neutrinos... while the part for the infinitely big includes: the universe, cosmic radiations, black matter, antimatter... and a series of experiments such as HESS, INTEGRAL, ANTARES, JWST, LOFAR, Planck, LSST, SOHO, Virgo, VLT, or XMM-Newton. This popularization work includes also an important glossary that explains scientific terms used in the entries. (A.C.)

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.

RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

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

Direct computation of scattering matrices for general quantum graphs

International Nuclear Information System (INIS)

Caudrelier, V.; Ragoucy, E.

2010-01-01

We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired by the formalism of Reflection-Transmission algebras and quantum field theory on graphs though the results hold independently of this formalism. It yields a simple and direct algebraic derivation of the formula for the total scattering and has a number of advantages compared to existing recursive methods. The case of loops (or tadpoles) is easily incorporated in our method. This provides an extension of recent similar results obtained in a completely different way in the context of abstract graph theory. It also allows us to discuss briefly the inverse scattering problem in the presence of loops using an explicit example to show that the solution is not unique in general. On top of being conceptually very easy, the computational advantage of the method is illustrated on two examples of 'three-dimensional' graphs (tetrahedron and cube) for which other methods are rather heavy or even impractical.

Controllability for Semilinear Functional and Neutral Functional Evolution Equations with Infinite Delay in Frechet Spaces

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

Infinite slope stability under steady unsaturated seepage conditions

Science.gov (United States)

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.

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

Dynamics of infinite-dimensional groups the Ramsey-Dvoretzky-Milman phenomenon

CERN Document Server

Pestov, Vladimir

2006-01-01

The "infinite-dimensional groups" in the title refer to unitary groups of Hilbert spaces, the infinite symmetric group, groups of homeomorphisms of manifolds, groups of transformations of measure spaces, etc. The book presents an approach to the study of such groups based on ideas from geometric functional analysis and from exploring the interplay between dynamical properties of those groups, combinatorial Ramsey-type theorems, and the phenomenon of concentration of measure. The dynamics of infinite-dimensional groups is very much unlike that of locally compact groups. For instance, every locally compact group acts freely on a suitable compact space (Veech). By contrast, a 1983 result by Gromov and Milman states that whenever the unitary group of a separable Hilbert space continuously acts on a compact space, it has a common fixed point. In the book, this new fast-growing theory is built strictly from well-understood examples up. The book has no close counterpart and is based on recent research articles. At t...

Evolutionary Graphs with Frequency Dependent Fitness

Science.gov (United States)

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.

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.

Augmenting Conceptual Design Trajectory Tradespace Exploration with Graph Theory

Science.gov (United States)

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.

Integer Flows and Circuit Covers of Graphs and Signed Graphs

Science.gov (United States)

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

Herdable Systems Over Signed, Directed Graphs

KAUST Repository

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.

Herdable Systems Over Signed, Directed Graphs

KAUST Repository

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.

A graph rewriting programming language for graph drawing

OpenAIRE

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

Vertex Degrees and Isomorphic Properties in Complement of an m-Polar Fuzzy Graph

Directory of Open Access Journals (Sweden)

Ch. Ramprasad

2017-01-01

Full Text Available Computational intelligence and computer science rely on graph theory to solve combinatorial problems. Normal product and tensor product of an m-polar fuzzy graph have been introduced in this article. Degrees of vertices in various product graphs, like Cartesian product, composition, tensor product, and normal product, have been computed. Complement and μ-complement of an m-polar fuzzy graph are defined and some properties are studied. An application of an m-polar fuzzy graph is also presented in this article.

On the graph and systems analysis of reversible chemical reaction networks with mass action kinetics

NARCIS (Netherlands)

Rao, Shodhan; Jayawardhana, Bayu; Schaft, Arjan van der

2012-01-01

Motivated by the recent progresses on the interplay between the graph theory and systems theory, we revisit the analysis of reversible chemical reaction networks described by mass action kinetics by reformulating it using the graph knowledge of the underlying networks. Based on this formulation, we

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.

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

HAMMER, 1-D Multigroup Neutron Transport Infinite System Cell Calculation for Few-Group Diffusion Calculation

International Nuclear Information System (INIS)

Honeck, H.C.

1984-01-01

1 - Description of problem or function: HAMMER performs infinite lattice, one-dimensional cell multigroup calculations, followed (optionally) by one-dimensional, few-group, multi-region reactor calculations with neutron balance edits. 2 - Method of solution: Infinite lattice parameters are calculated by means of multigroup transport theory, composite reactor parameters by few-group diffusion theory. 3 - Restrictions on the complexity of the problem: - Cell calculations - maxima of: 30 thermal groups; 54 epithermal groups; 20 space points; 20 regions; 18 isotopes; 10 mixtures; 3 thermal up-scattering mixtures; 200 resonances per group; no overlap or interference; single level only. - Reactor calculations - maxima of : 40 regions; 40 mixtures; 250 space points; 4 groups

On The Determinant of q-Distance Matrix of a Graph

Directory of Open Access Journals (Sweden)

Li Hong-Hai

2014-02-01

Full Text Available In this note, we show how the determinant of the q-distance matrix Dq(T of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph G by adding the weighted branches to G, and so generalize in part the results obtained by Bapat et al. [R.B. Bapat, S. Kirkland and M. Neumann, On distance matrices and Laplacians, Linear Algebra Appl. 401 (2005 193- 209]. In particular, as a consequence, determinantal formulae of q-distance matrices for unicyclic graphs and one class of bicyclic graphs are presented.

Community detection by graph Voronoi diagrams

Science.gov (United States)

Deritei, Dávid; Lázár, Zsolt I.; Papp, István; Járai-Szabó, Ferenc; Sumi, Róbert; Varga, Levente; Ravasz Regan, Erzsébet; Ercsey-Ravasz, Mária

2014-06-01

Accurate and efficient community detection in networks is a key challenge for complex network theory and its applications. The problem is analogous to cluster analysis in data mining, a field rich in metric space-based methods. Common to these methods is a geometric, distance-based definition of clusters or communities. Here we propose a new geometric approach to graph community detection based on graph Voronoi diagrams. Our method serves as proof of principle that the definition of appropriate distance metrics on graphs can bring a rich set of metric space-based clustering methods to network science. We employ a simple edge metric that reflects the intra- or inter-community character of edges, and a graph density-based rule to identify seed nodes of Voronoi cells. Our algorithm outperforms most network community detection methods applicable to large networks on benchmark as well as real-world networks. In addition to offering a computationally efficient alternative for community detection, our method opens new avenues for adapting a wide range of data mining algorithms to complex networks from the class of centroid- and density-based clustering methods.

Graph Aggregation

NARCIS (Netherlands)

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

Infinite-genus surfaces and the universal Grassmannian

OpenAIRE

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

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

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.

Spectral stability of shifted states on star graphs

Science.gov (United States)

Kairzhan, Adilbek; Pelinovsky, Dmitry E.

2018-03-01

We consider the nonlinear Schrödinger (NLS) equation with the subcritical power nonlinearity on a star graph consisting of N edges and a single vertex under generalized Kirchhoff boundary conditions. The stationary NLS equation may admit a family of solitary waves parameterized by a translational parameter, which we call the shifted states. The two main examples include (i) the star graph with even N under the classical Kirchhoff boundary conditions and (ii) the star graph with one incoming edge and N  -  1 outgoing edges under a single constraint on coefficients of the generalized Kirchhoff boundary conditions. We obtain the general counting results on the Morse index of the shifted states and apply them to the two examples. In the case of (i), we prove that the shifted states with even N ≥slant 4 are saddle points of the action functional which are spectrally unstable under the NLS flow. In the case of (ii), we prove that the shifted states with the monotone profiles in the N  -  1 edges are spectrally stable, whereas the shifted states with non-monotone profiles in the N  -  1 edges are spectrally unstable, the two families intersect at the half-soliton states which are spectrally stable but nonlinearly unstable under the NLS flow. Since the NLS equation on a star graph with shifted states can be reduced to the homogeneous NLS equation on an infinite line, the spectral instability of shifted states is due to the perturbations breaking this reduction. We give a simple argument suggesting that the spectrally stable shifted states in the case of (ii) are nonlinearly unstable under the NLS flow due to the perturbations breaking the reduction to the homogeneous NLS equation.

PDB2Graph: A toolbox for identifying critical amino acids map in proteins based on graph theory.

Science.gov (United States)

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.

Bifurcating fronts for the Taylor-Couette problem in infinite cylinders

Science.gov (United States)

Hărăguş-Courcelle, M.; Schneider, G.

We show the existence of bifurcating fronts for the weakly unstable Taylor-Couette problem in an infinite cylinder. These fronts connect a stationary bifurcating pattern, here the Taylor vortices, with the trivial ground state, here the Couette flow. In order to show the existence result we improve a method which was already used in establishing the existence of bifurcating fronts for the Swift-Hohenberg equation by Collet and Eckmann, 1986, and by Eckmann and Wayne, 1991. The existence proof is based on spatial dynamics and center manifold theory. One of the difficulties in applying center manifold theory comes from an infinite number of eigenvalues on the imaginary axis for vanishing bifurcation parameter. But nevertheless, a finite dimensional reduction is possible, since the eigenvalues leave the imaginary axis with different velocities, if the bifurcation parameter is increased. In contrast to previous work we have to use normalform methods and a non-standard cut-off function to obtain a center manifold which is large enough to contain the bifurcating fronts.

Visibility graphs for fMRI data: Multiplex temporal graphs and their modulations across resting-state networks

Directory of Open Access Journals (Sweden)

Speranza Sannino

2017-10-01

Full Text Available Visibility algorithms are a family of methods that map time series into graphs, such that the tools of graph theory and network science can be used for the characterization of time series. This approach has proved a convenient tool, and visibility graphs have found applications across several disciplines. Recently, an approach has been proposed to extend this framework to multivariate time series, allowing a novel way to describe collective dynamics. Here we test their application to fMRI time series, following two main motivations, namely that (a this approach allows vs to simultaneously capture and process relevant aspects of both local and global dynamics in an easy and intuitive way, and (b this provides a suggestive bridge between time series and network theory that nicely fits the consolidating field of network neuroscience. Our application to a large open dataset reveals differences in the similarities of temporal networks (and thus in correlated dynamics across resting-state networks, and gives indications that some differences in brain activity connected to psychiatric disorders could be picked up by this approach. Here we present the first application of multivariate visibility graphs to fMRI data. Visibility graphs are a way to represent a time series as a temporal network, evidencing specific aspects of its dynamics, such as extreme events. Multivariate time series, as those encountered in neuroscience, and in fMRI in particular, can be seen as a multiplex network, in which each layer represents a time series (a region of interest in the brain in our case. Here we report the method, we describe some relevant aspects of its application to BOLD time series, and we discuss the analogies and differences with existing methods. Finally, we present an application to a high-quality, publicly available dataset, containing healthy subjects and psychotic patients, and we discuss our findings. All the code to reproduce the analyses and the

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

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.

To quantum averages through asymptotic expansion of classical averages on infinite-dimensional space

International Nuclear Information System (INIS)

Khrennikov, Andrei

2007-01-01

We study asymptotic expansions of Gaussian integrals of analytic functionals on infinite-dimensional spaces (Hilbert and nuclear Frechet). We obtain an asymptotic equality coupling the Gaussian integral and the trace of the composition of scaling of the covariation operator of a Gaussian measure and the second (Frechet) derivative of a functional. In this way we couple classical average (given by an infinite-dimensional Gaussian integral) and quantum average (given by the von Neumann trace formula). We can interpret this mathematical construction as a procedure of 'dequantization' of quantum mechanics. We represent quantum mechanics as an asymptotic projection of classical statistical mechanics with infinite-dimensional phase space. This space can be represented as the space of classical fields, so quantum mechanics is represented as a projection of 'prequantum classical statistical field theory'

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

Homology groups for particles on one-connected graphs

Science.gov (United States)

MaciÄ Żek, Tomasz; Sawicki, Adam

2017-06-01

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our approach is based on some fundamental combinatorial properties of the configuration spaces, Mayer-Vietoris sequences for different parts of configuration spaces, and some limited use of discrete Morse theory. As one of the results, we derive the closed-form formulae for ranks of the homology groups for indistinguishable particles on tree graphs. We also give a detailed discussion of the second homology group of the configuration space of both distinguishable and indistinguishable particles. Our motivation is the search for new kinds of quantum statistics.

Functional neural network analysis in frontotemporal dementia and Alzheimer's disease using EEG and graph theory

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.

Partition function expansion on region graphs and message-passing equations

International Nuclear Information System (INIS)

Zhou, Haijun; Wang, Chuang; Xiao, Jing-Qing; Bi, Zedong

2011-01-01

Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods. But finite-dimensional 'real' systems remain very challenging because of the abundance of short loops and strong local correlations. A statistical mechanics theory is constructed in this paper for finite-dimensional models based on the mathematical framework of the partition function expansion and the concept of region graphs. Rigorous expressions for the free energy and grand free energy are derived. Message-passing equations on the region graph, such as belief propagation and survey propagation, are also derived rigorously. (letter)

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.

Remark on the gravitational field produced by an infinite straight string

International Nuclear Information System (INIS)

Francisco, G.; Matsas, G.E.A.

1989-01-01

The results predicted by Newtonian gravity and general relativity are compared regarding the field produced by an infinite gauge string with constant density λ. A simple gedankenexperiment is suggested to stress the remarkable differences between these two theories. The existence of the usual Newtonian limit is discussed in this case

Automatic segmentation of closed-contour features in ophthalmic images using graph theory and dynamic programming

Science.gov (United States)

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

Geometric structure of chemistry-relevant graphs zigzags and central circuits

CERN Document Server

Deza, Michel-Marie; Shtogrin, Mikhail Ivanovitch

2015-01-01

The central theme of the present book is zigzags and central-circuits of three- or four-regular plane graphs, which allow a double covering or covering of the edgeset to be obtained. The book presents zigzag and central circuit structures of geometric fullerenes and several other classes of graph of interest in the fields of chemistry and mathematics. It also discusses the symmetries, parameterization and the Goldberg–Coxeter construction for those graphs. It is the first book on this subject, presenting full structure theory of such graphs. While many previous publications only addressed particular questions about selected graphs, this book is based on numerous computations and presents extensive data (tables and figures), as well as algorithmic and computational information. It will be of interest to researchers and students of discrete geometry, mathematical chemistry and combinatorics, as well as to lay mathematicians.

The new electromagnetic tetrads, infinite tetrad nesting and the non-trivial emergence of complex numbers in real theories of gravitation

Science.gov (United States)

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.

Semi-infinite assignment and transportation games

NARCIS (Netherlands)

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

Infinitely many solutions for a fourth-order boundary-value problem

Directory of Open Access Journals (Sweden)

Seyyed Mohsen Khalkhali

2012-09-01

Full Text Available In this article we consider the existence of infinitely many solutions to the fourth-order boundary-value problem $$displaylines{ u^{iv}+alpha u''+eta(x u=lambda f(x,u+h(u,quad xin]0,1[cr u(0=u(1=0,cr u''(0=u''(1=0,. }$$ Our approach is based on variational methods and critical point theory.

Interacting particle systems on graphs

Science.gov (United States)

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

Dispersion and energy conservation relations of surface waves in semi-infinite plasma

International Nuclear Information System (INIS)

Atanassov, V.

1981-01-01

The hydrodynamic theory of surface wave propagation in semi-infinite homogeneous isotropic plasma is considered. Explicit linear surface wave solutions are given for the electric and magnetic fields, charge and current densities. These solutions are used to obtain the well-known dispersion relations and, together with the general energy conservation equation, to find appropriate definitions for the energy and the energy flow densities of surface waves. These densities are associated with the dispersion relation and the group velocity by formulae similar to those for bulk waves in infinite plasmas. Both cases of high-frequency (HF) and low-frequency (LF) surface waves are considered. (author)

Conformally-flat, non-singular static metric in infinite derivative gravity

Science.gov (United States)

Buoninfante, Luca; Koshelev, Alexey S.; Lambiase, Gaetano; Marto, João; Mazumdar, Anupam

2018-06-01

In Einstein's theory of general relativity the vacuum solution yields a blackhole with a curvature singularity, where there exists a point-like source with a Dirac delta distribution which is introduced as a boundary condition in the static case. It has been known for a while that ghost-free infinite derivative theory of gravity can ameliorate such a singularity at least at the level of linear perturbation around the Minkowski background. In this paper, we will show that the Schwarzschild metric does not satisfy the boundary condition at the origin within infinite derivative theory of gravity, since a Dirac delta source is smeared out by non-local gravitational interaction. We will also show that the spacetime metric becomes conformally-flat and singularity-free within the non-local region, which can be also made devoid of an event horizon. Furthermore, the scale of non-locality ought to be as large as that of the Schwarzschild radius, in such a way that the gravitational potential in any metric has to be always bounded by one, implying that gravity remains weak from the infrared all the way up to the ultraviolet regime, in concurrence with the results obtained in [arXiv:1707.00273]. The singular Schwarzschild blackhole can now be potentially replaced by a non-singular compact object, whose core is governed by the mass and the effective scale of non-locality.

Applied and computational harmonic analysis on graphs and networks

Science.gov (United States)

Irion, Jeff; Saito, Naoki

2015-09-01

In recent years, the advent of new sensor technologies and social network infrastructure has provided huge opportunities and challenges for analyzing data recorded on such networks. In the case of data on regular lattices, computational harmonic analysis tools such as the Fourier and wavelet transforms have well-developed theories and proven track records of success. It is therefore quite important to extend such tools from the classical setting of regular lattices to the more general setting of graphs and networks. In this article, we first review basics of graph Laplacian matrices, whose eigenpairs are often interpreted as the frequencies and the Fourier basis vectors on a given graph. We point out, however, that such an interpretation is misleading unless the underlying graph is either an unweighted path or cycle. We then discuss our recent effort of constructing multiscale basis dictionaries on a graph, including the Hierarchical Graph Laplacian Eigenbasis Dictionary and the Generalized Haar-Walsh Wavelet Packet Dictionary, which are viewed as generalizations of the classical hierarchical block DCTs and the Haar-Walsh wavelet packets, respectively, to the graph setting. Finally, we demonstrate the usefulness of our dictionaries by using them to simultaneously segment and denoise 1-D noisy signals sampled on regular lattices, a problem where classical tools have difficulty.

Infinite number of integrals of motion in classically integrable system with boundary: Pt.2

International Nuclear Information System (INIS)

Chen Yixin; Luo Xudong

1998-01-01

In Affine Toda field theory, links among three generating functions for integrals of motion derived from Part (I) are studied, and some classically integrable boundary conditions are obtained. An infinite number of integrals of motion are calculated in ZMS model with quasi-periodic condition. The authors find the classically integrable boundary conditions and K +- matrices of ZMS model with independent boundary conditions on each end. It is identified that an infinite number of integrals of motion does exist and one of them is the Hamiltonian, so this system is completely integrable

On infinite regular and chiral maps

OpenAIRE

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.

Combinatorial and geometric aspects of Feynman graphs and Feynman integrals

Energy Technology Data Exchange (ETDEWEB)

Bergbauer, Christoph

2009-06-11

The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the

Combinatorial and geometric aspects of Feynman graphs and Feynman integrals

International Nuclear Information System (INIS)

Bergbauer, Christoph

2009-01-01

The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the

Infinite partial summations

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

Galilean Yang-Mills theory

Energy Technology Data Exchange (ETDEWEB)

Bagchi, Arjun [Center for Theoretical Physics, Massachusetts Institute of Technology,77 Massachusetts Avenue, Cambridge, MA 02139 (United States); Basu, Rudranil [Saha Institute of Nuclear Physics,Block AF, Sector 1, Bidhannagar, Kolkata 700068 (India); Kakkar, Ashish [Indian Institute of Science Education and Research,Dr Homi Bhabha Road, Pashan. Pune 411008 (India); Mehra, Aditya [Indian Institute of Science Education and Research,Dr Homi Bhabha Road, Pashan. Pune 411008 (India); Van Swinderen Institute for Particle Physics and Gravity, University of Groningen, Nijenborgh 4, 9747 AG Groningen (Netherlands)

2016-04-11

We investigate the symmetry structure of the non-relativistic limit of Yang-Mills theories. Generalising previous results in the Galilean limit of electrodynamics, we discover that for Yang-Mills theories there are a variety of limits inside the Galilean regime. We first explicitly work with the SU(2) theory and then generalise to SU(N) for all N, systematising our notation and analysis. We discover that the whole family of limits lead to different sectors of Galilean Yang-Mills theories and the equations of motion in each sector exhibit hitherto undiscovered infinite dimensional symmetries, viz. infinite Galilean Conformal symmetries in D=4. These provide the first examples of interacting Galilean Conformal Field Theories (GCFTs) in D>2.

Galilean Yang-Mills theory

International Nuclear Information System (INIS)

Bagchi, Arjun; Basu, Rudranil; Kakkar, Ashish; Mehra, Aditya

2016-01-01

We investigate the symmetry structure of the non-relativistic limit of Yang-Mills theories. Generalising previous results in the Galilean limit of electrodynamics, we discover that for Yang-Mills theories there are a variety of limits inside the Galilean regime. We first explicitly work with the SU(2) theory and then generalise to SU(N) for all N, systematising our notation and analysis. We discover that the whole family of limits lead to different sectors of Galilean Yang-Mills theories and the equations of motion in each sector exhibit hitherto undiscovered infinite dimensional symmetries, viz. infinite Galilean Conformal symmetries in D=4. These provide the first examples of interacting Galilean Conformal Field Theories (GCFTs) in D>2.

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

Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings

Science.gov (United States)

Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

2017-12-01

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory—such as Hall's marriage problem—are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

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.

Simplification of Markov chains with infinite state space and the mathematical theory of random gene expression bursts

Science.gov (United States)

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.

Does Guiding Toward Task-Relevant Information Help Improve Graph Processing and Graph Comprehension of Individuals with Low or High Numeracy? An Eye-Tracker Experiment.

Science.gov (United States)

Keller, Carmen; Junghans, Alex

2017-11-01

Individuals with low numeracy have difficulties with understanding complex graphs. Combining the information-processing approach to numeracy with graph comprehension and information-reduction theories, we examined whether high numerates' better comprehension might be explained by their closer attention to task-relevant graphical elements, from which they would expect numerical information to understand the graph. Furthermore, we investigated whether participants could be trained in improving their attention to task-relevant information and graph comprehension. In an eye-tracker experiment ( N = 110) involving a sample from the general population, we presented participants with 2 hypothetical scenarios (stomach cancer, leukemia) showing survival curves for 2 treatments. In the training condition, participants received written instructions on how to read the graph. In the control condition, participants received another text. We tracked participants' eye movements while they answered 9 knowledge questions. The sum constituted graph comprehension. We analyzed visual attention to task-relevant graphical elements by using relative fixation durations and relative fixation counts. The mediation analysis revealed a significant ( P attention to task-relevant information, which did not differ between the 2 conditions. Training had a significant main effect on visual attention ( P attention to task-relevant graphical elements than individuals with low numeracy. With appropriate instructions, both groups can be trained to improve their graph-processing efficiency. Future research should examine (e.g., motivational) mediators between visual attention and graph comprehension to develop appropriate instructions that also result in higher graph comprehension.

Independence theory in combinatorics an introductory account with applications to graphs and transversals

CERN Document Server

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

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

P. Anusha Devi

2015-10-01

Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

On the reachability and observability of path and cycle graphs

OpenAIRE

Parlangeli, Gianfranco; Notarstefano, Giuseppe

2011-01-01

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph...

Equity trees and graphs via information theory

Science.gov (United States)

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.

Computing decay rates for new physics theories with FeynRules  and MadGraph 5 _aMC@NLO

CERN Document Server

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.

On an edge partition and root graphs of some classes of line graphs

Directory of Open Access Journals (Sweden)

K Pravas

2017-04-01

Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

A generalized electro-magneto-thermo-elastic problem for an infinitely long solid cylinder

International Nuclear Information System (INIS)

Tianhu, H.; Xiaogeng, T.; Yapeng, S.; Tianhu, H.

2005-01-01

The theory of generalized thermoelasticity, based on the theory of Lord and Shulman with one relaxation time, is used to study the electro-magneto-thermo-elastic interactions in an infinitely long perfectly conducting solid cylinder subjected to a thermal shock on its surface when the cylinder and its adjoining vacuum is subjected to a uniform axial magnetic field. The cylinder deforms because of thermal shock, and due to the application of the magnetic field, there result an induced magnetic and an induced electric field in the cylinder. The Maxwell's equations are formulated and the generalized electro-magneto-thermo-elastic coupled governing equations are established. By means of the Laplace transform and numerical Laplace inversion the problem is solved. The distributions of the considered temperature, stress, displacement, induced magnetic and electric field are represented graphically. From the distributions, it can be found the electromagnetic-thermoelastic coupled effects and the wave type heat propagation in the medium. This indicates that the generalized heat conduction mechanism is completely different from the classic Fourier's in essence. In generalized thermoelasticity theory heat propagates as a wave with finite velocity instead of infinite velocity in medium. (authors)

The Quantified Characterization Method of the Micro-Macro Contacts of Three-Dimensional Granular Materials on the Basis of Graph Theory.

Science.gov (United States)

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.

Graphs cospectral with a friendship graph or its complement

Directory of Open Access Journals (Sweden)

Alireza Abdollahi

2013-12-01

Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

Infinitely many large energy solutions of superlinear Schrodinger-Maxwell equations

Directory of Open Access Journals (Sweden)

Lin Li

2012-12-01

Full Text Available In this article we study the existence of infinitely many large energy solutions for the superlinear Schrodinger-Maxwell equations $$displaylines{ -Delta u+V(xu+ phi u=f(x,u quad hbox{in }mathbb{R}^3,cr -Delta phi=u^2, quad hbox{in }mathbb{R}^3, }$$ via the Fountain Theorem in critical point theory. In particular, we do not use the classical Ambrosetti-Rabinowitz condition.

Models construction for acetone-butanol-ethanol fermentations with acetate/butyrate consecutively feeding by graph theory.

Science.gov (United States)

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.

Analysis of a planetary gear modelled with a contour graph considering the decision making complexity of game-tree structures

Directory of Open Access Journals (Sweden)

Deptuła Adam

2017-01-01

Full Text Available Analysis and synthesis of mechanisms is one of the fundamental tasks of engineering. Mechanisms can suffer from errors due to versatile reasons. Graph-based methods of analysis and synthesis of planetary gears constitute an alternative method for checking their correctness. Previous applications of the graph theory concerned modelling gears for dynamic analysis, kinematic analysis, synthesis, structural analysis, gearshift optimization and automatic design based on so-called graph grammars. Some tasks may be performed only with the methods resulting from the graph theory, e.g. enumeration of structural solutions. The contour plot method consists in distinguishing a series of consecutive rigid units of the analysed mechanism, forming a closed loop (so-called contour. At a later stage, it is possible to analyze the obtained contour graph as a directed graph of dependence. This work presents an example of the application of game-tree structures in describing the contour graph of a planetary gear. In addition, complex parametric tree structures are included.

Graph-theoretic approach to quantum correlations.

Science.gov (United States)

Cabello, Adán; Severini, Simone; Winter, Andreas

2014-01-31

Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

Phenotypic Graphs and Evolution Unfold the Standard Genetic Code as the Optimal

Science.gov (United States)

Zamudio, Gabriel S.; José, Marco V.

2018-03-01

In this work, we explicitly consider the evolution of the Standard Genetic Code (SGC) by assuming two evolutionary stages, to wit, the primeval RNY code and two intermediate codes in between. We used network theory and graph theory to measure the connectivity of each phenotypic graph. The connectivity values are compared to the values of the codes under different randomization scenarios. An error-correcting optimal code is one in which the algebraic connectivity is minimized. We show that the SGC is optimal in regard to its robustness and error-tolerance when compared to all random codes under different assumptions.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-11-12

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 existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

Is physics in the infinite momentum frame independent of the compactificaction radius?

International Nuclear Information System (INIS)

Gueijosa, A.

1998-01-01

With the aim of clarifying the eleven-dimensional content of matrix theory, we examine the dependence of a theory in the infinite momentum frame (IMF) on the (purely spatial) longitudinal compactification radius R. It is shown that in a point particle theory the generic scattering amplitude becomes independent of R in the IMF. Processes with zero longitudinal momentum transfer are found to be exceptional. The same question is addressed in a theory with extended objects. A one-loop type II string amplitude is shown to be R-independent in the IMF, and to coincide with that of the uncompactified theory. No exceptional processes exist in this case. The possible implications of these results for M theory are discussed. In particular, if amplitudes in M theory are independent of R in the IMF, matrix theory can be rightfully expected (in the N→∞ limit) to describe uncompactified M theory. (orig.)

The nominalized infinitive in French : structure and change

Directory of Open Access Journals (Sweden)

Petra Sleeman

2010-01-01

Full Text Available Many European languages have both nominal and verbal nominalized infinitives. They differ, however, in the degree to which the nominalized infinitives possess nominal and verbal properties. In this paper, nominalized infinitives in French are analyzed. It is shown that, whereas Old French was like other Romance languages in possessing both nominal and verbal nominalized infinitives, Modern French differs parametrically from other Romance languages in not having verbal infinitives and in allowing nominal infinitives only in a scientific style of speech. An analysis is proposed, within a syntactic approach to morphology. that tries to account for the loss of the verbal properties of the nominalized infinitive in French. It is proposed that the loss results from a change in word order (the loss of the OV word order in favor of the VO word order and a change in the morphological analysis of the nominalized infinitive: instead of a zero suffix analysis, a derivational analysis was adopted by the speakers of French. It is argued that the derivational analysis restricted nominalization to Vo, which made nominalization of infinitives less ìverbalî than in other Romance languages

Learning molecular energies using localized graph kernels

Science.gov (United States)

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.

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

Science.gov (United States)

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

Graph theoretical model of a sensorimotor connectome in zebrafish.

Science.gov (United States)

Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

2012-01-01

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

The R{sup ∗}-operation for Feynman graphs with generic numerators

Energy Technology Data Exchange (ETDEWEB)

Herzog, Franz [Nikhef Theory Group,Science Park 105, 1098 XG Amsterdam (Netherlands); Ruijl, Ben [Nikhef Theory Group,Science Park 105, 1098 XG Amsterdam (Netherlands); Leiden University,Niels Bohrweg 1, 2333 CA Leiden (Netherlands)

2017-05-08

The R{sup ∗}-operation by Chetyrkin, Tkachov, and Smirnov is a generalisation of the BPHZ R-operation, which subtracts both ultraviolet and infrared divergences of euclidean Feynman graphs with non-exceptional external momenta. It can be used to compute the divergent parts of such Feynman graphs from products of simpler Feynman graphs of lower loops. In this paper we extend the R{sup ∗}-operation to Feynman graphs with arbitrary numerators, including tensors. We also provide a novel way of defining infrared counterterms which closely resembles the definition of its ultraviolet counterpart. We further express both infrared and ultraviolet counterterms in terms of scaleless vacuum graphs with a logarithmic degree of divergence. By exploiting symmetries, integrand and integral relations, which the counterterms of scaleless vacuum graphs satisfy, we can vastly reduce their number and complexity. A FORM implementation of this method was used to compute the five loop beta function in QCD for a general gauge group. To illustrate the procedure, we compute the poles in the dimensional regulator of all top-level propagator graphs at five loops in four dimensional ϕ{sup 3} theory.

Supersymmetric Racah basis, family of infinite-dimensional superalgebras, SU(∞ + 1|∞) and related 2D models

International Nuclear Information System (INIS)

Fradkin, E.S.; Linetsky, V.Ya.

1990-10-01

The irreducible Racah basis for SU(N + 1|N) is introduced. An analytic continuation with respect to N leads to infinite-dimensional superalgebras su(υ + 1|υ). Large υ limit su(∞ + 1|∞) is calculated. The higher spin Sugawara construction leading to generalizations of the Virasoro algebra with infinite tower of higher spin currents is proposed and related WZNW and Toda models as well as possible applications in string theory are discussed. (author). 32 refs

Function spaces with uniform, fine and graph topologies

CERN Document Server

McCoy, Robert A; Jindal, Varun

2018-01-01

This book presents a comprehensive account of the theory of spaces of continuous functions under uniform, fine and graph topologies. Besides giving full details of known results, an attempt is made to give generalizations wherever possible, enriching the existing literature. The goal of this monograph is to provide an extensive study of the uniform, fine and graph topologies on the space C(X,Y) of all continuous functions from a Tychonoff space X to a metric space (Y,d); and the uniform and fine topologies on the space H(X) of all self-homeomorphisms on a metric space (X,d). The subject matter of this monograph is significant from the theoretical viewpoint, but also has applications in areas such as analysis, approximation theory and differential topology. Written in an accessible style, this book will be of interest to researchers as well as graduate students in this vibrant research area.

Semi-infinite fractional programming

CERN Document Server

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

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

Handbook of graph grammars and computing by graph transformation

CERN Document Server

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

Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2014)

DEFF Research Database (Denmark)

2014-01-01

is to foster the convergence on research interests from several communities dealing with graph analysis in all its forms in computer science, with a particular attention to software development and analysis. Graphs are used to represent data and processes in many application areas, and they are subjected......These are the proceedings of the Third Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2014), which took place on April 5, 2014 in Grenoble, France, as a satellite event of the 17th European Joint Conferences on Theory and Practice of Software (ETAPS 2014). The aim of GRAPHITE...... to various computational algorithms in order to analyze them. Just restricting the attention to the analysis of software, graph analysis algorithms are used, for instance, to verify properties using model checking techniques that explore the system's state space graph or static analysis techniques based...

Discrete Morse functions for graph configuration spaces

International Nuclear Information System (INIS)

Sawicki, A

2012-01-01

We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions, which have a nice physical interpretation as two-body potentials constructed from one-body potentials. We also give a brief introduction to discrete Morse theory. Our motivation comes from the problem of quantum statistics for particles on networks, for which generalized versions of anyon statistics can appear. (paper)

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

A closed graph theorem for order bounded operators | Harm van der ...

African Journals Online (AJOL)

... theory to prove a version of the closed graph theorem for order bounded operators on Archimedean vector lattices. This illustrates the usefulness of convergence spaces in dealing with problems in vector lattice theory, problems that may fail to be amenable to the usual Hausdorff-Kuratowski-Bourbaki concept of topology.

Böhm Reduction in Infinitary Term Graph Rewriting Systems

DEFF Research Database (Denmark)

Bahr, Patrick

2017-01-01

a corresponding theory of Böhm reduction for term graphs. Our main result is that partial order convergence in a term graph rewriting system can be truthfully and faithfully simulated by metric convergence in the Böhm extension of the system. To prove this result we generalise the notion of residuals...... that `meaningless terms' can be contracted to a fresh constant ⊥. In previous work, we have established that Böhm reduction can be instead characterised by a different mode of convergences of transfinite reductions that is based on a partial order structure instead of a metric space. In this paper, we develop...... and projections to the setting of infinitary term graph rewriting. As ancillary results we prove the infinitary strip lemma and the compression property, both for partial order and metric convergence....

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

Representation and integration of sociological knowledge using knowledge graphs

NARCIS (Netherlands)

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

Theory of the Andreev reflection and the density of states in proximity contact normal-superconducting infinite double-layer

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

Analysis of the neutrons dispersion in a semi-infinite medium based in transport theory and the Monte Carlo method

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)

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

Graph theoretical model of a sensorimotor connectome in zebrafish.

Directory of Open Access Journals (Sweden)

Michael Stobb

Full Text Available Mapping the detailed connectivity patterns (connectomes of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

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)

Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery.

Science.gov (United States)

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.

Infinitely many inequivalent field theories from one Lagrangian

CERN Document Server

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}(\

Gauge theories as theories of spontaneous breakdown

International Nuclear Information System (INIS)

Ivanov, E.A.; Ogievetsky, V.I.

1976-01-01

Any gauge theory is proved to arise from spontaneous breakdown of symmetry under certain infinite parameter group, the corresponding gauge field being the Goldstone field by which this breakdown is accompanied

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

The use of graph theory in the sensitivity analysis of the model output: a second order screening method

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'

EIT Imaging Regularization Based on Spectral Graph Wavelets.

Science.gov (United States)

Gong, Bo; Schullcke, Benjamin; Krueger-Ziolek, Sabine; Vauhkonen, Marko; Wolf, Gerhard; Mueller-Lisse, Ullrich; Moeller, Knut

2017-09-01

The objective of electrical impedance tomographic reconstruction is to identify the distribution of tissue conductivity from electrical boundary conditions. This is an ill-posed inverse problem usually solved under the finite-element method framework. In previous studies, standard sparse regularization was used for difference electrical impedance tomography to achieve a sparse solution. However, regarding elementwise sparsity, standard sparse regularization interferes with the smoothness of conductivity distribution between neighboring elements and is sensitive to noise. As an effect, the reconstructed images are spiky and depict a lack of smoothness. Such unexpected artifacts are not realistic and may lead to misinterpretation in clinical applications. To eliminate such artifacts, we present a novel sparse regularization method that uses spectral graph wavelet transforms. Single-scale or multiscale graph wavelet transforms are employed to introduce local smoothness on different scales into the reconstructed images. The proposed approach relies on viewing finite-element meshes as undirected graphs and applying wavelet transforms derived from spectral graph theory. Reconstruction results from simulations, a phantom experiment, and patient data suggest that our algorithm is more robust to noise and produces more reliable images.

Higher order radiative corrections to electron anomaly in QED; a remark on asymptotic behaviour of vacuum polarization insertions and explicit analytic values of the first six ladder graphs

International Nuclear Information System (INIS)

Caffo, M.; Turrini, S.; Remiddi, E.

1978-04-01

As a comment to a recent paper by B. Lautrup we show that the series of multiple lowest order vacuum polarization insertions in the lowest vertex graph is convergent for finite Pauli-Villars regularizing mass, and becomes divergent in the limit of infinite regularizing mass. We then evaluate, analytically, the contributions due to the first twelve vacuum polarization insertions. We consider also the contributions to the electron anomaly due to the vertex ladder graphs. They are all positive and growing fast; the ratio between two successive ones is also growing, up to 2.95 for the last two we evaluate. (orig.) [de

Large deviations for noninteracting infinite-particle systems

International Nuclear Information System (INIS)

Donsker, M.D.; Varadhan, S.R.S.

1987-01-01

A large deviation property is established for noninteracting infinite particle systems. Previous large deviation results obtained by the authors involved a single I-function because the cases treated always involved a unique invariant measure for the process. In the context of this paper there is an infinite family of invariant measures and a corresponding infinite family of I-functions governing the large deviations

Maximum-entropy networks pattern detection, network reconstruction and graph combinatorics

CERN Document Server

Squartini, Tiziano

2017-01-01

This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties.  After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem o...

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

DEFF Research Database (Denmark)

Bensmail, Julien; Renault, Gabriel

2016-01-01

An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

Non-heuristic reduction of the graph in graph-cut optimization

International Nuclear Information System (INIS)

Malgouyres, François; Lermé, Nicolas

2012-01-01

During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

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

Total colourings of graphs

CERN Document Server

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.

Matching theory

CERN Document Server

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.

Graphing trillions of triangles.

Science.gov (United States)

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.

Using graph theory to analyze the vulnerability of process plants in the context of cascading effects

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

Causal inference, probability theory, and graphical insights.

Science.gov (United States)

Baker, Stuart G

2013-11-10

Causal inference from observational studies is a fundamental topic in biostatistics. The causal graph literature typically views probability theory as insufficient to express causal concepts in observational studies. In contrast, the view here is that probability theory is a desirable and sufficient basis for many topics in causal inference for the following two reasons. First, probability theory is generally more flexible than causal graphs: Besides explaining such causal graph topics as M-bias (adjusting for a collider) and bias amplification and attenuation (when adjusting for instrumental variable), probability theory is also the foundation of the paired availability design for historical controls, which does not fit into a causal graph framework. Second, probability theory is the basis for insightful graphical displays including the BK-Plot for understanding Simpson's paradox with a binary confounder, the BK2-Plot for understanding bias amplification and attenuation in the presence of an unobserved binary confounder, and the PAD-Plot for understanding the principal stratification component of the paired availability design. Published 2013. This article is a US Government work and is in the public domain in the USA.

Generalised boundary terms for higher derivative theories of gravity

Energy Technology Data Exchange (ETDEWEB)

Teimouri, Ali; Talaganis, Spyridon; Edholm, James [Consortium for Fundamental Physics, Lancaster University,North West Drive, Lancaster, LA1 4YB (United Kingdom); Mazumdar, Anupam [Consortium for Fundamental Physics, Lancaster University,North West Drive, Lancaster, LA1 4YB (United Kingdom); Kapteyn Astronomical Institute, University of Groningen,9700 AV Groningen (Netherlands)

2016-08-24

In this paper we wish to find the corresponding Gibbons-Hawking-York term for the most general quadratic in curvature gravity by using Coframe slicing within the Arnowitt-Deser-Misner (ADM) decomposition of spacetime in four dimensions. In order to make sure that the higher derivative gravity is ghost and tachyon free at a perturbative level, one requires infinite covariant derivatives, which yields a generalised covariant infinite derivative theory of gravity. We will be exploring the boundary term for such a covariant infinite derivative theory of gravity.

Adaptive Graph Convolutional Neural Networks

OpenAIRE

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

Proving productivity in infinite data structures

NARCIS (Netherlands)

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

Variational Infinite Hidden Conditional Random Fields

NARCIS (Netherlands)

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

Fitting of Hadron Mass Spectra and Contributions to Perturbation Theory of Conformal Quantum Field Theory

Science.gov (United States)

Luna Acosta, German Aurelio

The masses of observed hadrons are fitted according to the kinematic predictions of Conformal Relativity. The hypothesis gives a remarkably good fit. The isospin SU(2) gauge invariant Lagrangian L(,(pi)NN)(x,(lamda)) is used in the calculation of d(sigma)/d(OMEGA) to 2nd-order Feynman graphs for simplified models of (pi)N(--->)(pi)N. The resulting infinite mass sums over the nucleon (Conformal) families are done via the Generalized-Sommerfeld-Watson Transform Theorem. Even though the models are too simple to be realistic, they indicate that if (DELTA)-internal lines were to be included, 2nd-order Feynman graphs may reproduce the experimental data qualitatively. The energy -dependence of the propagator and couplings in Conformal QFT is different from that of ordinary QFT. Suggestions for further work are made in the areas of ultra-violet divergences and OPEC calculations.

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

Directory of Open Access Journals (Sweden)

Mehmet Fatih Öçal

2017-01-01

Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs

Science.gov (United States)

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

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

Science.gov (United States)

2017-09-01

are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

Solution of the radiative transfer equation for Rayleigh scattering using the infinite medium Green's function

Science.gov (United States)

Biçer, M.; Kaşkaş, A.

2018-03-01

The infinite medium Green's function is used to solve the half-space albedo, slab albedo and Milne problems for the unpolarized Rayleigh scattering case; these problems are the most classical problems of radiative transfer theory. The numerical results are obtained and are compared with previous ones.

On the sizes of expander graphs and minimum distances of graph codes

DEFF Research Database (Denmark)

Høholdt, Tom; Justesen, Jørn

2014-01-01

We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

Similarity Measure of Graphs

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.

Component efficient solutions in line-graph games with applications

NARCIS (Netherlands)

van den Brink, J.R.; van der Laan, G.; Vasil'ev, V.

2007-01-01

Recently, applications of cooperative game theory to economic allocation problems have gained popularity. We investigate a class of cooperative games that generalizes some economic applications with a similar structure. These are the so-called line-graph games being cooperative TU-games in which the

Random Walks and Diffusions on Graphs and Databases An Introduction

CERN Document Server

Blanchard, Philippe

2011-01-01

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

Spectra of Graphs

NARCIS (Netherlands)

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

Quantum diffusion in semi-infinite periodic and quasiperiodic systems

International Nuclear Information System (INIS)

Zhang Kaiwang

2008-01-01

This paper studies quantum diffusion in semi-infinite one-dimensional periodic lattice and quasiperiodic Fibonacci lattice. It finds that the quantum diffusion in the semi-infinite periodic lattice shows the same properties as that for the infinite periodic lattice. Different behaviour is found for the semi-infinite Fibonacci lattice. In this case, there are still C(t) ∼ t −δ and d(t) ∼ t β . However, it finds that 0 < δ < 1 for smaller time, and δ = 0 for larger time due to the influence of surface localized states. Moreover, β for the semi-infinite Fibonacci lattice is much smaller than that for the infinite Fibonacci lattice. Effects of disorder on the quantum diffusion are also discussed

Semi-infinite Weil complex and the Virasoro algebra

International Nuclear Information System (INIS)

Feigin, B.; Frenkel, E.

1991-01-01

We define a semi-infinite analogue of the Weil algebra associated with an infinite-dimensional Lie algebra. It can be used for the definition of semi-infinite characteristic classes by analogy with the Chern-Weil construction. The second term of a spectral sequence of this Weil complex consists of the semi-infinite cohomology of the Lie algebra with coefficients in its 'adjoint semi-infinite symmetric powers'. We compute this cohomology for the Virasoro algebra. This is just the BRST cohomology of the bosonic βγ-system with the central charge 26. We give a complete description of the Fock representations of this bosonic system as modules over the Virasoro algebra, using Friedan-Martinec-Shenker bosonization. We derive a combinatorial identity from this result. (orig.)

Smooth controllability of infinite-dimensional quantum-mechanical systems

International Nuclear Information System (INIS)

Wu, Re-Bing; Tarn, Tzyh-Jong; Li, Chun-Wen

2006-01-01

Manipulation of infinite-dimensional quantum systems is important to controlling complex quantum dynamics with many practical physical and chemical backgrounds. In this paper, a general investigation is casted to the controllability problem of quantum systems evolving on infinite-dimensional manifolds. Recognizing that such problems are related with infinite-dimensional controllability algebras, we introduce an algebraic mathematical framework to describe quantum control systems possessing such controllability algebras. Then we present the concept of smooth controllability on infinite-dimensional manifolds, and draw the main result on approximate strong smooth controllability. This is a nontrivial extension of the existing controllability results based on the analysis over finite-dimensional vector spaces to analysis over infinite-dimensional manifolds. It also opens up many interesting problems for future studies

Determining neutron multiplication factor in the infinite system by reactivity dependence on one dimension of the reactor core

International Nuclear Information System (INIS)

Pesic, M.

1975-01-01

The objective of this task was to apply Fermi age theory for determining τ and neutron multiplication factor in infinite medium by measuring reactivity coefficient of heavy water in heterogeneous mixed reactor lattice. Basis of experiment is the measurement of stable reactor period. Measurement of heavy water reactivity coefficient by measuring the stable reactor period is described for chosen overcritical heavy water levels. Calculated values of infinite multiplication factor for measured neutron age data are presented and they are compared to expected theoretical values

Graph Theory-Based Brain Connectivity for Automatic Classification of Multiple Sclerosis Clinical Courses

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.

Quantifying Riverscape Connectivity with Graph Theory

Science.gov (United States)

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

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

Improving the Instruction of Infinite Series

Science.gov (United States)

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…

Further Development of HS Field Theory

Science.gov (United States)

Abdurrahman, Abdulmajeed; Faridani, Jacqueline; Gassem, Mahmoud

2006-04-01

We present a systematic treatment of the HS Field theory of the open bosonic string and discuss its relationship to other full string field theories of the open bosonic string such as Witten's theory and the CVS theory. In the development of the HS field theory we encounter infinite dimensional matrices arising from the change of representation between the two theories, i.e., the HS field theory and the full string field theory. We give a general procedure of how to invert these gigantic matrices. The inversion of these matrices involves the computation of many infinite sums. We give the values of these sums and state their generalizations arising from considering higher order vertices (i.e., more than three strings) in string field theory. Moreover, we give a general procedure, on how to evaluate the generalized sums, that can be extended to many generic sums of similar properties. We also discuss the conformal operator connecting the HS field theory to that of the CVS string field theory.

Supersolids: Solids Having Finite Volume and Infinite Surfaces.

Science.gov (United States)

Love, William P.

1989-01-01

Supersolids furnish an ideal introduction to the calculus topic of infinite series, and are useful for combining that topic with integration. Five examples of supersolids are presented, four requiring only a few basic properties of infinite series and one requiring a number of integration principles as well as infinite series. (MNS)

Generalized continued fractions and ergodic theory

International Nuclear Information System (INIS)

Pustyl'nikov, L D

2003-01-01

In this paper a new theory of generalized continued fractions is constructed and applied to numbers, multidimensional vectors belonging to a real space, and infinite-dimensional vectors with integral coordinates. The theory is based on a concept generalizing the procedure for constructing the classical continued fractions and substantially using ergodic theory. One of the versions of the theory is related to differential equations. In the finite-dimensional case the constructions thus introduced are used to solve problems posed by Weyl in analysis and number theory concerning estimates of trigonometric sums and of the remainder in the distribution law for the fractional parts of the values of a polynomial, and also the problem of characterizing algebraic and transcendental numbers with the use of generalized continued fractions. Infinite-dimensional generalized continued fractions are applied to estimate sums of Legendre symbols and to obtain new results in the classical problem of the distribution of quadratic residues and non-residues modulo a prime. In the course of constructing these continued fractions, an investigation is carried out of the ergodic properties of a class of infinite-dimensional dynamical systems which are also of independent interest

Graph visualization (Invited talk)

NARCIS (Netherlands)

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.