arXiv research

Graphs can model interactions between vertices, but how well depends on graph structure.

The paper extends Gaussian processes to model complex interactions in cellular complexes.

Natural metrics provide a way to induce a metric on the tangent bundle from the metric on its base manifold. The most studied type is the Sasaki metric, which applies the base metric separately to the vertical and horizontal components. We study a more general class of metrics which introduces interactions between the …

Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.

Researchers create new triply periodic minimal surfaces by gluing saddle towers.

Simplicial neural networks extend graph neural networks to handle higher-order interactions.

A new algorithm reduces graph complexity for better dense subgraph analysis.

New hypergraph neural network learns variable-sized hyperedges.

New framework analyzes belief evolution in social networks.

We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities along a graph $Γ$. We impose physically relevant conditions on the cone singularities, e.g. positivity of mass (angle less than $2π$ on time-like singular segments). We construct examples of such manifolds, d…

e-GGPs learn graph vertex transitions over time.

New method detects communities in hypergraphs by embedding them into a vector space.

Monte Carlo (MC) methods are widely used for Bayesian inference and optimization in statistics, signal processing and machine learning. A well-known class of MC methods are Markov Chain Monte Carlo (MCMC) algorithms. In order to foster better exploration of the state space, specially in high-dimensional applications, s…

Network clustering reveals the organization of a network or corresponding complex system with elements represented as vertices and interactions as edges in a (directed, weighted) graph. Although the notion of clustering can be somewhat loose, network clusters or groups are generally considered as nodes with enriched in…

Spectral algorithm recovers community structure in sparse hypergraphs.

We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities along a graph $Γ$. We impose physically relevant conditions on the cone singularities, e.g. positivity of mass (angle less than $2π$ on time-like singular segments). We construct examples of such manifolds, d…

In a dynamic network, the neighborhood of the vertices evolve across different temporal snapshots of the network. Accurate modeling of this temporal evolution can help solve complex tasks involving real-life social and interaction networks. However, existing models for learning latent representation are inadequate for …

We use conformal, but ghostful, Weyl gravity to study its ghost-free, second derivative, partially massless (PM) spin 2 component in presence of Einstein gravity with positive cosmological constant. Specifically, we consider both gravitational- and self- interactions of PM via the fully non-linear factorization of conf…

Federated Granger causality learns reliable interactions without sharing data.

TopoNTK kernel captures higher-order interactions in simplicial complexes.

While multi-agent interactions can be naturally modeled as a graph, the environment has traditionally been considered as a black box. We propose to create a shared agent-entity graph, where agents and environmental entities form vertices, and edges exist between the vertices which can communicate with each other. Agent…

Kronecker product kernel provides the standard approach in the kernel methods literature for learning from graph data, where edges are labeled and both start and end vertices have their own feature representations. The methods allow generalization to such new edges, whose start and end vertices do not appear in the tra…

Introduces Spectral Graph Network combining spatial and spectral message passing.

A geodesic net with 4 boundary vertices and 25 balanced vertices is constructed.

Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network's large-scale …

The Ising model is important in statistical modeling and inference in many applications, however its normalizing constant, mean number of active vertices and mean spin interaction -- quantities needed in inference -- are computationally intractable. We provide accurate approximations that make it possible to numericall…

DeepMap learns deep graph representations via CNNs, improving graph classification performance.

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615 triangulations of the twisted sphere product $S^2_\times_S^1$. All the 3-spheres…

The string vertices of closed string field theory are subsets of the moduli spaces of punctured Riemann surfaces that satisfy a geometric version of the Batalin-Vilkovisky master equation. We present a homological proof of existence of string vertices and their uniqueness up to canonical transformations. Using hyperbol…

We prove the existence of a complete, embedded, singly periodic minimal surface, whose quotient by vertical translations has genus one and two ends. The existence of this surface was announced in our paper in {\it Bulletin of the AMS}, 29(1):77--84, 1993. Its ends in the quotient are asymptotic to one full turn of the …

We prove that any complete surface with constant mean curvature in a homogeneous space E(κ,τ) which is transversal to the vertical Killing vector field is, in fact, a vertical graph. As a consequence we get that any orientable, parabolic, complete, immersed surface with constant mean curvature H in E(κ,τ) (different fr…

SplitNN-driven Vertical Partitioning enables distributed learning from diverse data sources.

Consider two networks on overlapping, non-identical vertex sets. Given vertices of interest in the first network, we seek to identify the corresponding vertices, if any exist, in the second network. While in moderately sized networks graph matching methods can be applied directly to recover the missing correspondences,…

Classifies 3-manifolds from simplified (2,0)-trisections of 4-manifolds.

Improved bounds on ideal vertices in right-angled hyperbolic polyhedra.

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Sc…

The paper examines vertical curves and fibers in the Heisenberg group, proving properties and constructing counterexamples.

P. Arnoux and A. Marin showed that any triangulation of $\mathbb{RP}^n$ contains more than $\frac{(n+1)(n+2)}{2}$ vertices if $n \geq 3$. We construct some natural triangulation of $\mathbb{RP}^n$ with $\frac{n(n+5)}{2}-1$ vertices for all $n \geq 3$. Previously, it was known that $\mathbb{RP}^n$ has $\mathbb{Z}_2^n$-e…

In this paper we study some problems related to a vertical Liouville distribution (called vertical Liouville-Hamilton distribution) on the cotangent bundle of a Cartan space. We study the existence of some linear connections of Vrănceanu type on Cartan spaces related to some foliated structures. Also, we identify a cer…

Paper shows minimum 10 vertices for hyperbolic origami 2-torus.

Numerous pattern recognition applications can be formed as learning from graph-structured data, including social network, protein-interaction network, the world wide web data, knowledge graph, etc. While convolutional neural network (CNN) facilitates great advances in gridded image/video understanding tasks, very limit…

Only vertical planes are asymptotic to other planes in 3D space.

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …

Asynchronous federated learning for vertically partitioned data improves efficiency and privacy.

We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be new even in the Euclidean case. We demonstrate by examples that the result is not …

We uncover some connections between the topology of a complete Riemannian surface M and the minimum number of vertices, i.e., critical points of geodesic curvature, of closed curves in M. In particular we show that the space forms with finite fundamental group are the only surfaces in which every simple closed curve ha…

An unknotting tunnel in a 3-manifold with boundary is a properly embedded arc, the complement of an open neighborhood of which is a handlebody. A geodesic with endpoints on the cusp boundary of a hyperbolic 3-manifold and perpendicular to the cusp boundary is called a vertical geodesic. Given a vertical geodesic in a h…

The study shows how to construct $d$-spheres from $(d-1)$-spheres and $d$-balls without additional vertices.