Related papers: Holomorphic subgraph reduction of higher-point mod…

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

Despite there being significant work on developing spectral, and metric embedding based approximation algorithms for hypergraph generalizations of conductance, little is known regarding the approximability of hypergraph partitioning…

A self-dual harmonic 2-form on a 4-dimensional Riemannian manifold is symplectic where it does not vanish. Furthermore, away from the form's zero set, the metric with the 2-form give a compatible almost complex structure and thus…

We show that the weight four modular graph functions that contribute to the integrand of the t_8 t_8 D^4 R^4 term at one loop in heterotic string theory do not require regularization, and hence the integrand is simple. This is unlike the…

In this paper we define and study the moduli space of metric-graph-flows in a manifold M. This is a space of smooth maps from a finite graph to M, which, when restricted to each edge, is a gradient flow line of a smooth (and generically…

We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to…

In this note we study $SL(2,\mathbb{Z})$-invariant functions such as modular graph functions or coefficient functions of higher derivative corrections in type IIB string theory. The functions solve inhomogeneous Laplace equations and we…

In this paper, we introduce a generalization of graphlets to heterogeneous networks called typed graphlets. Informally, typed graphlets are small typed induced subgraphs. Typed graphlets generalize graphlets to rich heterogeneous networks…

Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…

We define a cohomology for an arbitrary $K$-linear semistrict semigroupal 2-category $(\mathfrak{C},\otimes)$ (called in the paper a Gray semigroup) and show that its first order (unitary) deformations, up to the suitable notion of…

This paper uses the relationship between graph conductance and spectral clustering to study (i) the failures of spectral clustering and (ii) the benefits of regularization. The explanation is simple. Sparse and stochastic graphs create a…

In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of one-vertex insertions v_1,...,v_n, such that the neighbourhood of vertex v_i, 2<= i<= n, forms a module (a homogeneous set) of the graph…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

Existing multiplex graph models often assume homophily, where connected nodes tend to belong to the same class or share similar attributes. Consequently, these models may struggle with graphs exhibiting heterophily, where connected nodes…

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

The modular decomposition of a graph $G=(V,E)$ does not contain prime modules if and only if $G$ is a cograph, that is, if no quadruple of vertices induces a simple connected path $P_4$. The cograph editing problem consists in inserting…

Let~$X=\Po/\Gamma$ be an~$n$-punctured sphere, $n>3$. We introduce and study~$n-3$ deformation operators on the space of modular forms~$M_*(\Gamma)$ based on the classical theory of uniformizing differential equations and accessory…

Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles,…

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…