Cover times, blanket times, and majorizing measures (Q431644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C81 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60J55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60G15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6051273 / rank
 
Normal rank
Property / zbMATH Keywords
 
commute times
Property / zbMATH Keywords: commute times / rank
 
Normal rank
Property / zbMATH Keywords
 
cover times
Property / zbMATH Keywords: cover times / rank
 
Normal rank
Property / zbMATH Keywords
 
Dynkin isomorphism
Property / zbMATH Keywords: Dynkin isomorphism / rank
 
Normal rank
Property / zbMATH Keywords
 
effective resistance
Property / zbMATH Keywords: effective resistance / rank
 
Normal rank
Property / zbMATH Keywords
 
Gaussian free field
Property / zbMATH Keywords: Gaussian free field / rank
 
Normal rank
Property / zbMATH Keywords
 
majorizing measures
Property / zbMATH Keywords: majorizing measures / rank
 
Normal rank
Property / zbMATH Keywords
 
random walks
Property / zbMATH Keywords: random walks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019415463 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1004.4371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability approximations via the Poisson clumping heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains with almost exponential hitting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk covering of some special trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold limits for cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of the Cover Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff's theorem in the branching random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the cover time / 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: The cover time of the giant component of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover times for Brownian motion and random walks in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sizes of compact subsets of Hilbert space and continuity of Gaussian processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian and non-Gaussian random fields associated with Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4854294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ray-Knight theorem for symmetric Markov processes. / 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: A tight upper bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Régularité de processus gaussiens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4096185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of planar graphs / 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: Random Walks and A Sojourn Density Process of Brownian Motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks, capacity and percolation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability on Trees and Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample path properties of the local times of strongly symmetric Markov processes via Gaussian processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2738724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Processes, Gaussian Processes, and Local Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn times of diffusion processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity of Gaussian processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majorizing measures: The generic chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majorizing measures without measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generic Chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Lower Bounding the Cover Time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Cover times, blanket times, and majorizing measures
scientific article

    Statements

    Cover times, blanket times, and majorizing measures (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2012
    0 references
    commute times
    0 references
    cover times
    0 references
    Dynkin isomorphism
    0 references
    effective resistance
    0 references
    Gaussian free field
    0 references
    majorizing measures
    0 references
    random walks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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