相关论文: A Gessel-Viennot-type method for cycle systems in …
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 determine the cycle packing number of a directed graph using elementary projective algebraic geometry. Our idea is rooted in the Khovanov-Rozansky theory. In fact, using the Khovanov-Rozansky homology of a graph, we also obtain algebraic…
This article is dedicated to domino tilings of certain types of graph grids. For each of these grids, the domino tilings are represented using linear-recurrent sequences. New dependencies are proved that are not included in Neil Sloane's…
Di Francesco introduced Aztec triangles as combinatorial objects for which their domino tilings are equinumerous with certain sets of configurations of the twenty-vertex model that are the main focus of his article. We generalize Di…
This article is about measuring and visualizing distances between domino tilings. Given two tilings of a simply connected square tiled surface, we're interested in the minimum number of flips between two tilings. Given a certain shape,…
Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…
In this paper, we tackle structure learning of Directed Acyclic Graphs (DAGs), with the idea of exploiting available prior knowledge of the domain at hand to guide the search of the best structure. In particular, we assume to know the…
Determinantal processes on half-integer line can be studied using vertex algebras. They were used by Okounkov, where Schur processes were introduced and proved to be determinantal. We want to extend this vertex algebra approach. First, we…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
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…
On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in…
We introduce a class of linear compartmental models called identifiable path/cycle models which have the property that all of the monomial functions of parameters associated to the directed cycles and paths from input compartments to output…
Given a graph whose edges are labeled by ideals of a commutative ring R with identity, a generalized spline is a vertex labeling by the elements of R such that the difference of the labels on adjacent vertices lies in the ideal associated…
Dominators provide a general mechanism for identifying reconverging paths in graphs. This is useful for a number of applications in Computer-Aided Design (CAD) including signal probability computation in biased random simulation, switching…
Finding the structure of a graphical model has been received much attention in many fields. Recently, it is reported that the non-Gaussianity of data enables us to identify the structure of a directed acyclic graph without any prior…
Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial…
We study domino tilings of certain regions $R_\lambda$, indexed by partitions $\lambda$, weighted according to generalized area and dinv statistics. These statistics arise from the $q,t$-Catalan combinatorics and Macdonald polynomials. We…
We propose a new method for determining the elementary paths and elementary circuits in a directed graph. Also, the Hamiltonian paths and Hamiltonian circuits are enumerated.
In this paper, we derive several formulas of counting families of non-intersecting paths for two-sided ladder-shaped regions. As an application, we give a new proof to a combinatorial interpretation of Fibonacci numbers obtained by G.…