相关论文: A Gessel-Viennot-type method for cycle systems in …

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…

Directed graphs naturally model systems with asymmetric, ordered relationships, essential to applications in biology, transportation, social networks, and visual understanding. Generating such graphs enables tasks such as simulation, data…

This article proposes a novel causal discovery and inference method called GrIVET for a Gaussian directed acyclic graph with unmeasured confounders. GrIVET consists of an order-based causal discovery method and a likelihood-based…

We study the relative Hilbert scheme of a family of nodal (or smooth) curves via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the discriminant locus, which consists of…

We give an introduction into diffraction theory for aperiodic order. We focus on an approach via dynamical systems and the phenomenon of pure point diffraction. We review recent results and sketch proofs. We then present a new uniform…

This paper presents an alternative approach for the computation of trajectory segments on slow manifolds of saddle type. This approach is based on iterative methods rather than collocation-type methods. Compared to collocation methods, that…

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Several classes of directed acyclic graphs have been investigated in the last two decades, in the context of the Causal Set Program, in search for good discrete models of spacetime. We introduce some statistical indicators that can be used…

This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…

In this work, we present a probabilistic model for directed graphs where nodes have attributes and labels. This model serves as a generative classifier capable of predicting the labels of unseen nodes using either maximum likelihood or…

It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…

We propose a novel score-based approach to learning a directed acyclic graph (DAG) from observational data. We adapt a recently proposed continuous constrained optimization formulation to allow for nonlinear relationships between variables…

Domino tilings of the two-periodic Aztec diamond feature all of the three possible types of phases of random tiling models. These phases are determined by the decay of correlations between dominoes and are generally known as solid, liquid…

We review the connections between the octahedral recurrence, $\lambda$-determinants and tiling problems. This provides in particular a direct combinatorial interpretation of the $\lambda$-determinant (and generalizations thereof) of an…

For a planar bipartite graph $\mathcal G$ equipped with a $\mathrm{SL}_n$-local system, we show that the determinant of the associated Kasteleyn matrix counts "$n$-multiwebs" (generalizations of $n$-webs) in $\mathcal G$, weighted by their…

We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…

We describe a computational method for constructing a coarse combinatorial model of some dynamical system in which the macroscopic states are given by elementary cycling motions of the system. Our method is in particular applicable to time…

We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such…

We present a deterministic distributed algorithm in the LOCAL model that finds a proper $(\Delta + 1)$-edge-coloring of an $n$-vertex graph of maximum degree $\Delta$ in $\mathrm{poly}(\Delta, \log n)$ rounds. This is the first nontrivial…