Related papers: Geometry of rank tests

Motivated by population studies of Diffusion Tensor Imaging, the paper investigates the use of mean-based and dispersion-based permutation tests to define and compute the significance of a statistical test for data taking values on…

We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

We classify all non-degenerate skew-hermitian forms defined over certain local rings, not necessarily commutative, and study some of the fundamental properties of the associated unitary groups, including their orders when the ring in…

Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections,…

Given two networks of differing sizes, it is of interest to test whether the two networks belong to the same distribution. We formalize the notion of "equality of distribution" under the framework of the generalized random dot product…

In computational anatomy, the statistical analysis of temporal deformations and inter-subject variability relies on shape registration. However, the numerical integration and optimization required in diffeomorphic registration often lead to…

This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…

For a class of integral operators with kernels metric functions on manifold we find some necessary and sufficient conditions to have finite rank. The problem we pose has a stochastic nature and boils down to the following alternative…

Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

In statistics permutations typically arise in the context of rank plots for two-dimensional data. Such plots can also be interpreted as discrete copulas. In discrete mathematics, typically in the context of the description of large…

Let $X=G/K$ be a higher rank symmetric space of non-compact type, where $G$ is the connected component of the isometry group of $X$. We define the splitting rank of $X$, denoted by $\text{srk}(X)$, to be the maximal dimension of a totally…

We study Riemannian manifolds carrying a metric connection with parallel, skew-symmetric and closed torsion, which we call in short PSCT manifolds. We prove that PSCT manifolds always locally split into a product of well-understood factors,…

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

A method for improving the efficiency of graph isomorphism testing is presented. The method uses the structure of the graph colored by vertex hash codes as a means of partitioning vertices into equivalence classes, which in turn reduces the…

Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…