arXiv (All)
open access
Moment Methods for Uniform Average Mixing on Strongly Regular Graphs
We study continuous-time quantum walks on connected strongly regular graphs that are not complete, observed at a random time drawn from a freely chosen probability law. Uniform average mixing (UAM) asks for a law under which every averaged transition probability equals $1/n$, where $n$ is the number
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Approximating Random Walks in $\widetilde{O}(\log n + \log^2 κ)$ Space for $κ$-Conditioned Graphs#1215882
- Mixing Times of Switch Chains via High-Dimensional Expansion#1233545
- Sharpness of the percolation phase transition for weighted random connection models#1298032
- On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graphs#290500
- Spectral Duality and Reset-Neutral Distributions in Random Walks with Multi-Site Geometric Resetting#1233833
Record · ID 1234384
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive