Related papers: Markov-Dyck shifts, neutral periodic points and to…
Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
The Dynkin isomorphism associates a Gaussian field to a Markov chain. These Gaussian fields can be used as priors for prediction and time series analysis. Dynkin's construction gives Gaussian fields with all non-negative covariances. We…
We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the…
We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…
We study topological properties of the graph topology.
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
We consider the stationary sine-Gordon equation on metric graphs with simple topologies. The vertex boundary conditions are provided by flux conservation and matching of derivatives at the star graph vertex. Exact analytical solutions are…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
Recently a new class of critical points, termed as {\sl perpetual points}, where acceleration becomes zero but the velocity remains non-zero, is observed in nonlinear dynamical systems. In this work we show whether a transformation also…
Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as…
Complex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a…
In this paper we study the structure of $k$-transitive closures of directed paths and formulate several properties. Concept of $k$-transitive orientation generalize the traditional concept of transitive orientation of a graph.
We show that the (Gurevich) topological entropy for the countable Markov shift associated with an infinite transition matrix $A$ coincides with the non-commutative topological entropy for the Exel--Laca algebra associated with $A$, under…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…