Related papers: The first eigenvector of a distance matrix is near…

Let $(X,d)$ be a compact metric space. We consider the behavior of probability measures $\mu$ with the property that $$ \int_{X} d(x, y) d\mu(y) \qquad \mbox{is independent of}~x \in X.$$ It appears that such measures, when they exist,…

Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…

In this article we consider products of real random matrices with fixed size. Let $A_1,A_2, \dots $ be i.i.d $k \times k$ real matrices, whose entries are independent and identically distributed from probability measure $\mu$. Let $X_n =…

Let $X_1,\dots, X_n,\dots$ be i.i.d.\ $d$-dimensional random vectors with common distribution $F$. Then $S_n = X_1+\dots+X_n$ has distribution $F^n$ (degree is understood in the sense of convolution). Let $$ \rho_{\mathcal{C}_d}(F,G) =…

Let $k$ be a field and $n,a,b$ natural numbers. A matrix pencil $P$ is given by $n$ matrices of the same size with coefficients in $k$, say by $(b\times a)$-matrices, or, equivalently, by $n$ linear transformations $\alpha_i\:k^a \to k^b$…

The Perron-Frobenius theorem says that the spectral radius of an irreducible nonnegative tensor is the unique positive eigenvalue corresponding to a positive eigenvector. With this in mind, the purpose of this paper is to find the spectral…

The saddle point matrices arising from many scientific computing fields have block structure $ W= \left(\begin{array}{cc} A & B\\ B^T & C \end{array} \right) $, where the sub-block $A$ is symmetric and positive definite, and $C$ is…

Let $G$ be a connected graph with vertex set $V(G)=\{v_{1},v_{2},...,v_{n}\}$. The distance matrix $D(G)=(d_{ij})_{n\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$…

Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between vertices $i$ and $j$ in $G$. We set $d_{ii}=0$ for every vertex $i$ in $G$. The squared distance matrix $\Delta(G)$ of $G$ is the $n\times…

We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…

We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix eigenvalues. These notions are particularly…

We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper. Our main result, Theorem 4, shows(together with Corollary 3) that if distance is measured by the electric resistance…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

Let $\mathcal{A}(H)$ be the adjacency tensor of $r$-uniform hypergraph $H$. If $H$ is connected, the unique positive eigenvector $x=(x_1,x_2,\ldots,x_n)^{\mathrm{T}}$ with $||x||_r=1$ corresponding to spectral radius $\rho(H)$ is called the…

In this paper, we shall investigate the almost sure limits of the largest and smallest eigenvalues of a quaternion sample covariance matrix. Suppose that $\mathbf X_n$ is a $p\times n$ matrix whose elements are independent quaternion…

We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $u$ and $v$ are connected with probability asymptotic to $\frac{\beta}{\|u-v\|^{2d}}$ for $\|u-v\|_\infty\geq 2$ and with probability 1 for $\|u-v\|_\infty=1$,…

Viviani's theorem states that the sum of distances from any point inside an equilateral triangle to its sides is constant. We consider extensions of the theorem and show that any convex polygon can be divided into parallel segments such…

Given a graph $G$, the exponential distance matrix is defined entry-wise by letting the $(u,v)$-entry be $q^{\text{dist}(u,v)}$, where $\text{dist}(u,v)$ is the distance between the vertices $u$ and $v$ with the convention that if vertices…

The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…