arXiv research

We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…

This paper deals with chain graphs under the alternative Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. We also show that the extension of Meek's conjecture to AMP chain graphs does n…

Study on identifying AMP chain graph models under known and unknown component decompositions.

GNNs improve supply chain analytics with real-world benchmarks.

Proposes a non-conjugate model selection method for chain event graphs.

This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This impli…

In this paper, we extend Meek's conjecture (Meek 1997) from directed and acyclic graphs to chain graphs, and prove that the extended conjecture is true. Specifically, we prove that if a chain graph H is an independence map of the independence model induced by another chain graph G, then (i) G can be transformed into H …

The paper proves an ascending chain condition for subgroups in hyperbolic and graph 3-manifolds.

Enhanced Markov chain sampler learns network statistics faster.

FS-GCLSTM predicts stock returns by leveraging value-chain relationships.

stCEG models spatial events using Chain Event Graphs in R.

A new metric based on hitting probabilities for directed graphs and Markov chains.

This paper deals with chain graphs under the classic Lauritzen-Wermuth-Frydenberg interpretation. We prove that the regular Gaussian distributions that factorize with respect to a chain graph $G$ with $d$ parameters have positive Lebesgue measure with respect to $\mathbb{R}^d$, whereas those that factorize with respect…

In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion un…

We address some computational issues that may hinder the use of AMP chain graphs in practice. Specifically, we show how a discrete probability distribution that satisfies all the independencies represented by an AMP chain graph factorizes according to it. We show how this factorization makes it possible to perform infe…

The paper proves inequalities for Steklov eigenvalues on finite graphs.

New Markov chains defined on simplicial complexes for understanding their topology.

The study examines convergence of stochastic processes on large graphs and adjacency matrices.

New topological realization of Kontsevich graph complex for large dimensions.

Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one is for likelihood maximization in discrete chain factor graphs, which we define …

Matrix Chernoff bound for Markov chains applied to co-occurrence matrices.

This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meek's conjecture to AMP chain graphs does not hold…

Study on stable commutator length in RAAGs and Coxeter groups, proving spectral gaps and hardness results.

For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations of the Tutte polynomial of graphs. Also, for each graph and integer $n\le 2$, w…

A new algorithm converts staged trees into Chain Event Graphs.

Constructs manifolds from quantum codes with novel geometric properties.

We analyze a functor from cyclic operads to chain complexes first considered by Getzler and Kapranov and also Markl. This functor is a generalization of the graph homology considered by Kontsevich, which was defined for the three operads Comm, Assoc, and Lie. More specifically we show that these chain complexes have a …

Graph matching in noisy environments with Markovian errors.

The aim of this text is to establish some relations between Markov chains in Dirichlet Environments on directed graphs and certain hypergeometric integrals associated with a particular arrangement of hyperplanes. We deduce from these relations and the computation of the connexion obtained by moving one hyperplane of th…

The paper extends game theory using Hodge theory on graphs.

New model captures time series dependence across and within blocks.

CGM combines SSL and LFM for better recommendation performance.

HDT improves MCMC on graphs with history-dependent sampling.

Python package cegpy models processes with asymmetries.

When solving consensus optimization problems over a graph, there is often an explicit characterization of the convergence rate of Gradient Descent (GD) using the spectrum of the graph Laplacian. The same type of problems under the Alternating Direction Method of Multipliers (ADMM) are, however, poorly understood. For i…

A new method for CT-DCEGs simplifies inference for asymmetric processes.

EEGNN improves graph neural networks by enhancing graph structure.

Non-negative curvature affects Markov chains' mixing and expansion properties.

We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in …

The class of chain event graph models is a generalisation of the class of discrete Bayesian networks, retaining most of the structural advantages of the Bayesian network for model interrogation, propagation and learning, while more naturally encoding asymmetric state spaces and the order in which events happen. In this…

GAttNHP predicts future events in temporal knowledge graphs by encoding long-range dependencies and handling mutual excitation.

Paper proposes methods to improve graph domain adaptation by decorrelating node features.

Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Markov equivalent class. It is of great interest to describe and understand the space of such classes. However, with curren…

In 2003, Ozsváth and Szabó defined the concordance invariant $τ$ for knots in oriented 3-manifolds as part of the Heegaard Floer homology package. In 2011, Sarkar gave a combinatorial definition of $τ$ for knots in $S^3$ and a combinatorial proof that $τ$ gives a lower bound for the slice genus of a knot. Recently, Har…

Directed acyclic graphs are the basic representation of the structure underlying Bayesian networks, which represent multivariate probability distributions. In many practical applications, such as the reverse engineering of gene regulatory networks, not only the estimation of model parameters but the reconstruction of t…

TTERGM models improve social network predictions by incorporating triadic relationships.

Knowing when a graphical model is perfect to a distribution is essential in order to relate separation in the graph to conditional independence in the distribution, and this is particularly important when performing inference from data. When the model is perfect, there is a one-to-one correspondence between conditional…

In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with graded Euler characteristic equal to the Jones polynomial of the link. Hence, it can…