Pages that link to "Item:Q1094756"
From MaRDI portal
The following pages link to Strong uniform times and finite random walks (Q1094756):
Displayed 38 items.
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429) (← links)
- Efficient Markovian couplings: Examples and counterexamples (Q811755) (← links)
- Cut-off for \(n\)-tuples of exponentially converging processes (Q855687) (← links)
- Convergence rates in strong ergodicity for Markov processes (Q860709) (← links)
- Cut-off and exit from metastability: Two sides of the same coin (Q931820) (← links)
- Separation cut-offs for birth and death chains (Q997420) (← links)
- Probabilistic models of genome shuffling (Q1111971) (← links)
- On coupling and the approximation of the permanent (Q1115170) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- Choosing a random spanning subtree: A case study (Q1181414) (← links)
- Relaxation of product Markov chains on product spaces (Q1273731) (← links)
- An interruptible algorithm for perfect sampling via Markov chains (Q1296621) (← links)
- Two convergence properties of hybrid samplers (Q1296738) (← links)
- Norm convergence of random walks on compact hypergroups (Q1323454) (← links)
- On distributionally regenerative processes (Q1337945) (← links)
- Precise estimates on the rate at which certain diffusions tend to equilibrium (Q1346317) (← links)
- Random induced subgraphs of generalized \(n\)-cubes (Q1373443) (← links)
- Rates of convergence for lamplighter processes (Q1382541) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- Random subgraphs of Cayley graphs over \(p\)-groups (Q1590219) (← links)
- Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases (Q1824375) (← links)
- Rapidly mixing random walks and bounds on characters of the symmetric group (Q1862995) (← links)
- On the rate of mixing for \(p\)-shuffles. (Q1872491) (← links)
- Efficient Markovian couplings: Examples and counterexamples. (Q1884821) (← links)
- Strong memoryless times and rare events in Markov renewal point processes. (Q1889787) (← links)
- The nearest neighbor random walk on subspaces of a vector space and rate of convergence (Q1890740) (← links)
- An exact formula for the move-to-front rule for self-organizing lists (Q1908208) (← links)
- The cut-off phenomenon for random reflections. II: Complex and quaternionic cases (Q1908544) (← links)
- The cut-off phenomenon for random reflections (Q1922068) (← links)
- Logarithmic Sobolev inequalities for finite Markov chains (Q2564686) (← links)
- Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration (Q3157863) (← links)
- Examples for the Theory of Strong Stationary Duality with Countable State Spaces (Q3415964) (← links)
- Time to Stationarity for a Continuous-Time Markov Chain (Q3415997) (← links)
- Spectral Analysis, without Eigenvectors, for Markov Chains (Q3416003) (← links)
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains (Q4289296) (← links)
- The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms (Q4950714) (← links)
- Efficient Simulation via Coupling (Q5485361) (← links)
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes (Q5936463) (← links)