Related papers: Acyclicity conditions on pasting diagrams
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
In this work we consider families of smooth vector fields having a persistent polycycle with $n$ hyperbolic saddles. We derive the asymptotic expansion of the return map associated to the polycycle, determining explicitly its leading terms.…
We generalize the persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer to the setting of constructible persistence modules valued in a symmetric monoidal category. We call this the type A persistence diagram of a persistence…
We explore the effect of an attractive interaction between parallel-aligned polymers, which are perpendicularly grafted on a substrate. Such an attractive interaction could be due to, e.g., reversible cross-links. The competition between…
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} that corresponds to a graph that…
It is well known that stochastically modeled reaction networks that are complex balanced admit a stationary distribution that is a product of Poisson distributions. In this paper, we consider the following related question: supposing that…
The behaviour of elastic structures undergoing large deformations is the result of the competition between confining conditions, self-avoidance and elasticity. This combination of multiple phenomena creates a geometrical frustration that…
The space of unit flows on a directed acyclic graph (DAG) with one source and one sink is known to admit regular unimodular triangulations induced by framings of the DAG. The dual graph of any of these triangulations may be given the…
We propose a methodology for the homogenization of periodic elastic lattices that covers the case of unstable lattices, having affine (macroscopic) or periodic (microscopic) mechanisms. The singular cell problems that are encountered when a…
Estimating the structure of directed acyclic graphs (DAGs) from observational data remains a significant challenge in machine learning. Most research in this area concentrates on learning a single DAG for the entire population. This paper…
An upward planar order on an acyclic directed graph $G$ is a special linear extension of the edge poset of $G$ that satisfies the nesting condition. This order was introduced to combinatorially characterize upward plane graphs and…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
We present Monte Carlo simulations of a three-state lattice gas, half-filled with two types of particles which attract one another, irrespective of their identities. A bias drives the two particle species in opposite directions,…
The asymptotic behaviour of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of…
We use a random pinning procedure to investigate stable glassy states associated with large deviations of the activity in a model glass-former. We pin particles both from active (equilibrium) configurations and from stable (inactive) glassy…
In this article, we propose a new hypothesis testing method for directed acyclic graph (DAG). While there is a rich class of DAG estimation methods, there is a relative paucity of DAG inference solutions. Moreover, the existing methods…
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…
We consider one-dimensional asymmetric exclusion processes with a simple attractive interaction, where the distance between consecutive particles is not allowed to exceed a certain limit and investigate the consequences of this coupling on…
This paper deals with dynamic networks in which the causality relations between the vertex signals are represented by linear time-invariant transfer functions (modules). Considering an acyclic network where only a subset of its vertices are…
The ground state properties of spin-1/2 ladders are studied, emphasizing the role of frustration and ring exchange coupling. We present a unified field theory for ladders with general coupling constants and geometry. Rich phase diagrams can…