Concentration of hitting times in Erdős-Rényi graphs
From MaRDI portal
Publication:6606320
Recommendations
- A central limit theorem for the mean starting hitting time for a random walk on a random graph
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
- Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
- Random walks on the random graph
Cites work
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- A central limit theorem for the mean starting hitting time for a random walk on a random graph
- Diameters of Random Graphs
- Entrywise bounds for eigenvectors of random graphs
- First-passage properties of the Erdos–Renyi random graph
- Fractals in probability and analysis
- Hitting and commute times in large random neighborhood graphs
- Hitting times, commute times, and cover times for random walks on random hypergraphs
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- On quantitative convergence to quasi-stationarity
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
- The diameter of sparse random graphs
- The eigenvalues of random symmetric matrices
- Über stochastische Asymptoten und Grenzwerte.
This page was built for publication: Concentration of hitting times in Erdős-Rényi graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606320)
