Dynamical systems associated with adjacency matrices
arXiv:1702.05253 · doi:10.3934/dcdsb.2018190
Abstract
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss in detail qualitative properties of solutions to these problems by quadratic form methods. We distinguish between backward and forward evolution equations: the latter have typical features of diffusive processes, but cannot be well-posed on graphs with unbounded degree. On the contrary, well-posedness of backward equations is a typical feature of line graphs. We suggest how to detect even cycles and/or couples of odd cycles on graphs by studying backward equations for the adjacency matrix on their line graph.
arXiv comment27 pages; to appear in Disc. Cont. Dyn. Syst. B
References in corpus (6)
- Harmonic Analysis associated with a discrete Laplacian
- Path Laplacian operators and superdiffusive processes on graphs. I. One-dimensional case
- Parabolic theory of the discrete p-Laplace operator
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
- New relations between discrete and continuous transition operators on (metric) graphs
- The L2 strong maximum principle on arbitrary countable networks