Related papers: Distances between Random Orthogonal Matrices and I…

Suppose $\alpha, \beta$ are Lipschitz strongly concave functions from $[0, 1]$ to $\mathbb{R}$ and $\gamma$ is a concave function from $[0, 1]$ to $\mathbb{R}$, such that $\alpha(0) = \gamma(0) = 0$, and $\alpha(1) = \beta(0) = 0$ and…

Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

Let $M$ be an $n\times n$ random i.i.d. matrix. This paper studies the deviation inequality of $s_{n-k+1}(M)$, the $k$-th smallest singular value of $M$. In particular, when the entries of $M$ are subgaussian, we show that for any…

We introduce two spectral invariants of finite metric spaces, the $q$-spectrum and the transition $q$-spectrum, defined from similarity matrices. These invariants extend the adjacency and Laplacian spectra of graphs to general finite metric…

Let $G$ be a connected graph with vertex set $V(G)$, and denote by $d_G(u,v)$ the distance from $u$ to $v$ in $G$, for any $u,v \in V(G)$. The average distance of an $n$-vertex connected graph $G$, denoted by $\mu(G)$, is defined to be the…

We study $N \times N$ random band matrices $H = (H_{xy})$ with mean-zero complex Gaussian entries, where $x,y$ lie on the discrete torus $(\mathbb{Z} / \sqrt[d]{N} \mathbb{Z})^d$ in dimensions $d \ge 3$. The variance profile satisfies…

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…

Let $n$, $s$ and $k$ be positive integers. For distinct $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a circle. So \[ ||i,j||_n=\min\{(i-j)\bmod…

Mixtures of high dimensional Gaussian distributions have been studied extensively in statistics and learning theory. While the total variation distance appears naturally in the sample complexity of distribution learning, it is analytically…

We prove a moderate deviation principle for the capacity of the range of random walk in $\mathbb{Z}^5$. Depending on the scale of deviation, we get two different regimes. We observe Gaussian tails when the deviation scale is smaller than…

We show that the Subgroup distance problem regarding the Hamming distance, the Cayley distance and the $l_\infty$ distance is NP-complete when the input group is cyclic. When we restrict the $l_\infty$ distance to fixed values we show that…

In this article we consider Wigner matrices $X_N$ with variance profiles (also called Wigner-type matrices) which are of the form $X_N(i,j) = \sigma(i/N,j/N) a_{i,j} / \sqrt{N}$ where $\sigma$ is a symmetric real positive function of…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

Consider the Quadratic Assignment Problem (QAP): given two matrices A and D, minimize {trace AXDX^T: X is a permutation matrix}. New lower bounds were obtained recently (Mittelmann and peng [8]) for the QAP where D is either the Manhattan…

Let $${\mathcal K}_n := \left\{p_n: p_n(z) = \sum_{k=0}^n{a_k z^k}, \enspace a_k \in {\mathbb C}\,,\enspace |a_k| = 1 \right\}\,.$$ A sequence $(P_n)$ of polynomials $P_n \in {\mathcal K}_n$ is called ultraflat if $(n +…

Let $\Gamma$ be a countable group acting on a geodesic Gromov-hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ whose support generates a non-elementary subsemigroup. Under the assumption that $\mu$ has a finite…

We consider a conditionally Poissonian random graph model where the mean degrees, `capacities', follow a power-tailed distribution with finite mean and infinite variance. Such a graph of size $N$ has a giant component which is super-small…

The cutoff phenomenon describes the case when an abrupt transition occurs in the convergence of a Markov chain to its equilibrium measure. There are various metrics which can be used to measure the distance to equilibrium, each of which…