Related papers: Hypercyclic shifts on lattice graphs

Let $B$ be an unilateral weighted backward shift on $\ell_p$, $1 \leq p < \infty$, that admits a $\mathscr{U}$-frequently hypercyclic subspace. We prove that $B$ admits such a subspace free of frequently hypercyclic vectors. The proof…

We study the existence of algebras of hypercyclic vectors for weighted backward shifts on Fr\'echet sequence spaces that are algebras when endowed with coordinatewise multiplication or with the Cauchy product. As a particular case we obtain…

If a quantum walk starting on a vertex tends to stay at home, then that vertex is said to be sedentary. We prove that almost all planar graphs and almost all trees contain at least two sedentary vertices for any assignment of edge weights…

We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally…

Many applications in network science have recently been discovered for the "curvature" of a network, but there is no consensus on the definition for this term. A common approach in these applications is to derive from the curvature either a…

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

We develop a general theory of random walks on hypergraphs which includes, as special cases, the different models that are found in literature. In particular, we introduce and analyze general random walk Laplacians for hypergraphs, and we…

Astrophysical transient phenomena are traditionally classified spectroscopically in a hierarchical taxonomy; however, this graph structure is currently not utilized in neural net-based photometric classifiers for time-domain astrophysics.…

For a given finite directed graph $G$, there are two types of Markov-Dyck shifts, the Markov-Dyck shift $D_G^V$ of vertex type and the Markov-Dyck shift $D_G^E$ of edge type. It is shown that, if $G$ does not have multi-edges, the former is…

For a weighted outerplanar graph, the set of lex short cycles is known to be a minimum cycle basis [Inf. Process. Lett. 110 (2010) 970-974 ]. In this work, we show that the set of lex short cycles is a minimum cycle basis in weighted…

We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergraphs.

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…

Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice…

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…

It is well known that subspaces of the Hardy space over the unit disk which are invariant under the backward shift occur as the image of an observability operator associated with a discrete-time linear system with stable state-dynamics, as…

In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…

A directed acyclic graph G = (V, E) is pseudo-transitive with respect to a given subset of edges E1, if for any edge ab in E1 and any edge bc in E, we have ac in E. We give algorithms for computing longest chains and demonstrate geometric…

We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…

We show that a weighted shift on a directed tree is related to a multiplier algebra of coefficients of analytic functions. We use this relation to study spectral properties of the operators in question.

In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…