Related papers: Dynamical systems on graphs through the signless L…
This paper deals with identifiability of undirected dynamical networks with single-integrator node dynamics. We assume that the graph structure of such networks is known, and aim to find graph-theoretic conditions under which the state…
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific…
Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as…
Diagonalizability plays an important role in the analysis and design of multivariable systems. A structured matrix is called structurally diagonalizable if almost all of its numerical realizations, obtained by assigning real values to its…
We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…
Most methods proposed to uncover communities in complex networks rely on their structural properties. Here we introduce the stability of a network partition, a measure of its quality defined in terms of the statistical properties of a…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions…
For networks of coupled dynamical systems we characterize admissible functions, that is, functions whose gradient is an admissible vector field. The schematic representation of a gradient network dynamical system is of an undirected cell…
A sign is introduced in the usual Laplacian on graphs and the corresponding analogue of the isoperimetric constant for this Laplacian is presented, i.e. a geometric quantity which enables to bound from above and below the first eigenvalue.…
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…
We consider a sequence of matrices that are associated to Markov dynamical systems and use determinant-free linear algebra techniques (as well as some algebra and complex analysis) to rigorously estimate the eigenvalues of every matrix…
Let $G$ be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by $\pm 1$? In this paper, we answer this question for the adjacency, Laplacian and signless Laplacian matrix of a…
In this paper we study the dynamics of a general non-autonomous dynamical system generated by a family of continuous self maps on a compact space $X$. We derive necessary and sufficient conditions for the system to exhibit complex dynamical…
In this paper, we investigate the controllability of a linear time-invariant network following a Laplacian dynamics defined on a threshold graph. In this direction, an algorithm for deriving the modal matrix associated with the Laplacian…
We express the tau constant of a metrized graph in terms of the discrete Laplacian matrix and its pseudo inverse.
Dynamically changing graphs are used in many applications of graph algorithms. The scope of these graphs are in graphics, communication networks and in VLSI designs where graphs are subjected to change, such as addition and deletion of…
Let $G$ be an unicyclic graph of order $n$ and let $Q_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i \varphi_i x^{n-i}{matrix}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations…
We study the uniform ergodicity property for non-invertible topological and measure-preserving dynamical systems. It is shown that for topological dynamical systems uniform ergodicity is equivalent to eventually periodicity and that for…
Living systems exhibit complex yet organized behavior on multiple spatiotemporal scales. To investigate the nature of multiscale coordination in living systems, one needs a meaningful and systematic way to quantify the complex dynamics, a…