Related papers: On Metzler positive systems on hypergraphs
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…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…
Finding densely connected subsets of vertices in an unsupervised setting, called clustering or community detection, is one of the fundamental problems in network science. The edge clustering approach instead detects communities by…
Consider a graph $G$ where each vertex is visibly labelled as a member of a distinct class, but also has a hidden binary state: wild or tame. Edges with end points in the same class are called agreement edges. Premise: an edge connecting…
We consider the population dynamics of a set of species whose network of catalytic interactions is described by a directed graph. The relationship between the attractors of this dynamics and the underlying graph theoretic structures like…
Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks. Here we propose a framework based on statistical inference to…
We consider the problem of recovering a subhypergraph based on an observed adjacency tensor corresponding to a uniform hypergraph. The uniform hypergraph is assumed to contain a subset of vertices called as subhypergraph. The edges…
We study a graph-theoretic approach to the $\mathcal{H}_{\infty}$ performance of leader following consensus dynamics on directed and undirected graphs. We first provide graph-theoretic bounds on the system $\mathcal{H}_{\infty}$ norm of the…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
This paper develops a dynamical-systems framework for modeling influence propagation in product adoption networks, formulated as a positive linear system with Metzler interaction matrices and utility-based decay. Exact solutions are derived…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
The richness of many complex systems stems from the interactions among their components. The higher-order nature of these interactions, involving many units at once, and their temporal dynamics constitute crucial properties that shape the…
In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence…
We study a family of networks of autocatalytic reactions, which we call hyperchains, that are a generalization of hypercycles. Hyperchains, and the associated dynamical system called replicator equations, are a possible mechanism for…
Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined…
Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…
Dynamic graph datasets often exhibit strong temporal patterns, such as recency, which prioritizes recent interactions, and popularity, which favors frequently occurring nodes. We demonstrate that simple heuristics leveraging only these…
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…