Related papers: Vertex maps on graphs -- Perron-Frobenius Theory
We give an overview of the theory of Cannon-Thurston maps which forms one of the links between the complex analytic and hyperbolic geometric study of Kleinian groups. We also briefly sketch connections to hyperbolic subgroups of hyperbolic…
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive…
We investigate various classes of metrics on the integers, which induce the F\"urstenberg topology and establish the connection between the metrics and the topology. We analyze the norm-like mappings underlying these metrics, with respect…
The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positively and negatively pseudo-inverse matrices and graphs. We…
Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…
The study of networks has witnessed an explosive growth over the past decades with several ground-breaking methods introduced. A particularly interesting -- and prevalent in several fields of study -- problem is that of inferring a function…
The Perron-Frobenius theory for nonnegative matrices has been generalized to order-preserving homogeneous mappings on a cone and more recently to nonnegative multilinear forms. We unify both approaches by introducing the concept of…
This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…
We complete the picture how the asymptotic behavior of a dynamical system is reflected by properties of the associated Perron-Frobenius operator. Our main result states that strong convergence of the powers of the Perron-Frobenius operator…
Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
A graph-theoretic method is introduced for analyzing fermion mass spectra in latticized theory-space models, including chain models arising from dimensional deconstruction. Fermion mass terms are mapped to bipartite graphs, with fields as…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed…
An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the…
We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…