The hitting and cover times of Metropolis walks (Q964410): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980467795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time taken by random walks on finite groups to visit every state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum hitting time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo sampling methods using Markov chains and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hitting and cover times of random walks on finite graphs using local degree information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank

Latest revision as of 17:23, 2 July 2024

scientific article
Language Label Description Also known as
English
The hitting and cover times of Metropolis walks
scientific article

    Statements

    The hitting and cover times of Metropolis walks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    Metropolis walks
    0 references
    Metropolis-Hastings algorithm
    0 references
    Markov chain Monte Carlo
    0 references
    random walk Monte Carlo
    0 references
    hitting time
    0 references
    cover time
    0 references
    0 references