Harmonic maps on amenable groups and a diffusive lower bound for random walks (Q378807): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3102493546 / rank | |||
Normal rank |
Latest revision as of 08:32, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Harmonic maps on amenable groups and a diffusive lower bound for random walks |
scientific article |
Statements
Harmonic maps on amenable groups and a diffusive lower bound for random walks (English)
0 references
12 November 2013
0 references
Consider an infinite connected \(d\)-regular graph \(G\), having a transitive automorphism group \(\Gamma\), which is moreover amenable, in the sense that there exists a sequence \((S_j)\) of finite subsets of \(G\) such that \(|\partial S_j|= \sigma(|S_j|)\). Let \((X_t)\) denote the symmetric simple random walk on \(G\). The authors prove the following, which extends a result by A. Erschler (valid for \(G\) being moreover a Cayley graph). Theorem: (i) \(\mathbb{E}(d(X_0,X_t)^2)\geq t/d\) for any \(t\in\mathbb{N}\); (ii) \(\mathbb{E}(d(X_0,X_t))\geq C\sqrt{t/d}\) for a universal \(C>0\) and for \(t\geq d\); (iii) \({1\over t} \sum^t_{s=1} \mathbb{P}(d(X_0, X_s)\leq \varepsilon\sqrt{t/d})\leq C'\varepsilon\) for a universal \(C'\) and any \(\varepsilon> 0\) and \(t\geq\max\{d,\varepsilon^{-2}\}\). They also prove a version for finite graphs which holds up to the relaxation time of \((X_t)\). Their proof is based on the existence of a non-constant equivariant harmonic map \(\Psi\) on \(G\): they indeed establish the following. Theorem: There exist a Hilbert space \(H\) on which \(\Gamma\) acts by isometries and a non-constant \(\Psi:G\to H\) such that: (i) \(\gamma\cdot\Psi(g)= \Psi(\gamma\cdot g)\) for any \(\gamma\in\Gamma\) and \(g\in G\); (ii) \(P\psi=\Psi\), where \(P\) is the transition matrix of \((X_t)\).
0 references
random walks on graphs
0 references
rate of escape
0 references
harmonic maps
0 references
0 references