Pages that link to "Item:Q1099468"
From MaRDI portal
The following pages link to Covering problems for Brownian motion on spheres (Q1099468):
Displayed 32 items.
- The cover times of random walks on random uniform hypergraphs (Q392193) (← links)
- Effective resistances for supercritical percolation clusters in boxes (Q500798) (← links)
- The subleading order of two dimensional cover times (Q510273) (← links)
- Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\) (Q525104) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← links)
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs (Q898134) (← links)
- Random walks on highly symmetric graphs (Q923511) (← links)
- Some sample path properties of a random walk on the cube (Q1119275) (← links)
- On the time to traverse all edges of a graph (Q1178251) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
- High host density favors greater virulence: a model of parasite-host dynamics based on multi-type branching processes (Q1949310) (← links)
- Noise stability of weighted majority (Q1983068) (← links)
- Cover times for sequences of reversible Markov chains on random graphs (Q2258610) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- Extremal points of high-dimensional random walks and mixing times of a Brownian motion on the sphere (Q2438256) (← links)
- The Cover Time of Cartesian Product Graphs (Q3000524) (← links)
- Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (Q3176187) (← links)
- Sampling Hypersurfaces through Diffusion (Q3541818) (← links)
- On mixing times for stratified walks on thed-cube (Q4543635) (← links)
- A tight lower bound on the cover time for random walks on graphs (Q4845080) (← links)
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times (Q4978297) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Out-of-equilibrium random walks (Q5005034) (← links)
- Extremal hitting times of trees with some given parameters (Q5089351) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Many Random Walks Are Faster Than One (Q5199503) (← links)
- On the Cover Time of Dense Graphs (Q5232158) (← links)
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (Q5256387) (← links)
- Cover Times and Generic Chaining (Q5416554) (← links)