Related papers: Integrability of Generalised Skew-Symmetric Replic…
This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective…
We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation. Previous graph embeddings have limited expressiveness and either cannot…
Graph analytics can lead to better quantitative understanding and control of complex networks, but traditional methods suffer from high computational cost and excessive memory requirements associated with the high-dimensionality and…
We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…
$S$-gap shifts are a well-studied class of shift spaces, which has led to several proposed generalizations. This paper introduces a new class of shift spaces called $\mathcal{S}$-graph shifts whose essential structure is encoded in a novel…
In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications. Different from existing research…
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…
A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…
We reformulate the theory of p-adic iterated integrals on semistable curves using the unipotent log rigid fundamental group. This fundamental group carries Frobenius and monodromy operators whose basic properties are established. By…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
Extending Stallings' foldings of trees, we show in this article that every parallel-preserving map between median graphs factors as an isometric embedding through a sequence of elementary transformations which we call foldings and…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional spaces and match…
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…
We develop a geometric framework for the exact integration of Hamiltonian systems based on triangular closure relations among a finite family of functions. Unlike Liouville-Arnold integrability and its noncommutative generalizations, the…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction…
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…
Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…