Related papers: Computing eulerian magnitude homology
Graphlets of order $k$ in a graph $G$ are connected subgraphs induced by $k$ nodes (called $k$-graphlets) or by $k$ edges (called edge $k$-graphlets). They are among the interesting subgraphs in network analysis to get insights on both the…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…
Magnitude is a numerical invariant of metric spaces and graphs, analogous, in a precise sense, to Euler characteristic. Magnitude homology is an algebraic invariant constructed to categorify magnitude. Among the important features of the…
We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…
The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs''…
The study of the homology of diagram algebras has emerged as an interesting and important field. In many cases, the homology of a diagram algebra can be identified with the homology of a group. In this paper we have two main aims. Firstly,…
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to…
We address the problem of enumerating all maximal clique-partitions of an undirected graph and present an algorithm based on the observation that every maximal clique-partition can be produced from the maximal clique-cover of the graph by…
Let X(G) denote the flag complex of a graph G=(V,E) on n vertices. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following result: Let \lambda_2(G) denote the second…
Homology is a tool in topological data analysis which measures the shape of the data. In many cases, these measurements translate into new insights which are not available by other means. To compute homology, we rely on mathematical…
Finding optimal matchings in dense graphs is of general interest and of particular importance in social, transportation and biological networks. While developing optimal solutions for various matching problems is important, the running…
Arone and the second author showed that when the dimensions are in the stable range, the rational homology and homotopy of the high dimensional anologues of spaces of long knots can be calculated as the homology of a direct sum of finite…
We calculate the rational cohomology of the classifying space of the diffeomorphism group of the manifolds $U_{g,1}^n:= \#^g(S^n \times S^{n+1})\setminus \mathrm{int}{D^{2n+1}}$, for large $g$ and $n$, up to approximately degree $n$. The…
Symmetries in a network connectivity regulate how the graph's functioning organizes into clustered states. Classical methods for tracing the symmetry group of a network require very high computational costs, and therefore they are of hard,…
The boxicity of a graph $G$ is the minimum dimension $d$ that admits a representation of $G$ as the intersection graph of a family of axis-parallel boxes in $\mathbb{R}^d$. Computing boxicity is an NP-hard problem, and there are few known…
We present the first linear-time algorithm that computes the $4$-edge-connected components of an undirected graph. Hence, we also obtain the first linear-time algorithm for testing $4$-edge connectivity. Our results are based on a…