Average mixing matrix of trees
From MaRDI portal
Abstract: We investigate the rank of the average mixing matrix of trees, with all eigenvalues distinct. The rank of the average mixing matrix of a tree on vertices with distinct eigenvalues is upper-bounded by . Computations on trees up to vertices suggest that the rank attains this upper bound most of the times. We give an infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound. We also give a lower bound on the rank of the average mixing matrix of a tree.
Recommendations
Cites work
- A new graph product and its spectrum
- A new perspective on the average mixing matrix
- Average mixing of continuous quantum walks
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES
- Para-Krawtchouk polynomials on a bi-lattice and a quantum spin chain with perfect state transfer
- Perfect state transfer on distance-regular graphs and association schemes
- Perfect, efficient, state transfer and its application as a constructive tool
- State transfer on graphs
- Uniform mixing and association schemes
Cited in
(6)- A new perspective on the average mixing matrix
- Mean Row Values in (u, v)-Calkin–Wilf Trees
- scientific article; zbMATH DE number 7731177 (Why is no real title available?)
- Unexpected averages of mixing matrices
- Average mixing in quantum walks of reversible Markov chains
- Selected open problems in continuous-time quantum walks
This page was built for publication: Average mixing matrix of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568088)