Related papers: Holomorphic subgraph reduction of higher-point mod…
Pioneered by Benczur and Karger for cuts in graphs [STOC'96], sparsification is a fundamental topic with wide-ranging applications that has been studied, e.g., for graphs and hypergraphs, in a combinatorial and a spectral setting, and with…
Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at most $k$ edge additions and deletions that transform $G$ into a cograph. This…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the…
To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…
Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
We study the 4-d holomorphic Spin Foam amplitude on arbitrary connected 2-complexes and degrees of divergence. With recently developed tools and truncation scheme, we derive a formula for a certain class of graphs, which allows us to write…
Let R be a commutative ring and M be an R-module. We define the large sum graph, denoted by \acute{G}(M), as a graph with the vertex set of non-large submodules of M and two distinct vertices are adjacent if and only if N + K is a non-large…
In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
We investigate the cohomology of the Milnor fibre of a reflection arrangement as a module for the group $\Gamma$ generated by the reflections, together with the cyclic monodromy. Although we succeed completely only for unitary reflection…
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…
Let G be an arbitrary finite weighted digraph with weights in the set of complex rational functions. A general procedure is proposed which allows for the reduction of G to a smaller graph with a less complicated structure having the same…
Recently holographic prescriptions are proposed to compute quantum complexity of a given state in the boundary theory. A specific proposal known as `holographic subregion complexity' is supposed to calculate the the complexity of a reduced…
A closed 3-form $H \in \Omega^3_0(M)$ defines an extension of $\Gamma(TM)$ by $\Omega^2_0(M)$. This fact leads to the definition of the group of $H$-twisted Hamiltonian symmetries $\Ham(M, \JJ; H)$ as well as Hamiltonian action of Lie group…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…