arXiv research

By proving graph theoretical versions of Green-Stokes, Gauss-Bonnet and Poincare-Hopf, core ideas of undergraduate mathematics can be illustrated in a simple graph theoretical setting. In this pedagogical exposition we present the main proofs on a single page and add illustrations. While discrete Stokes is is old, the …

G1 uses RL to enhance LLMs' graph reasoning, improving performance on diverse tasks.

Graph theory connects automorphisms to cohomology.

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knot…

It is a usual practice to ignore any structural information underlying classes in multi-class classification. In this paper, we propose a graph convolutional network (GCN) augmented neural network classifier to exploit a known, underlying graph structure of labels. The proposed approach resembles an (approximate) infer…

We prove a discrete Gauss-Bonnet-Chern theorem which states where summing the curvature over all vertices of a finite graph G=(V,E) gives the Euler characteristic of G.

The relation between time series irreversibility and entropy production has been recently investigated in thermodynamic systems operating away from equilibrium. In this work we explore this concept in the context of financial time series. We make use of visibility algorithms to quantify in graph-theoretical terms time …

In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with a view towards applications to cryptography.

Unified framework for OOD detection and generalization using graph theory.

Investment returns naturally reside on irregular domains, however, standard multivariate portfolio optimization methods are agnostic to data structure. To this end, we investigate ways for domain knowledge to be conveniently incorporated into the analysis, by means of graphs. Next, to relax the assumption of the comple…

Unified framework for disentangled representations using mechanistic independence.

We prove a graph theoretic closed formula for coefficients in the Tian-Yau-Zelditch asymptotic expansion of the Bergman kernel. The formula is expressed in terms of the characteristic polynomial of the directed graphs representing Weyl invariants. The proof relies on a combinatorial interpretation of a recursive formul…

The equivariant cohomology ring of a GKM manifold is isomorphic to the cohomology ring of its GKM graph. In this paper we explore the implications of this fact for equivariant fiber bundles for which the total space and the base space are both GKM and derive a graph theoretical version of the Leray-Hirsch theorem. Then…

In this paper, we show how to construct graph theoretical models of n-dimensional continuous objects and manifolds. These models retain topological properties of their continuous counterparts. An LCL collection of n-cells in Euclidean space is introduced and investigated. If an LCL collection of n-cells is a cover of a…

Classifies graph configuration spaces homeomorphic to manifolds.

This research introduces dynamic portfolio cuts using a spectral approach for graph-theoretic diversification.

Polterovich proved a remarkable closed formula for heat kernel coefficients of the Laplace operator on compact Riemannian manifolds involving powers of Laplacians acting on the distance function. In the case of Kähler manifolds, we prove a combinatorial formula for powers of the complex Laplacian and use it to derive a…

Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and reversing colors around a vertex. In the case of the plane, this is well studied…

We express characteristic numbers of compact hyperkähler manifolds in graph-theoretical form, considering them as a special case of the curvature invariants introduced by Rozansky and Witten. The appropriate graphs are generated by ``wheels'' and we use the recently proved Wheeling Theorem to give a formula for the L2 …

This paper continues our study, initiated in [arXiv:1108.3370], of essential state surfaces in link complements that satisfy a mild diagrammatic hypothesis (homogeneously adequate). For hyperbolic links, we show that the geometric type of these surfaces in the Thurston trichotomy is completely determined by a simple gr…

Paper formalizes a reinforcement learning model for complex information structures.

New bound for group action length without diameter restriction.

SON-NMF estimates nonnegative rank on-the-fly for NMF.

Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional independence constraints on collections of random variables. We give a precise graph-theoretic characterization of when submatrices of the cov…

We present a graph-theoretical approach to data clustering, which combines the creation of a graph from the data with Markov Stability, a multiscale community detection framework. We show how the multiscale capabilities of the method allow the estimation of the number of clusters, as well as alleviating the sensitivity…

Metric graphs have subgraphs with entropy at least λ.

A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all non-source and non-sink nodes. We propose a novel polynomial time algorithm to …

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to depend on standard graph-theoretic properties, such as the degree and eigenvalue di…

By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing crystallization catalogue C^{28}, due to Lins, is used to obtain upper bounds for the comp…

We propose a multiresolution Gaussian process to capture long-range, non-Markovian dependencies while allowing for abrupt changes. The multiresolution GP hierarchically couples a collection of smooth GPs, each defined over an element of a random nested partition. Long-range dependencies are captured by the top-level GP…

Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship between the two focusing on how one transitions between Fox and Dehn colorings. I…

We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate mappings of subgraphs by …

We consider the task of causal structure learning over measurement dependence inducing latent (MeDIL) causal models. We show that this task can be framed in terms of the graph theoretic problem of finding edge clique covers,resulting in an algorithm for returning minimal MeDIL causal models (minMCMs). This algorithm is…

We introduce the index i(v) = 1 - X(S(v)) for critical points of a locally injective function f on the vertex set V of a simple graph G=(V,E). Here S(v) = {w in E | (v,w) in E, f(w)-f(v)<0} is the subgraph of the unit sphere at v in G. It is the exit set of the gradient vector field. We prove that the sum of i(v) over …

New theorem on graph curvature thresholds and uniqueness.

Optimizes network sampling for efficient community detection.

We address two fundamental questions about graph neural networks (GNNs). First, we prove that several important graph properties cannot be computed by GNNs that rely entirely on local information. Such GNNs include the standard message passing models, and more powerful spatial variants that exploit local graph structur…

Recomputation algorithms collectively refer to a family of methods that aims to reduce the memory consumption of the backpropagation by selectively discarding the intermediate results of the forward propagation and recomputing the discarded results as needed. In this paper, we will propose a novel and efficient recompu…

We study a class of 3-manifolds called strong L-spaces, which by definition admit a certain type of Heegaard diagram that is particularly simple from the perspective of Heegaard Floer homology. We provide evidence for the possibility that every strong L-space is the branched double cover of an alternating link in the t…

We provide geometric conditions on a pair of hyperplanes of a CAT(0) cube complex that imply divergence bounds for the cube complex. As an application, we classify all right-angled Coxeter groups with quadratic divergence and show right-angled Coxeter groups cannot exhibit a divergence function between quadratic and cu…

Consumers with low demand, like households, are generally supplied single-phase power by connecting their service mains to one of the phases of a distribution transformer. The distribution companies face the problem of keeping a record of consumer connectivity to a phase due to uninformed changes that happen. The exact…

Edge augmentation connects disconnected graphs by elevating eigenvalues.

Financial markets are a typical example of complex systems where interactions between constituents lead to many remarkable features. Here, we show that a pairwise maximum entropy model (or auto-logistic model) is able to describe switches between ordered (strongly correlated) and disordered market states. In this frame…

FMI uses matching to mimic interventions for causal feature learning.

We analyze oversquashing in topological message-passing using relational structures.

Novel graph theory for neural networks improves understanding of their structure and performance.

This paper develops graph theory for racks and quasigroups.

Residual torsion-free nilpotence has proven to be an important property for knot groups with applications to bi-orderability and ribbon concordance. Mayland proposed a strategy to show that a two-bridge knot group has a commutator subgroup which is a union of an ascending chain of parafree groups. This paper proves May…