Related papers: An approach to non-equilibrium Markov chains throu…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
We compute the spectrum for a class of quantum Markov semigroups describing systems of $N$ particle interacting through a binary collision mechanism. These quantum Markov semgroups are associated to a novel kind of quantum random walk on…
In this work we derive the general conditions for obtaining nonreciprocity in multi-mode parametrically-coupled systems. The results can be applied to a broad variety of optical, microwave, and hybrid systems including recent electro- and…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
This paper investigates the determination of feasible input-output pairings for the decentralized integral controllability of non-square systems. The relevance of this problem extends beyond traditional industrial processes into modern AI…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…
Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…
We investigate the use of a certain class of functional inequalities known as weak Poincar\'e inequalities to bound convergence of Markov chains to equilibrium. We show that this enables the straightforward and transparent derivation of…
A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963 where they measured the degree of asymmetry of an asymmetric graph. They proved that any…
A set $S$ of vertices in a graph $G = (V, E)$ is called {\em cycle independent} if the induced subgraph $\langle S\rangle$ is acyclic, and called {\em odd-cycle indepdendet} if $\langle S\rangle$ is bipartite. A set $S$ is {\em cycle…
We introduce the concept of a Markov influence system (MIS) and analyze its dynamics. An MIS models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution. This…
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
The statistics of gaps between quantum energy levels is a hallmark criterion in quantum chaos and quantum integrability studies. The relevant distributions corresponding to exactly integrable vs. fully chaotic systems are universal and…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Scaled relative graphs have been originally introduced in the context of convex optimization and have recently gained attention in the control systems community for the graphical analysis of nonlinear systems. Of particular interest in…
The application of the Gershgorin circle theorem and some of its derivatives to estimate the eigenvalues of a matrix is considered. The obtained results are developed to obtain the localization region of the eigenvalues of a matrix with…
The aim of this paper is studying from an alternative point of view the integrability of the spin chain with long-range elliptic interactions introduced by Inozemtsev. Our analysis relies on some well-established conjectures characterizing…
Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class…