Related papers: Path homology of circulant digraphs
We develop a generalisation of the path homology theory introduced by Grigor'yan, Lin, Muranov and Yau (GLMY-theory) in a general simplicial setting. The new theory includes as particular cases the GLMY-theory for path complexes and new…
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
Path homology plays a central role in digraph topology and GLMY theory more general. Unfortunately, the computation of the path homology of a digraph $G$ is a two-step process, and until now no complete description of even the underlying…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a…
An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…
We define the notions of Reidemeister torsion and analytic torsion for directed graphs by means of the path homology theory introduced by the authors in \cite{Grigoryan-Lin-Muranov-Yau2013, Grigoryan-Lin-Muranov-Yau2014,…
We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
For a digraph $G$ without multisquares and a field $\mathbb{F}$, we construct a basis of the vector space of path $n$-chains $\Omega_n(G;\mathbb{F})$ for $n\geq 0$, generalising the basis of $\Omega_3(G;\mathbb{F})$ constructed by…
We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is based on the analysis of the underlying switched system via inequalities imposed among multiple Lyapunov…
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
This paper investigates the chaotic properties of Arnol'd cat maps (ACMs) coupled on the nodes of a circulant graph. By demanding that the system's evolution matrix be symplectic, we determine the coupling matrix, which is naturally…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
The closed neighborhood complex $\mathcal{N}[G]$ of a simple graph $G$ is the simplicial complex whose simplices are finite sets of vertices contained in a closed neighborhood of a vertex in $G$. We reveal that the closed neighborhood…
A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…
We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…