Covering problems for Brownian motion on spheres
From MaRDI portal
Publication:1099468
DOI10.1214/aop/1176991894zbMath0638.60014OpenAlexW1986507557MaRDI QIDQ1099468
Publication date: 1988
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176991894
Inequalities; stochastic orderings (60E15) Geometric probability and stochastic geometry (60D05) Brownian motion (60J65) Sample path properties (60G17) Diffusion processes and stochastic analysis on manifolds (58J65)
Related Items
Some further results on the maximal hitting times of trees with some given parameters, On the cover time and mixing time of random geometric graphs, Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time, On mixing times for stratified walks on thed-cube, Some sample path properties of a random walk on the cube, Extremal hitting times of trees with some given parameters, A Spectral Approach to Network Design, The electrical resistance of a graph captures its commute and cover times, Collecting coupons on trees, and the cover time of random walks, A tight lower bound on the cover time for random walks on graphs, The cover times of random walks on random uniform hypergraphs, A collection of results concerning electric resistance and simple random walk on distance-regular graphs, High host density favors greater virulence: a model of parasite-host dynamics based on multi-type branching processes, Extremal points of high-dimensional random walks and mixing times of a Brownian motion on the sphere, Random walks on highly symmetric graphs, Graph Clustering using Effective Resistance, Sampling Hypersurfaces through Diffusion, On the time to traverse all edges of a graph, The Cover Time of Cartesian Product Graphs, Noise stability of weighted majority, Effective resistances for supercritical percolation clusters in boxes, The subleading order of two dimensional cover times, Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\), Cover Times and Generic Chaining, Cover times for sequences of reversible Markov chains on random graphs, Tight bounds for the cover time of multiple random walks, Many Random Walks Are Faster Than One, Chung-Yau Invariants and Graphs with Symmetric Hitting Times, On the Cover Time of Dense Graphs, Does adding more agents make a difference? A case study of cover time for the rotor-router, Out-of-equilibrium random walks, Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
