Related papers: Simplex Layers and Phase Boundaries in the Partiti…
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer networks. We focus on two central…
We study the cokernel of the application given by the Cartan Matrix $C_\Lambda$ of a finite dimensional $k$-algebra $\Lambda.$ This produces a finitely generated abelian group, the Cartan group $G_\Lambda,$ which is invariant under derived…
Many systems are naturally represented by a multilayer network in which edges exist in multiple layers that encode different, but potentially related, types of interactions, and it is important to understand limitations on the detectability…
For generic maps from compact surfaces with boundary into the plane we develop an explicit algorithm for minimizing both the number of cusps and the number of components of the singular locus. More precisely, we minimize among maps with…
Motivated by a question of Galby, Munaro, and Yang (SoCG 2023) asking whether every graph class of bounded layered tree-independence number admits clique-based separators of sublinear weight, we investigate relations between layered…
Understanding the role of randomness when solving locally checkable labeling (LCL) problems in the LOCAL model has been one of the top priorities in the research on distributed graph algorithms in recent years. For LCL problems in…
Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping…
We consider the question of orienting the edges in a graph $G$ such that every vertex has bounded out-degree. For graphs of arboricity $\alpha$, there is an orientation in which every vertex has out-degree at most $\alpha$ and, moreover,…
Residual connections and normalization layers have become standard design choices for graph neural networks (GNNs), and were proposed as solutions to the mitigate the oversmoothing problem in GNNs. However, how exactly these methods help…
Grain boundaries in extremely confined colloidal smectics possess a topological fine structure with coexisting nematic and tetratic symmetry of the director field. An alternative way to approach the problem of smectic topology is via the…
We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that tile the entire image. The problem is cast as optimization…
Unsupervised discretization is a crucial step in many knowledge discovery tasks. The state-of-the-art method for one-dimensional data infers locally adaptive histograms using the minimum description length (MDL) principle, but the…
A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…
Let $\mathcal{M}_{g}$ be the moduli space of compact connected hyperbolic surfaces of genus $g\geq2$, and ${\mathcal B}_g \subset {\mathcal M}_{g} $ its branch locus. Let $\widehat{{\mathcal{M}}_{g}}$ be the Deligne-Mumford compactification…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each…
Pooling layers (e.g., max and average) may overlook important information encoded in the spatial arrangement of pixel intensity and/or feature values. We propose a novel lacunarity pooling layer that aims to capture the spatial…
In this paper we provide a classification theorem for 1-dimensional boundaries of groups with isolated flats. Given a group $\Gamma$ acting geometrically on a $CAT(0)$ space $X$ with isolated flats and 1-dimensional boundary, we show that…
The Cluster Deletion problem takes a graph $G$ as input and asks for a minimum size set of edges $X$ such that $G-X$ is the disjoint union of complete graphs. An equivalent formulation is the Clique Partition problem, which asks to find a…
For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…