arXiv research

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges …

Hypercube graphs are optimal in spectral rigidity due to Bakry--Émery curvature.

DFM model detects communities in weighted networks without distributional assumptions.

A new method subsamples data without weights to improve model performance.

Improved ANN-based Monte Carlo simulation for Higgs decay events.

Gromov-Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov-Hausdorff distance is equivalent to solving an NP-Hard optimization problem, deeming the notion impractical for applications. In this paper we pro…

Unweighted matrix factorization can match or outperform weighted methods in recommender systems.

Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the significance of this problem, statistical characterization of the proposed metrics …

We analyze directed, unweighted graphs obtained from $x_i\in \mathbb{R}^d$ by connecting vertex $i$ to $j$ iff $|x_i - x_j| < ε(x_i)$. Examples of such graphs include $k$-nearest neighbor graphs, where $ε(x_i)$ varies from point to point, and, arguably, many real world graphs such as co-purchasing graphs. We ask whethe…

Heat kernels map RCD spaces to Riemannian manifolds.

We show injectivity of the geodesic X-ray transform on piecewise constant functions when the transform is weighted by a continuous matrix weight. The manifold is assumed to be compact and nontrapping of any dimension, and in dimension three and higher we assume a foliation condition. We make no assumption regarding con…

Proposes Gaussian process priors on graph sets with geometric structure.

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …

Although a great methodological effort has been invested in proposing competitive solutions to the class-imbalance problem, little effort has been made in pursuing a theoretical understanding of this matter. In order to shed some light on this topic, we perform, through a novel framework, an exhaustive analysis of the …

A new kernel measures brain network similarities, improving disease classification.

A significant hurdle for analyzing large sample data is the lack of effective statistical computing and inference methods. An emerging powerful approach for analyzing large sample data is subsampling, by which one takes a random subsample from the original full sample and uses it as a surrogate for subsequent computati…

The paper proves cohomology vanishing for a specific type of minimal submanifolds in a weighted Euclidean ball.

We propose using five data-driven community detection approaches from social networks to partition the label space for the task of multi-label classification as an alternative to random partitioning into equal subsets as performed by RAkELd: modularity-maximizing fastgreedy and leading eigenvector, infomap, walktrap an…

Rapid overlay of chemical structures (ROCS) is a standard tool for the calculation of 3D shape and chemical ("color") similarity. ROCS uses unweighted sums to combine many aspects of similarity, yielding parameter-free models for virtual screening. In this report, we decompose the ROCS color force field into "color com…

The classical $k$-means algorithm for partitioning $n$ points in $\mathbb{R}^d$ into $k$ clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications. In this paper, we present an…

The article proposes modified Gower's coefficients for handling mixed type variables in nearest neighbor methods.

This study analyzes global oil trade networks to assess their efficiency and robustness.

Convolutional neural networks (CNN) are widely used for speech emotion recognition (SER). In such cases, the short time fourier transform (STFT) spectrogram is the most popular choice for representing speech, which is fed as input to the CNN. However, the uncertainty principles of the short-time Fourier transform preve…

The aim of this paper is to establish two fundamental measure-metric properties of particular random geometric graphs. We consider $\varepsilon$-neighborhood graphs whose vertices are drawn independently and identically distributed from a common distribution defined on a regular submanifold of $\mathbb{R}^K$. We show t…

The paper proves conditions under which certain geometric structures are rigid.

We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geom…

We introduce a new family of matrix norms, the "local max" norms, generalizing existing methods such as the max norm, the trace norm (nuclear norm), and the weighted or smoothed weighted trace norms, which have been extensively used in the literature as regularizers for matrix reconstruction problems. We show that this…

Let $(X,g)$ be a compact Riemannian stratified space with simple edge singularity. Thus a neighbourhood of the singular stratum is a bundle of truncated cones over a lower dimensional compact smooth manifold. We calculate the various polynomially weighted de Rham cohomology spaces of $X$, as well as the associated spac…

We consider the problem of estimating a low-rank matrix from a noisy observed matrix. Previous work has shown that the optimal method depends crucially on the choice of loss function. In this paper, we use a family of weighted loss functions, which arise naturally for problems such as submatrix denoising, denoising wit…

Benchmarked over 70 graph clustering algorithms.

Proves inequality linking function deviation to gradient norm on compact manifolds.

Based on two classical notions of curvature for curves in general metric spaces, namely the Menger and Haantjes curvatures, we introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional counterparts. These new types of curvature, that apply to weighted and unweighted, d…

Tests assess if predictions are prudent by comparing observations and predictions.

Monte Carlo methods are widely used in particle physics to integrate and sample probability distributions (differential cross sections or decay rates) on multi-dimensional phase spaces. We present a Neural Network (NN) algorithm optimized to perform this task. The algorithm has been applied to several examples of direc…

The Penrose theorem and Hawking's topology theorem are extended to weighted spacetimes.

Stochastic gradient descent optimizes Nyström samples for kernel matrix approximation.

Let $(M,g)$ be a complete non-compact Riemannian manifold together with a function $e^h$, which weights the Hausdorff measures associated to the Riemannian metric. In this work we assume lower or upper radial bounds on some weighted or unweighted curvatures of $M$ to deduce comparisons for the weighted isoperimetric qu…

Adapts Stein's method for geometric inequalities, addressing boundary terms.

New algorithm estimates intrinsic dimension of discrete datasets.

A hierarchical gamma process infinite edge partition model is proposed to factorize the binary adjacency matrix of an unweighted undirected relational network under a Bernoulli-Poisson link. The model describes both homophily and stochastic equivalence, and is scalable to big sparse networks by focusing its computation…

Simplified interactive image segmentation using kNN graphs.

Efficient WKNN-Shapley computation improves data valuation accuracy.

This paper proposes a discrimination technique for vertices in a weighted network. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership information. In particular, we introduce a edge weight distribution matrix to the s…

Combinatorial approach to compute satellite knot invariants using graph theory.

We compute an approximate Fréchet mean for sets of sparse graphs.

Low-rank matrix completion is an important problem with extensive real-world applications. When observations are uniformly sampled from the underlying matrix entries, existing methods all require the matrix to be incoherent. This paper provides the first working method for coherent matrix completion under the standard …

For a particular class of pseudo manifolds, we show that the intersection cohomology groups for any perversity may be naturally represented by extended weighted $L^2$ harmonic forms for a complete metric on the regular stratum with respect to some weight determined by the perversity. Extended weighted $L^2$ harmonic fo…

We investigate the performance of features that can capture nonlinear recurrence dynamics embedded in the speech signal for the task of Speech Emotion Recognition (SER). Reconstruction of the phase space of each speech frame and the computation of its respective Recurrence Plot (RP) reveals complex structures which can…