Related papers: Vertex maps on graphs -- Perron-Frobenius Theory

We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2…

In a generic dynamical system chaos and regular motion coexist side by side, in different parts of the phase space. The border between these, where trajectories are neither unstable nor stable but of marginal stability, manifests itself…

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of a graph also known as the communicability. The walk…

A period is a complex number arising as the integral of a rational function with algebraic number coefficients over a rationally-defined region. Although periods are typically transcendental numbers, there is a conjectural Galois theory of…

We prove that if a certain entry in the map of the Hadamard-Perron theorem is $T$-periodic in one of the variables, then the stable manifold guaranteed by the Hadamard-Perron theorem is a graph of a $T$-periodic function. As an application,…

In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

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…

In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…

We establish a deterministic technique to investigate transport moments of arbitrary order. The theory is applied to the analysis of different kinds of intermittent one-dimensional maps and the Lorentz gas with infinite horizon: the typical…

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learning algorithms are described for vertex covers, independent…

We explore the concept of metastability in random dynamical systems, focussing on connections between random Perron-Frobenius operator cocycles and escape rates of random maps, and on topological entropy of random shifts of finite type. The…

We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to…

A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…