Using an information theoretic point of view, we investigate how a dynamics acting on a network can be coarse grained through the use of graph partitions. Specifically, we are interested in how aggregating the state space of a Markov process according to a partition impacts on the thus obtained lower-dimensional dynamics. We highlight that for a dynamics on a particular graph there may be multi...

Adapting a method developed for the study of quantum chaos on quantum (metric) graphs [1], spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of ζ functions proposed originally by Ihara [2], and expanded...

A fundamental question regarding neural systems and other applications involving networks is the extent to which the network architecture may contribute to the observed dynamics. We explore this question by investigating two different processes on three different graph structures, asking to what extent the graph structure (as represented by the degree distribution) is reflected in the dynamics ...

We describe the theoretical and computational framework for the Dynamic Signatures Generated by Regulatory Networks (DSGRN) database. The motivation stems from an urgent need to understand the global dynamics of biologically relevant signal transduction/gene regulatory networks that have at least 5 to 10 nodes, involve multiple interactions, and have decades of parameters. The input to the data...

a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...

0

in this paper we study the coprime graph of a group $g$. the coprime graph of a group $g$, is a graph whose vertices are elements of $g$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$. in this paper we classify all the groups which the coprime graph is a complete r-partite graph or a planar graph. also we study the automorphism group of the coprime graph.

This paper considers transfer functions in consensus systems where agents have identical SISO dynamics of arbitrary order. The interconnecting structure is a directed graph. The transfer functions for various inputs and outputs are presented in simple product forms with a similar structure of the numerator and the denominator. This structure combines the network properties and the agent model i...

Network information system specification in virtual professional communities requires a legitimate user-driven approach. In such an approach, only specification changes are produced that are not only meaningful but also acceptable to all users. To do so, for each requested change, a relevant user group needs to be selected to work out the required knowledge definition changes. This paper descri...

In this article, we study finite dynamical systems defined over graphs, where the functions are applied asynchronously. Our goal is to quantify and understand stability of the dynamics with respect to the update sequence, and to relate this to structural properties of the graph. We introduce and analyze three different notions of update sequence stability, each capturing different aspects of th...