arXiv research

ODVICE augments EHR cohorts using ontology to improve analysis robustness.

Sharp bounds for spanning tree entropy in planar lattices.

Proves bounds on spanning two-forests and random cut sizes.

Alexander polynomial equals spanning tree count at t=1.

For a spanning tree T of a connected graph G and for a labelling φ: E(T) \rightarrow {+, -}, φis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e \in E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph ha…

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$, there is an associated ribbon graph whose quasi-trees correspond bijectively to …

We consider the detection of activations over graphs under Gaussian noise, where signals are piece-wise constant over the graph. Despite the wide applicability of such a detection algorithm, there has been little success in the development of computationally feasible methods with proveable theoretical guarantees for ge…

We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be intractable without any restriction on the considered graphs, so we limit our explora…

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called srs network with quotient the complete graph on four vertices $K_4$. The network…

Optimal coupling among random vectors with known statistics and correlation structure found using minimum spanning tree over measure-valued vertices.

We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem, the optimal number of prediction mistakes can be characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the g…

New spanning tree model connects knot homology, s-invariant, and exotic discs.

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. The Bollobás-Riordan-Tutte polynomial is a three-variable polynomial that extends the Tutte polynomial to oriented ribbon graphs. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chor…

Correlation matrices of foreign exchange rate time series are investigated for 60 world currencies. Minimal Spanning Tree (MST) graphs for the gold, silver and platinum are presented. Inverse power like scaling is discussed for these graphs as well as for four distinct currency groups (major, liquid, less liquid and no…

Novel graph-spanning algorithm detects changes in high-dimensional data.

We investigate the problem of nodes clustering under privacy constraints when representing a dataset as a graph. Our contribution is threefold. First we formally define the concept of differential privacy for structured databases such as graphs, and give an alternative definition based on a new neighborhood notion betw…

Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

The paper develops a method to sparsify magnetic Laplacians using multi-type spanning forests.

Let $M$ be an $n$-dimensional complete simply connected Riemannian manifold with sectional curvature bounded above by a nonpositive constant $-κ^2$. Using the cone total curvature $TC(Γ)$ of a graph $Γ$ which was introduced by Gulliver and Yamada Math. Z. 2006, we prove that the density at any point of a soap film-like…

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …

Quotients of Gordian and H(2)-Gordian graphs are hyperbolic.

A new method improves graph random features with quasi-Monte Carlo techniques.

Determinants of theta curves and symmetric graphs are studied.

For a given boundary set consisting of arcs and vertices, with two or more arcs meeting at each vertex, we treat the problem of estimating the area density of a soap film-like surface spanning the boundary.

We study relations between the Alexander-Conway polynomial $\nabla_L$ and Milnor higher linking numbers of links from the point of view of finite-type (Vassiliev) invariants. We give a formula for the first non-vanishing coefficient of $\nabla_L$ of an m-component link L all of whose Milnor numbers $μ_{i_1... i_p}$ van…

The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry, then the logarithmic Mahler measure $m(Δ)$ of its Laplacian polynomial $Δ$ is the …

It is conjectured that the Khovanov homology of a knot is invariant under mutation. In this paper, we review the spanning tree complex for Khovanov homology, and reformulate this conjecture using a matroid obtained from the Tait graph (checkerboard graph) G of a knot diagram K. The spanning trees of G provide a filtrat…

Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two nodes, or the expected weight of a minimum spanning tree of the graph, etc. These sta…

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…

Introduces data augmentation for graph convolutional networks, proposing Monte Carlo Graph Learning.

The investigations of financial markets from a complex network perspective have unveiled many phenomenological properties, in which the majority of these studies map the financial markets into one complex network. In this work, we investigate 30 world stock market indices through their visibility graphs by adopting the…

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have exactly three vertices) the spanning trees are generated by the Pfaffian of a suitably…

The paper identifies the minimum mean-variance spanning set and its importance in asset evaluation.

The paper confirms a conjecture linking link bipyramid volume and Mahler measure.

Repelling random walks improve graph-based sampling efficiency.

Enhanced Markov chain sampler learns network statistics faster.

A result about spanning forests for graphs yields a short proof of Krebes's theorem concerning embedded tangles in links.

We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also present a spanning quasi-tree model for the Khovanov homology of a ribbon graph.

The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.

Online change-point detection (OCPD) is important for application in various areas such as finance, biology, and the Internet of Things (IoT). However, OCPD faces major challenges due to high-dimensionality, and it is still rarely studied in literature. In this paper, we propose a novel, online, graph-based, change-poi…

We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the asymptotic expansion of the number of spanning trees and the sum of cycle-rooted spannin…

We consider the problem of change-point detection in multivariate time-series. The multivariate distribution of the observations is supposed to follow a graphical model, whose graph and parameters are affected by abrupt changes throughout time. We demonstrate that it is possible to perform exact Bayesian inference when…

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …

Graphs with specific spanning trees yield RAAGs, with applications to BBGs.

Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair $(G,p)$ of graph $G$ together with a map $p$ of the vertices of $G$ into the Euclidean pla…

The paper explores subrepresentations in graph homology.