arXiv research

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

Classifies soap film surfaces with vertical potentials.

Study on solitons in complex Riemannian manifolds with specific properties.

Paper finds relations between Willmore-type energies, weighted areas, and vertical potential energies for cylindrical critical points.

This paper introduces a novel technique to track structures in time varying graphs. The method uses a maximum a posteriori approach for adjusting a three-dimensional co-clustering of the source vertices, the destination vertices and the time, to the data under study, in a way that does not require any hyper-parameter t…

This paper introduces a novel technique to track structures in time evolving graphs. The method is based on a parameter free approach for three-dimensional co-clustering of the source vertices, the target vertices and the time. All these features are simultaneously segmented in order to build time segments and clusters…

A variation of the preferential attachment random graph model of Barabási and Albert is defined that incorporates planted communities. The graph is built progressively, with new vertices attaching to the existing ones one-by-one. At every step, the incoming vertex is randomly assigned a label, which represents a commun…

FastMap-D embeds directed graphs using potential fields.

The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.

Estimates smooth graph signals from partial measurements.

We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acyclic graph $G$ on $p$ vertices corresponding to variables, the non-zero entries of the extracted principal component must coincide with vertice…

Proves bounds on spanning two-forests and random cut sizes.

The paper construct a suitable generalized metrical multi-time Lagrange geometrical model for both gravitational and electromagnetic fields, in a general setting. In this construction, the gravitational potentials are described by a distinguished vertical metrical tensor of the form $h^{/alpha/beta}e^{2σ}/phi_{ij}$.

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

The maximum number of maximum cliques in a graph is determined for graphs with at least 15 vertices.

Study on a new type of solitons on specific geometric manifolds.

Study of para-Ricci-like solitons on specific Riemannian manifolds.

Paper proves no nontrivial solutions to certain elliptic equations on graphs.

PRISM identifies simplex vertices from noisy data.

Study on Ricci-like solitons and gradient solitons on specific manifolds.

Study on polyhedra rigidity, finding non-existence of flexible weakly convex decomposable polyhedra.

Study para-Ricci-like solitons on special Riemannian manifolds, proving geometric properties and providing an example.

Nonexistence results for semilinear parabolic and hyperbolic inequalities on metric graphs

This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the ver…

Graph convolutional neural networks (Graph-CNNs) extend traditional CNNs to handle data that is supported on a graph. Major challenges when working with data on graphs are that the support set (the vertices of the graph) do not typically have a natural ordering, and in general, the topology of the graph is not regular …

Statistical physics approaches can be used to derive accurate predictions for the performance of inference methods learning from potentially noisy data, as quantified by the learning curve defined as the average error versus number of training examples. We analyse a challenging problem in the area of non-parametric inf…

Study of Yamabe solitons on specific geometric manifolds.

Study on Ricci-like solitons on specific geometric manifolds, finding properties and conditions.

Study on Yamabe solitons on specific complex manifolds, focusing on torse-forming vector fields.

Given a graph where vertices represent alternatives and arcs represent pairwise comparison data, the statistical ranking problem is to find a potential function, defined on the vertices, such that the gradient of the potential function agrees with the pairwise comparisons. Our goal in this paper is to develop a method …

This paper examines how graph topology affects adversarial attacks on vertex classification.

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.

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

Structured prediction can be thought of as a simultaneous prediction of multiple labels. This is often done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise and unary potentials. The above is naturally modeled with a graph, where edges and vertices are related to pairwise and…

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,…

Combining data from varied sources has considerable potential for knowledge discovery: collaborating data parties can mine data in an expanded feature space, allowing them to explore a larger range of scientific questions. However, data sharing among different parties is highly restricted by legal conditions, ethical c…

The purpose of this article is to \begin{enumerate} \item define $M(t,k)$ the $t$-fold center of mass arrangement for $k$ points in the plane, \item give elementary properties of $M(t,k)$ and \item give consequences concerning the space $M(2,k)$ of $k$ distinct points in the plane, no four of which are the vertices of …

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

VFGNN tackles privacy-preserving node classification with federated GNN.

Sharp inequalities and solitons studied in statistical submersions.

Bordered Floer homology associates to a parametrized oriented surface a certain differential graded algebra. We study the properties of this algebra under splittings of the surface. To the circle we associate a differential graded 2-algebra, the nilCoxeter sequential 2-algebra, and to a surface with connected boundary …

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

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…