Related papers: Cokernel statistics for walk matrices of directed …

We consider n-by-n matrices whose (i, j)-th entry is f(X_i^T X_j), where X_1, ...,X_n are i.i.d. standard Gaussian random vectors in R^p, and f is a real-valued function. The eigenvalue distribution of these random kernel matrices is…

Let $W(D_n)$ denote the walk matrix of the Dynkin graph $D_n$, a tree obtained from the path of order $n-1$ by adding a pendant edge at the second vertex. We prove that $\text{rank}\,W(D_n)=n-2$ if $4\mid n$ and $\text{rank}\,W(D_n)=n-1$…

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…

In this paper, we study the combinatorial relations between the cokernels $\text{cok}(A_n+px_iI_n)$ ($1 \le i \le m$) where $A_n$ is an $n \times n$ matrix over the ring of $p$-adic integers $\mathbb{Z}_p$, $I_n$ is the $n \times n$…

The paper gives an overview of recent advances in structural equation modeling. A structural equation model is a multivariate statistical model that is determined by a mixed graph, also known as a path diagram. Our focus is on the…

We study the limiting spectral distribution of sample covariance matrices $XX^T$, where $X$ are $p\times n$ random matrices with correlated entries, for the cases $p/n\to y\in [0,\infty)$. If $y>0$, we obtain the Mar\v{c}enko-Pastur…

A matrix random walk is a stochastic process of the form $B_k = (I+A_1)\cdots(I+A_k)$ where $A_j$ are independent ``step'' matrices in $\mathrm{M}_N(\mathbb{C})$. With the right entry-covariance, a rescaled matrix random walk converges to…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted graph with marked "in" and "out" vertices. Suppose a random walker begins at the in-vertex, steps to neighbors of vertices with…

In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.

Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…

Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains…

We study tree-indexed random walks as introduced by Benjamini, H\"aggstr\"om, and Mossel, i.e. labelings of a tree for which adjacent vertices have labels differing by 1. It is a conjecture of those authors that the distribution of the…

We investigate the fluctuations of linear spectral statistics of a Wigner matrix $W\_N$ deformed by a deterministic diagonal perturbation $D\_N$, around a deterministic equivalent which can be expressed in terms of the free convolution…

For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…

We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…

Bessel-type convolution algebras of bounded Borel measures on the matrix cones of positive semidefinite $q\times q$-matrices over $\mathbb R, \mathbb C, \mathbb H$ were introduced recently by R\"osler. These convolutions depend on some…

We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…

Graphs and networks are common ways of depicting biological information. In biology, many different biological processes are represented by graphs, such as regulatory networks, metabolic pathways and protein--protein interaction networks.…