Graph-theoretic Conditions Research Articles

Ricci curvature, circulants, and a matching condition

The Ricci curvature of graphs, as recently introduced by Lin, Lu, and Yau following a general concept due to Ollivier, provides a new and promising isomorphism invariant. This paper presents a simplified exposition of the concept, including the so-called logistic diagram as a computational or visualization aid. Two new infinite classes of graphs with positive Ricci curvature are identified. A local graph-theoretical condition, known as the matching condition, provides a general formula for Ricci curvatures. The paper initiates a longer-term program of classifying the Ricci curvatures of circulant graphs. Aspects of this program may prove useful in tackling the problem of showing when twisted tori are not isomorphic to circulants.

Binary frames, graphs and erasures

This paper examines binary codes from a frame-theoretic viewpoint. Binary Parseval frames have convenient encoding and decoding maps. We characterize binary Parseval frames that are robust to one or two erasures. These characterizations are given in terms of the associated Gram matrix and with graph-theoretic conditions. We illustrate these results with frames in lowest dimensions that are robust to one or two erasures. In addition, we present necessary conditions for correcting a larger number of erasures. As in a previous paper, we emphasize in which ways the binary theory differs from the theory of frames for real and complex Hilbert spaces.

Regular languages and partial commutations

The closure of a regular language under a [partial] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular? (2) Are there any robust classes of languages closed under [partial] commutation? We show that the class Pol(G) of polynomials of group languages is closed under commutation, and under partial commutation when the complement of I in A2 is a transitive relation. We also give a sufficient graph theoretic condition on I to ensure that the closure of a language of Pol(G) under I-commutation is regular. We exhibit a very robust class of languages W which is closed under commutation. This class contains Pol(G), is decidable and can be defined as the largest positive variety of languages not containing (ab)⁎. It is also closed under intersection, union, shuffle, concatenation, quotients, length-decreasing morphisms and inverses of morphisms. If I is transitive, we show that the closure of a language of W under I-commutation is regular. The proofs are nontrivial and combine several advanced techniques, including combinatorial Ramsey type arguments, algebraic properties of the syntactic monoid, finiteness conditions on semigroups and properties of insertion systems.

A graph-theoretic condition for irreducibility of a set of cone preserving matrices

Given a closed, convex and pointed cone K in Rn, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and the main result is relevant to applications in biology and chemistry. Several examples are presented.

Graph-theoretic conditions for zero-eigenvalue Turing instability in general chemical reaction networks.

We describe a necessary condition for zero-eigenvalue Turing instability, i.e., Turing instability arising from a real eigenvalue changing sign from negative to positive, for general chemical reaction networks modeled with mass-action kinetics. The reaction mechanisms are represented by the species-reaction graph (SR graph), which is a bipartite graph with different nodes representing species and reactions. If the SR graph satisfies certain conditions, similar to the conditions for ruling out multiple equilibria in spatially homogeneous differential equations systems, then the corresponding mass-action reaction-diffusion system cannot exhibit zero-eigenvalue Turing instability for any parameter values. On the other hand, if the graph-theoretic condition for ruling out zero-eigenvalue Turing instability is not satisfied, then the corresponding model may display zero-eigenvalue Turing instability for some parameter values. The technique is illustrated with a model of a bifunctional enzyme.

Generalized Monogamy of Contextual Inequalities from the No-Disturbance Principle

In this Letter, we demonstrate that the property of monogamy of Bell violations seen for no-signaling correlations in composite systems can be generalized to the monogamy of contextuality in single systems obeying the Gleason property of no disturbance. We show how one can construct monogamies for contextual inequalities by using the graph-theoretic technique of vertex decomposition of a graph representing a set of measurements into subgraphs of suitable independence numbers that themselves admit a joint probability distribution. After establishing that all the subgraphs that are chordal graphs admit a joint probability distribution, we formulate a precise graph-theoretic condition that gives rise to the monogamy of contextuality. We also show how such monogamies arise within quantum theory for a single four-dimensional system and interpret violation of these relations in terms of a violation of causality. These monogamies can be tested with current experimental techniques.

Turing-Hopf instability in biochemical reaction networks arising from pairs of subnetworks

Network conditions for Turing instability in biochemical systems with two biochemical species are well known and involve autocatalysis or self-activation. On the other hand general network conditions for potential Turing instabilities in large biochemical reaction networks are not well developed. A biochemical reaction network with any number of species where only one species moves is represented by a simple digraph and is modeled by a reaction–diffusion system with non-mass action kinetics. A graph-theoretic condition for potential Turing-Hopf instability that arises when a spatially homogeneous equilibrium loses its stability via a single pair of complex eigenvalues is obtained. This novel graph-theoretic condition is closely related to the negative cycle condition for oscillations in ordinary differential equation models and its generalizations, and requires the existence of a pair of subnetworks, each containing an even number of positive cycles. The technique is illustrated with a double-cycle Goodwin type model.

Oscillations in non-mass action kinetics models of biochemical reaction networks arising from pairs of subnetworks

It is well known that oscillations in models of biochemical reaction networks can arise as a result of a single negative cycle. On the other hand, methods for finding general network conditions for potential oscillations in large biochemical reaction networks containing many cycles are not well developed. A biochemical reaction network with any number of species is represented by a simple digraph and is modeled by an ordinary differential equation (ODE) system with non-mass action kinetics. The obtained graph-theoretic condition generalizes the negative cycle condition for oscillations in ODE models to the existence of a pair of subnetworks, where each subnetwork contains an even number of positive cycles. The technique is illustrated with a model of genetic regulation.

On quantum network coding

We study the problem of error-free multiple unicast over directed acyclic networks in a quantum setting. We provide a new information-theoretic proof of the known result that network coding does not achieve a larger quantum information flow than what can be achieved by routing for two-pair communication on the butterfly network. We then consider a k-pair multiple unicast problem and for all k ⩾ 2 we show that there exists a family of networks where quantum network coding achieves k-times larger quantum information flow than what can be achieved by routing. Finally, we specify a graph-theoretic sufficient condition for the quantum information flow of any multiple unicast problem to be bounded by the capacity of any sparsest multicut of the network.

Oscillations in Biochemical Reaction Networks Arising from Pairs of Subnetworks

Biochemical reaction models show a variety of dynamical behaviors, such as stable steady states, multistability, and oscillations. Biochemical reaction networks with generalized mass action kinetics are represented as directed bipartite graphs with nodes for species and reactions. The bipartite graph of a biochemical reaction network usually contains at least one cycle, i.e., a sequence of nodes and directed edges which starts and ends at the same species node. Cycles can be positive or negative, and it has been shown that oscillations can arise as a result of either a positive cycle or a negative cycle. In earlier work it was shown that oscillations associated with a positive cycle can arise from subnetworks with an odd number of positive cycles. In this article we formulate a similar graph-theoretic condition, which generalizes the negative cycle condition for oscillations. This new graph-theoretic condition for oscillations involves pairs of subnetworks with an even number of positive cycles. An example of a calcium reaction network with generalized mass action kinetics is discussed in detail.

Secure Network Coding on a Wiretap Network

In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the network can be utilized. In this paper, we propose a model, call the wiretap network, that incorporates information security with network coding. In this model, a collection of subsets of the channels in the network is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing in classical cryptography as a special case. We present a construction of secure linear network codes that can be used provided a certain graph-theoretic condition is satisfied. We also prove the necessity of this condition for the special case that the wiretapper may choose to access any subset of channels of a fixed size. The optimality of our code construction is established for this special case. Finally, we extend our results to the scenario when the wiretapper is allowed to obtain a controlled amount of information about the message.

Graph-theoretic conditions for injectivity of functions on rectangular domains

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R n . The results have implications for the possibility of multiple fixed points of maps and flows. Well-known results on systems with signed Jacobians are shown to be easy corollaries of more general results presented here.

Graph-theoretic criteria for injectivity and unique equilibria in general chemical reaction systems

In this paper we discuss the question of how to decide when a general chemical reaction system is incapable of admitting multiple equilibria, regardless of parameter values such as reaction rate constants, and regardless of the type of chemical kinetics, such as mass-action kinetics, Michaelis–Menten kinetics, etc. Our results relate previously described linear algebraic and graph-theoretic conditions for injectivity of chemical reaction systems. After developing a translation between the two formalisms, we show that a graph-theoretic test developed earlier in the context of systems with mass action kinetics, can be applied to reaction systems with kinetics subject only to some weak natural constraints. The test, which is easy to implement algorithmically, and can often be decided without the need for any computation, rules out the possibility of multiple equilibria for the systems in question.

Proportional Plus Integral Control for Set-Point Regulation of a Class of Nonlinear RLC Circuits

In this paper we identify graph-theoretic conditions which allow us to write a nonlinear RLC circuit as port-Hamiltonian with constant input matrices. We show that under additional monotonicity conditions on the network’s components, the circuit enjoys the property of relative passivity, an extended notion of classical passivity. The property of relative passivity is then used to build simple, yet robust and globally stable, proportional plus integral controllers.

Regularity Conditions for Arbitrary Leavitt Path Algebras

We show that if E is an arbitrary acyclic graph then the Leavitt path algebra L K (E) is locally K-matricial; that is, L K (E) is the direct union of subalgebras, each isomorphic to a finite direct sum of finite matrix rings over the field K. (Here an arbitrary graph means that neither cardinality conditions nor graph-theoretic conditions (e.g. row-finiteness) are imposed on E. These unrestrictive conditions are in contrast to the hypotheses used in much of the literature on this subject.) As a consequence we get our main result, in which we show that the following conditions are equivalent for an arbitrary graph E: (1) L K (E) is von Neumann regular. (2) L K (E) is π-regular. (3) E is acyclic. (4) L K (E) is locally K-matricial. (5) L K (E) is strongly π-regular. We conclude by showing how additional regularity conditions (unit regularity, strongly clean) can be appended to this list of equivalent conditions.

Multigraph Conditions for Multistability, Oscillations and Pattern Formation in Biochemical Reaction Networks

We represent interactions among biochemical species using a directed multigraph, which is a generalization of a more commonly used digraph. We show that network properties that are known to lead to multistability or oscillations, such as the existence of a positive feedback cycle, can be generalized to ldquocritical subnetworksrdquo that can contain several cycles. We also derive corresponding graph-theoretic conditions for pattern formation for the respective reaction-diffusion models. We present as an example a model for cell cycle and apoptosis along with bifurcation diagrams and sample solutions that confirm the predictions obtained with the help of the multigraph network conditions.

Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach

This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, strongly rooted, and neighbor-shared are defined, and conditions are derived for compositions of sequences of directed graphs to be of these types. The graph of a stochastic matrix is defined, and it is shown that under certain conditions the graph of a Sarymsakov matrix and a rooted graph are one and the same. As an illustration of the use of the concepts developed in this paper, graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek consensus problem.

A Class of Nonlinear RLC Circuits Globally Stabilizable by Proportional plus Integral Controllers

In this note we identify graph-theoretic conditions which allow to write an RLC circuit as port-Hamiltonian with constant input matrices. We show that under additional monotonicity conditions of the network's components, the circuit enjoys the property of relative passivity, an extended notion of classical passivity. The property of relative passivity is then used to build simple, yet robust and globally stable, Proportional plus Integral controllers.

Parabolic and quasiparabolic subgroups of free partially commutative groups

Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.

A graph-theoretic method for detecting potential Turing bifurcations

The conditions for diffusion-driven (Turing) instabilities in systems with two reactive species are well known. General methods for detecting potential Turing bifurcations in larger reaction schemes are, on the other hand, not well developed. We prove a theorem for a graph-theoretic condition originally given by Volpert and Ivanova [Mathematical Modeling (Nauka, Moscow, 1987) (in Russian), p. 57] for Turing instabilities in a mass-action reaction-diffusion system involving n substances. The method is based on the representation of a reaction mechanism as a bipartite graph with two types of nodes representing chemical species and reactions, respectively. The condition for diffusion-driven instability is related to the existence of a structure in the graph known as a critical fragment. The technique is illustrated using a substrate-inhibited bifunctional enzyme mechanism which involves seven chemical species.