Related papers: Eigenvectors for a random walk on a hyperplane arr…
The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…
We consider random walks on the surface of the sphere $S_{n-1}$ ($n \geq 2$) of the $n$-dimensional Euclidean space $E_n$, in short a hypersphere. By solving the diffusion equation in $S_{n-1}$ we show that the usual law $<r^2 > \varpropto…
In analyzing a simple random walk on the Heisenberg group we encounter the problem of bounding the extreme eigenvalues of an $n\times n$ matrix of the form $M=C+D$ where $C$ is a circulant and $D$ a diagonal matrix. The discrete…
We study eigenvectors in the deformed Gaussian unitary ensemble of random matrices $H=W\tilde{H}W$, where $\tilde{H}$ is a random matrix from Gaussian unitary ensemble and $W$ is a deterministic diagonal matrix with positive entries. Using…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained.…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between…
A generalized Wigner matrix perturbed by a finite-rank deterministic matrix is considered. The fluctuations of the largest eigenvalues, which emerge outside the bulk of the spectrum, and the corresponding eigenvectors, are studied. Under…
L\'evy walk process is one of the most effective models to describe superdiffusion, which underlies some important movement patterns and has been widely observed in the micro and macro dynamics. From the perspective of random walk theory,…
Generalized eigenfunctions may be regarded as vectors of a basis in a particular direct integral of Hilbert spaces or as elements of the antidual space $\Phi^\times$ in a convenient Gelfand triplet…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…
We study the angles between the eigenvectors of a random $n\times n$ complex matrix $M$ with density $\propto \mathrm{e}^{-n\operatorname{Tr}V(M^*M)}$ and $x\mapsto V(x^2)$ convex. We prove that for unit eigenvectors…
We introduce a persistent random walk model with finite velocity and self-reinforcing directionality, which explains how exponentially distributed runs self-organize into truncated L\'evy walks observed in active intracellular transport by…
Geometrically, the eigenvectors of a square matrix $\mathbf{A}$ are not rotated by $\mathbf{A}$. Here we consider vectors that are rotated $\pi/2$ by $\mathbf{A}$; that is, vectors orthogonal to their images. We call these vectors…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…
We study the eigenvalues and the eigenvectors of $N\times N$ structured random matrices of the form $H = W\tilde{H}W+D$ with diagonal matrices $D$ and $W$ and $\tilde{H}$ from the Gaussian Unitary Ensemble. Using the supersymmetry technique…
We define a class of random matrix ensembles that pertain to random looped polymers. Such random looped polymers are a possible model for bio-polymers such as chromatin in the cell nucleus. It is shown that the distribution of the largest…