Related papers: The Perron-Frobenius Theorem for Homogeneous, Mono…
The paper introduces and studies differentially positive systems, that is, systems whose linearization along an arbitrary trajectory is positive. A generalization of Perron Frobenius theory is developed in this differential framework to…
For a nonnegative symmetric weakly irreducible tensor, its spectral radius is an eigenvalue corresponding to a unique positive eigenvector up to a scalar called the Perron vector. But including the Perron vector, there may have more than…
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…
Basic properties in Perron-Frobenius theory are strict positivity, primitivityand irreducibility. Whereas for nonnegative matrices, these properties are equivalent to elementary graph properties which can be checked in polynomial time, we…
In this paper, we describe the relationship between the Perron root and eigenvectors of an irreducible subshift of finite type with the correlation between the forbidden words in the subshift. In particular, we derive an expression for the…
Motivated by a work of Boros, Brualdi, Crama and Hoffman, we consider the sets of (i) possible Perron roots of nonnegative matrices with prescribed row sums and associated graph, and (ii) possible eigenvalues of complex matrices with…
We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…
The eigenvectors of an ergodic semigroup of linear normal positive unital maps on a von Neumann algebra are described. Moreover, it is shown by means of examples, that mere positivity of the maps in question is not sufficient for Frobenius…
The spectral properties of the Frobenius-Perron operator of one-dimensional maps are studied when approaching a weakly intermittent situation. Numerical investigation of a particular family of maps shows that the spectrum becomes extremely…
Given a connected graph, the principal eigenvector of the adjacency matrix (often called the Perron vector) can be used to assign positive weights to the vertices. A natural way to measure the homogeneousness of this vector is by…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…
We prove a general version of the classical Perron-Frobenius convergence property for reducible matrices. We then apply this result to reducible substitutions and use it to produce limit frequencies for factors and hence invariant measures…
We use fixed point theory to analyze nonnegative neural networks, which we define as neural networks that map nonnegative vectors to nonnegative vectors. We first show that nonnegative neural networks with nonnegative weights and biases can…
This article provides sufficient conditions for positive maps on the Schatten classes $\mathcal J_{p}, 1\le p<\infty$ of bounded operators on a separable Hilbert space such that a corresponding Perron-Frobenius theorem holds. With…
In this note, we establish an original result for the thermodynamic formalism in the context of expanding circle transformations with an indifferent fixed point. For an observable whose continuity modulus is linked to the dynamics near such…
Hypergraphs have been a powerful tool to represent higher-order interactions, where hyperedges can connect an arbitrary number of nodes. Quantifying the relative importance of nodes and hyperedges in hypergraphs is a fundamental problem in…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
Network scientists have shown that there is great value in studying pairwise interactions between components in a system. From a linear algebra point of view, this involves defining and evaluating functions of the associated adjacency…
Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…