Limit law for the cover time of a random walk on a binary tree (Q2041823): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Extremes of local times for simple random walks on symmetric trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence in law of the minimum of a branching random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold limits for cover 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: The subleading order of two dimensional cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier estimates for a critical Galton-Watson process and the cover time of the binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightness for the cover time of the two dimensional sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure change in multitype branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extrema of the Two-Dimensional Discrete Gaussian Free Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian Processes on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of solutions of the Kolmogorov equation to travelling waves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence in law of the maximum of nonlattice branching random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightness for a family of recursion equations / 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: Late points for random walks in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover times, blanket times, and majorizing measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp estimate for cover times on binary trees / 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: Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derrida’s Random Energy Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conditional limit theorem for the frontier of a branching Brownian motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover Times and Generic Chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the DPRZ theorem for 2d cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in occupation times and Gaussian free fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4641993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential concentration of cover times / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162550986 / rank
 
Normal rank

Latest revision as of 10:29, 30 July 2024

scientific article
Language Label Description Also known as
English
Limit law for the cover time of a random walk on a binary tree
scientific article

    Statements

    Limit law for the cover time of a random walk on a binary tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 July 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    barrier estimates
    0 references
    binary tree
    0 references
    cover time
    0 references
    0 references
    0 references
    0 references