Related papers: ({\alpha}, {\beta})-Modules in Graphs
We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internally while sparsely connected to the rest of the graph. In…
We introduce a series of graph decompositions based on the modulator/target scheme of modification problems that enable several algorithmic applications that parametrically extend the algorithmic potential of planarity. In the core of our…
A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this…
A graph is well-covered if all its maximal independent sets have the same cardinality. This well studied concept was introduced by Plummer in 1970 and naturally generalizes to the weighted case. Given a graph $G$, a real-valued vertex…
We study the $a$-sequence $(a_0(G), a_1(G), \cdots)$ of a finite simple graph $G$, defined recursively through a combinatorial rule and known to coincide with the sequence of rational Betti numbers of the real toric variety associated with…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…
We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel…
Current modularity-based community detection algorithms attempt to find cluster memberships that maximize modularity within a fixed graph topology. Diverging from this conventional approach, our work introduces a novel strategy that employs…
In this short note, we will explain that the good moduli space morphisms behave as if they are proper when we consider sheaf operations, though they are not separated. For example, the decomposition theorem and the base change theorem hold…
An old idea in optimization theory says that since the gradient is a dual vector it may not be subtracted from the weights without first being mapped to the primal space where the weights reside. We take this idea seriously in this paper…
This article develops a new theoretical basis for decomposing signals that are formed by the linear superposition of a finite number of modes. Each mode depends nonlinearly upon several parameters; we seek both these parameters and the…
Graph-modification problems, where we modify a graph by adding or deleting vertices or edges or contracting edges to obtain a graph in a {\it simpler} class, is a well-studied optimization problem in all algorithmic paradigms including…
The geometric Langlands program is distinguished in assigning spectral decompositions to all representations, not only the irreducible ones. However, it is not even clear what is meant by a spectral decomposition when one works with…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
Revealing a community structure in a network or dataset is a central problem arising in many scientific areas. The modularity function $Q$ is an established measure quantifying the quality of a community, being identified as a set of nodes…
Let $ \mathbb{A}$ be a cellular algebra over a field $\mathbb{F}$ with a decomposition of the identity $ 1_{\mathbb{A}} $ into orthogonal idempotents $ e_i$, $i \in I$ (for some finite set $I$) satisfying some properties. We describe the…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…
Let A \subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case…
Many complex tasks can be decomposed into simpler, independent parts. Discovering such underlying compositional structure has the potential to enable compositional generalization. Despite progress, our most powerful systems struggle to…