Related papers: Directed diagrammatic reducibility
Front-door adjustment gives a simple closed-form identification formula under the classical front-door criterion, but its applicability is often viewed as narrow. By contrast, the general ID algorithm can identify many more causal effects…
The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…
Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking whether this relationship lifts to directed graphs -- we…
We consider tracking control for multi-input multi-output differential-algebraic systems. First, the concept of vector relative degree is generalized for linear systems and we arrive at the novel concept of "truncated vector relative…
Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Existing approaches model this property by greedily learning local dependencies. However,…
Statistical pattern classification methods based on data-random graphs were introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the data points from various classes.…
If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…
In this paper, we present fixed-parameter tractability algorithms for both the undirected and directed versions of the Spanning Tree Isomorphism Problem, parameterized by the size $k$ of a redundant set. A redundant set is a collection of…
Data-driven control offers a powerful alternative to traditional model-based methods, particularly when accurate system models are unavailable or prohibitively complex. While existing data-driven control methods primarily aim to construct…
In this paper, we study a generic direct-search algorithm in which the polling directions are defined using random subspaces. Complexity guarantees for such an approach are derived thanks to probabilistic properties related to both the…
We study a family of Bowen-Series-like maps associated to any finitely generated Fuchsian group of the first kind with at least one cusp. These maps act on the boundary of the hyperbolic plane in a piecewise manner by generators of the…
We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure. Qualitative invariants on such directed spaces often are more informative yet more difficult to calculate than…
We investigate a slight weakening of the classical property of strong approximation, which we call almost strong approximation, for connected reductive algebraic groups over global fields with respect to special sets of valuations. While…
We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…
This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…
We study the structure of adic curves over an affinoid field of arbitrary rank. In particular, quite analogously to Berkovich geometry we classify points on curves, prove a semistable reduction theorem in the version of Ducros'…