Reversible random walks on dynamic graphs (Q6063351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Speeding Up Cover Time of Sparse Graphs Using Local Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover time and mixing time of random walks on dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious flooding in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Voter Model in Dynamic Networks / 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: Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks on Randomly Evolving Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flooding Time of Edge-Markovian Evolving Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rumor spreading in random evolving graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crawling on Simple Models of Web Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Voting Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalescing Random Walks and Voting on Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Evolutionary Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Well Do Random Walks Parallelize? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the cover time of multiple random walks / 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: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform coupling of non-homogeneous Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed probabilistic polling and applications to proportionate agreement / 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: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover time in edge-uniform stochastically-evolving graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hitting and cover times of Metropolis walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coalescence time of reversible random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on graphs: new bounds on hitting, meeting, coalescing and returning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of some time inhomogeneous Markov chains via spectral techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging for time inhomogeneous finite Markov chains. I: Singular values and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091254 / rank
 
Normal rank

Revision as of 11:49, 3 August 2024

scientific article; zbMATH DE number 7762026
Language Label Description Also known as
English
Reversible random walks on dynamic graphs
scientific article; zbMATH DE number 7762026

    Statements

    Reversible random walks on dynamic graphs (English)
    0 references
    0 references
    0 references
    7 November 2023
    0 references
    dynamic graph
    0 references
    Markov chain
    0 references
    random walk
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references