Geometric bounds on the fastest mixing Markov chain (Q6193769): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129148458, #quickstatements; #temporary_batch_1728077456503
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Fastest mixing Markov chain problem for the union of two cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic isoperimetric inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twice-Ramanujan Sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trailing the dovetail shuffle to its lair / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_{\infty}\), vertex isoperimetry and concentration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Analysis of Reversible Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Markov Chain on Graphs with Symmetries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Markov Chain on a Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Markov Chain on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions / 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: Counting Weighted Independent Sets beyond the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Perfect Matchings and the Switch Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison inequalities and fastest-mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Rumor Spreading with Vertex Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between isoperimetry and spectral gap for finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5062016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding fastest mixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moments of first hitting times for birth-death processes on trees / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129148458 / rank
 
Normal rank

Latest revision as of 00:25, 5 October 2024

scientific article; zbMATH DE number 7819900
Language Label Description Also known as
English
Geometric bounds on the fastest mixing Markov chain
scientific article; zbMATH DE number 7819900

    Statements

    Geometric bounds on the fastest mixing Markov chain (English)
    0 references
    19 March 2024
    0 references
    mixing time
    0 references
    random walks
    0 references
    conductance
    0 references
    fastest mixing Markov chain
    0 references
    0 references
    0 references

    Identifiers

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