Related papers: Directed diagrammatic reducibility
This paper explores the extension of dimension reduction (DR) techniques to the multi-dimension case by using the Einstein product. Our focus lies on graph-based methods, encompassing both linear and nonlinear approaches, within both…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
In a paper from 2012 Jab{\l}o\'nski, Jung and Stochel introduced the weighted shifts on directed trees, a generalisation of well known weighted shift operators on $\ell^2$. In the last decade this class has proven itself handy for finding…
We consider a model of directed polymers on regular trees with complex-valued random weights introduced by Cook and Derrida [CD90] and studied mathematically by Derrida, Evans and Speer [DES93]. In addition to the usual weak-disorder and…
In this paper, we defined three kinds of measures depending on the given finite directed graphs. For the given finite directed graph, we can construct the free semigroupoid, the diagram set and the reduced diagram set, as algebraic…
In weighted graphs the shortest path between two nodes is often reached through an indirect path, out of all possible connections, leading to structural redundancies which play key roles in the dynamics and evolution of complex networks. We…
Dimensionality reduction techniques play important roles in the analysis of big data. Traditional dimensionality reduction approaches, such as principal component analysis (PCA) and linear discriminant analysis (LDA), have been studied…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
We examine the reducibility of induced from discrete series representations of $SU_n$ over a $p$--adic field of characteristic zero. Some results are given for groups sharing derived group. We give a relationship between the $R$-groups for…
We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch…
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now…
We introduce the arrow product, a systematic generating function technique for directed graph enumeration. It provides short proofs for previous results of Gessel on the number of directed acyclic graphs and of Liskovets, Robinson and…
This paper addresses questions regarding controllability for `generic parameter' dynamical systems, i.e. the question whether a dynamical system is `structurally controllable'. Unlike conventional methods that deal with structural…
We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input structure to the output structure. We consider…
We introduce the notion of a directed stratification for a finite-dimensional algebra. For algebras that admit such a stratification we characterise the projective resolutions of finitely generated modules and obtain a result for the…
We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to…
Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on "Min-Cut"-style criteria, compress both the vertices and edges of the…
In this work we define a novel edit distance for trees considered with some abstract weights on the edges. The metric is driven by the idea of considering trees as topological summaries in the context of persistence and topological data…
Given a connection on a meromorphic vector bundle over a compact Riemann surface with reductive Galois group, we associate to it a projective variety. Connections such that their associated projective variety are curves can be classified,…
Given a finitely generated group $\Gamma$, a directed graph $\Lambda$, and a map $R:\Lambda\to\Gamma$, we introduce the notion of an $(R,\Lambda)$-directed Anosov representation. This is a weakening of the notion of Anosov representations.…