Related papers: Markov-Dyck shifts, neutral periodic points and to…

We consider Markov jump processes on a graph described by a rate matrix that depends on various control parameters. We derive explicit expressions for the static responses of edge currents and steady-state probabilities. We show that they…

We derive an explicit link between Gaussian Markov random fields on metric graphs and graphical models, and in particular show that a Markov random field restricted to the vertices of the graph is, under mild regularity conditions, a…

We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…

Time-varying graph signals are alternative representation of multivariate (or multichannel) signals in which a single time-series is associated with each of the nodes or vertex of a graph. Aided by the graph-theoretic tools, time-varying…

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…

We develop a homotopy theory of directed graphs based on cubical homotopy groups, also referred to as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups…

In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

We exhibit a bijection between acyclic orientations of a Dyck graph and Tymoczko cells of a regular nilpotent Hessenberg variety. This implies the Shareshian-Wachs formula for the sum of the coefficients of the chromatic quasi-symmetric…

Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…

The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…

We study the twisted Novikov homology of the complement of a complex hypersurface in general position at infinity. We give a self-contained topological proof of the vanishing (except possibly in the middle degree) of the twisted Novikov…

In this paper we provide an abstract characterization of the inverse hulls of semigroups associated with Markov shifts. As an application of the characterization we give an example of Markov shifts that are not conjugate, but have…

In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…

The paper proves two theorems concerning the set of periods of periodic orbits for maps of graphs that are homotopic to the constant map and such that the vertices form a periodic orbit. The first result is that if $v$ is not a divisor of…

The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…

Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We study relations between transitivity, mixing and periodic points on dendrites. We prove that when there is a point with dense orbit which is not an endpoint, then periodic points are dense and there is a terminal periodic decomposition…