Strong uniform times and finite random walks (Q1094756): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105583541, #quickstatements; #temporary_batch_1705791795597
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0196-8858(87)90006-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086490380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3660628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffling Cards and Stopping Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a random permutation with random transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal coupling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal coupling for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4150892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convolution semigroups of probability measures on Gelfand pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks on A 600-Cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on a dodecahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Rates for a Random Walk on the Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coupling of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficients of ergodicity: structure and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4126536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Flights on Regular Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random flights on regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal and distributional coupling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom Shuffling with Applications to the Game of Faro / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:21, 18 June 2024

scientific article
Language Label Description Also known as
English
Strong uniform times and finite random walks
scientific article

    Statements

    Strong uniform times and finite random walks (English)
    0 references
    0 references
    0 references
    1987
    0 references
    This paper is concerned with obtaining bounds for the rate of convergence to the stationary distribution for finite Markov chains \(\{X_ n,n\geq 0\}\) having strong symmetry properties for the transition matrices. The use of strong uniform times to bound separation distance is emphasized, the strong uniform time T being a randomized stopping time such that \(P(X_ k=i| T=k)=\pi (i)\) for all \(0\leq k<\infty\) and i, \(\pi\) being the stationary distribution. It is shown that a strong uniform time T always exists and that, if \(\pi_ n\) is the distribution of \(X_ n\), the separation distance \(\max_{i}(1-\pi_ n(i)/\pi (i))\leq P(T>n)\), \(n\geq 0\). This methodology is related to coupling and Fourier analysis procedures. Various examples for random walks on groups are given to illustrate the results.
    0 references
    bounds for the rate of convergence to the stationary distribution
    0 references
    strong symmetry properties
    0 references
    randomized stopping time
    0 references
    coupling
    0 references
    Fourier analysis procedures
    0 references

    Identifiers