Related papers: Hypercyclic shifts on lattice graphs
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
We prove that the acyclic reorientation poset of a directed acyclic graph $D$ is a lattice if and only if the transitive reduction of any induced subgraph of $D$ is a forest. We then show that the acyclic reorientation lattice is always…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
The relations, rather than the elements, constitute the structure of networks. We therefore develop a systematic approach to the analysis of networks, modelled as graphs or hypergraphs, that is based on structural properties of…
For the Odd Cycle Transversal problem, the task is to find a small set $S$ of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal problem requires S to intersect only those odd cycles that include…
We solve several problems on frequently hypercyclic operators. Firstly, we characterize frequently hypercyclic weighted shifts on $\ell^p(\mathbb Z)$, $p\geq 1$. Our method uses properties of the difference set of a set with positive upper…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
We expand the structural theory of \ca graphs that avoid specific cyclic coset patterns. We present several characterisations of tree-likeness for these structures and show a close connection to $\alpha$-acyclic hypergraphs. A focus lies on…
We describe how the usual supercharges of extended supersymmetry may be {\it twisted} to produce a BRST-like supercharge $Q$. The usual supersymmetry algebra is then replaced by a twisted algebra and the action of the twisted theory is…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
I review recent progress in understanding non-perturbative aspects of string theory, quantum gravity and non-commutative geometry using lattice methods.
A formally normal weighted shift on a directed tree is shown to be a bounded normal operator. The question of whether a normal extension of a subnormal weighted shift on a directed tree can be modeled as a weighted shift on some, possible…