A discrete random walk on the hypercube
From MaRDI portal
Recommendations
Cites work
- Augmented \(k\)-ary \(n\)-cubes
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- Counting spanning trees in prism and anti-prism graphs
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
- scientific article; zbMATH DE number 1590945 (Why is no real title available?)
- scientific article; zbMATH DE number 3163289 (Why is no real title available?)
- scientific article; zbMATH DE number 5081587 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 742629 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- Mean trapping time for an arbitrary node on regular hyperbranched polymers
- On the time taken by random walks on finite groups to visit every state
- Pinning chaotic synchronization in complex networks on maximum eigenvalue of low order matrix
- Random walks on dual Sierpinski gaskets
- Random Walks on Infinite Graphs and Groups - a Survey on Selected topics
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
- Symmetric Random Walks on Groups
- The electrical resistance of a graph captures its commute and cover times
- The Kirchhoff index of hypercubes and related complex networks
- The Mobius cubes
- Tight bounds for the cover time of multiple random walks
Cited in
(8)- On the domination of a random walk on a discrete cylinder by random interlacements
- Cutoff for a stratified random walk on the hypercube
- A class of random walks on the hypercube
- Clifford-algebraic random walks on the hypercube
- The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
- Exact solution for a class of random walk on the hypercube
- The Normalized Laplacian Spectrum of Folded Hypercube with Applications
- Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network
This page was built for publication: A discrete random walk on the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2150085)