Related papers: The Perron-Frobenius Theorem for Homogeneous, Mono…

We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…

We consider the Perron-Frobenius operator defined on the space of functions of bounded variation for the beta-map $\tau_\beta(x)=\beta x$ (mod $1$), for $\beta\in(1,\infty)$, and investigate its isolated eigenvalues except $1$, called…

We introduce a novel harmonic analysis for functions defined on the vertices of a strongly connected directed graph of which the random walk operator is the cornerstone. As a first step, we consider the set of eigenvectors of the random…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

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…

The aim of this manuscript is to understand the dynamics of products of nonnegative matrices. We extend a well known consequence of the Perron-Frobenius theorem on the periodic points of a nonnegative matrix to products of finitely many…

Tubal scalars are usual vectors, and tubal matrices are matrices with every element being a tubal scalar. Such a matrix is often recognized as a third-order tensor. The product between tubal scalars, tubal vectors, and tubal matrices can be…

This paper considers homogeneous order preserving continuous maps on the normal cone of an ordered normed vector space. It is shown that certain operators of that kind which are not necessarily compact themselves but have a compact power…

The notion \emph{Perron-Frobenius theory} usually refers to the interaction between three properties of operator semigroups: positivity, spectrum and long-time behaviour. These interactions gives rise to a profound theory with plenty of…

We present a new approach of proving certain Carath\'{e}odory-type theorems using the Perron-Frobenius Theorem, a classical result in matrix theory describing the largest eigenvalue of a matrix with positive entries. One of the problems…

Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…

We show that for every "locally finite" unit-preserving completely positive map P acting on a C*-algebra, there is a corresponding *-automorphism \alpha of another unital C*-algebra such that the two sequences P, P^2,P^3,... and \alpha,…

We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…

If $(M,g)$ is a compact real analytic Riemannian manifold, we give a necessary and sufficient condition for there to be a sequence of quasimodes of order $o(\lambda)$ saturating sup-norm estimates. In particular, it gives optimal conditions…

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

First formally defined by Borodin and Olshanski, a coherent system on a graded graph is a sequence of probability measures which respect the action of certain down/up transition functions between graded components. In one common example of…

We show the existence of planar domains with one hole for which the first non-trivial Neumann eigenfunction has a closed nodal line fully contained inside the domain. This is optimal, as it is known since Pleijel's 1956 result that the…

The $k$-core of a graph is its largest subgraph with minimum degree at least $k$, a fundamental concept for uncovering hierarchical structures. In this paper, we establish a connection between the $k$-core and the high-order spectra of…