arXiv research

Edge augmentation connects disconnected graphs by elevating eigenvalues.

New Coxeter groups have unique boundary structures.

We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juhász's sutured Floer TQFT. We compute the maps for several elementary graph cobordisms. As an application, we compute the action of the fundamental …

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that are known to be counterexamples to the coarse Baum-Connes conjecture. In particula…

We propose a scalable Gromov-Wasserstein learning (S-GWL) method and establish a novel and theoretically-supported paradigm for large-scale graph analysis. The proposed method is based on the fact that Gromov-Wasserstein discrepancy is a pseudometric on graphs. Given two graphs, the optimal transport associated with th…

Study shows RAAG automorphisms and outer automorphisms are not relatively hyperbolic.

We construct a graph TQFT for the minus flavor of Heegaard Floer homology. Our graph TQFT extends Ozsváth and Szabó's TQFT for closed and connected 3-manifolds, and allows for cobordisms with disconnected ends. As an application, we give an explicit formula for the chain homotopy type of the $π_1$-action on Heegaard Fl…

Diestel-Leader graphs are neither hyperbolic nor CAT(0), so their visual boundaries may be pathological. Indeed, we show that for $d>2$, $\partial\text{DL}_d(q)$ carries the indiscrete topology. On the other hand, $\partial\text{DL}_2(q)$, while not Hausdorff, is $T_1$, totally disconnected, and compact. Since $\text{D…

No GANs can learn disconnected manifolds precisely.

Proves a generalized Whitehead cut vertex lemma for tree groups.

Graphs are naturally sparse objects that are used to study many problems involving networks, for example, distributed learning and graph signal processing. In some cases, the graph is not given, but must be learned from the problem and available data. Often it is desirable to learn sparse graphs. However, making a grap…

Proposes a GNN for multivariate time-series prediction with filtering.

This paper proposes a method to reveal task relationships in multi-task learning models using sparse graphs.

We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the other player's goal is to disconnect the shadow. We make significant progress t…

Modof-pipe optimizes molecules by modifying a single site, outperforming state-of-the-art methods.

Graph pruning improves neural network performance by addressing squashing and smoothing issues.

Ensemble of GANs improves performance on disconnected data.

Unbounded convex domains have zero mean curvature on disconnected boundaries.

The monitoring of large dynamic networks is a major chal- lenge for a wide range of application. The complexity stems from properties of the underlying graphs, in which slight local changes can lead to sizable variations of global prop- erties, e.g., under certain conditions, a single link cut that may be overlooked du…

The study introduces Cayley--Abels--Rosendal graphs for Polish groups.

Two proofs show that removing a loop from a plane circuit splits the plane.

We study the full holonomy group of Lorentzian manifolds with a parallel null line bundle. We prove several results that are based on the classification of the restricted holonomy groups of such manifolds and provide a construction method for manifolds with disconnected holonomy which starts from a Riemannian manifold …

Proposes GFMMD for comparing signals on graphs.

Study of pants decompositions on surfaces of infinite type.

Paper analyzes and improves graph convolutional networks for node classification.

We study the space of positive scalar curvature (psc) metrics on a 4-manifold, and give examples of simply connected manifolds for which it is disconnected. These examples imply that concordance of psc metrics does not imply isotopy of such metrics. This is demonstrated using a modification of the 1-parameter Seiberg-W…

PieClam autoencodes graphs into communities, improving graph anomaly detection.

We show that if $Σ\subset \mathbb R^4$ is a closed, connected hypersurface with entropy $λ(Σ)\leq λ(\mathbb{S}^2\times \mathbb R)$, then the level set flow of $Σ$ never disconnects. We also obtain a sharp version of the forward clearing out lemma for non-fattening flows in $\mathbb R^4$ of low entropy.

Proposes SCD-split for CP to balance interpretability and efficiency.

SubGNN tackles subgraph prediction challenges in graphs.

We show that if two closed hyperbolic surfaces (not necessarily orientable or even connected) have the same Laplace spectrum, then for every length they have the same number of orientation-preserving geodesics and the same number of orientation-reversing geodesics. Restricted to orientable surfaces, this result reduces…

We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an approach similar to Skip-gram. Observations from neighborhoods of different sizes are either pooled (AE) or encoded distinctly in a multi-s…

Estimates smooth graph signals from partial measurements.

HLTF generates chemically valid 3D molecules with improved topology control.

MAGNA improves graph neural networks by incorporating multi-hop context information.

The discrete isoperimetric inequality in Euclidean geometry states that among all $n$-gons having a fixed perimeter $p$, the one with the largest area is the regular $n$-gon. The statement is true in spherical geometry and hyperbolic geometry as well. In this paper, we generalize the discrete isoperimetric inequality t…

Study finds Hilbert square of real surfaces can be maximal even when the surface has disconnected real locus.

With an eye towards studying curve systems on low-complexity surfaces, we introduce and analyze the $k$-Farey graphs $\mathcal{F}_k$ and $\mathcal{F}_{\leqslant k}$, two natural variants of the Farey graph in which we relax the edge condition to indicate intersection number $=k$ or $\le k$, respectively. The former, $\…

Natural images may lie on a union of disjoint manifolds rather than one globally connected manifold, and this can cause several difficulties for the training of common Generative Adversarial Networks (GANs). In this work, we first show that single generator GANs are unable to correctly model a distribution supported on…

We derive an obstruction to representing a homology class of a symplectic 4-manifold by an embedded, possibly disconnected, symplectic surface.

Dynamic angles estimated from noisy measurements over time with smoothness constraints.

A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lovász showed that the maximum number of pairwise edge-disjoint $T$-paths in an inner Eulerian graph $G…

Objective: Multimodal measurements of the same phenomena provide complementary information and highlight different perspectives, albeit each with their own limitations. A focus on a single modality may lead to incorrect inferences, which is especially important when a studied phenomenon is a disease. In this paper, we …

We give examples of compact symplectic manifolds with disconnected contact type boundary in dimension $4n$ for any $n\geq 1$. The example is given by a subset of the tangent bundle of a compact quotient of the complex hyperbolic space endowed with the canonical symplectic form plus a generalized magnetic field and its …

MGM improves media profiling by integrating textual and structural features.

We briefly survey the Hilbert--Smith Conjecture, and we include a proof of it in dimension two (where it is originally due to Montgomery--Zippin).

We study online learning when partial feedback information is provided following every action of the learning process, and the learner incurs switching costs for changing his actions. In this setting, the feedback information system can be represented by a graph, and previous works studied the expected regret of the le…

Discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs.