Related papers: Acyclicity conditions on pasting diagrams
Conditional independence models associated with directed acyclic graphs (DAGs) may be characterized in at least three different ways: via a factorization, the global Markov property (given by the d-separation criterion), and the local…
Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large…
Model chains are studied via Monte Carlo simulations which are deposited with a fixed flux on a substrate. They may represent, e.g., stiff lipophilic chains with an head group and tail groups mimicking the alkyl chain. After some subsequent…
Two-dimensional colloidal suspensions exposed to periodic external fields exhibit a variety of molecular crystalline phases. There two or more colloids assemble at lattice sites of potential minima to build new structural entities, referred…
We identify two recursively defined polynomial conditions for FI-modules in the literature. We characterize these conditions using homological invariants of FI-modules (namely the local degree and regularity, together with the stable…
We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However,…
When designing new molecules with particular properties, it is not only important what to make but crucially how to make it. These instructions form a synthesis directed acyclic graph (DAG), describing how a large vocabulary of simple…
The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs…
We show that any pasting diagram in any $(\infty,2)$-category has a homotopically unique composite. This is achieved by showing that the free 2-category generated by a pasting scheme is the homotopy colimit of its cells as an…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We study the motion of elastic networks driven over a random substrate. Our model which includes local friction forces leads to complex dynamical behavior. We find a transition to a sliding state which belongs to a new universality class.…
For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise naturally in the study of structural graph theory and…
Our earlier work titled: "Win-move is Coordination-Free (Sometimes)" has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a strict hierarchy depending on the assumptions of the model…
Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…
In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables. Indeed,…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
By generalizing the algebra of operators of the Asymmetric Simple Exclusion Process (ASEP), a multi-species ASEP in which particles can overtake each other,is defined on both open and closed one dimensional chains. On the ring the steady…