The logarithmic Sobolev constant of the lamplighter (Q1933623): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: François Blanchard / rank | |||
Property / author | |||
Property / author: Nathael Gozlan / rank | |||
Property / author | |||
Property / author: Bernard Host / rank | |||
Property / author | |||
Property / author: Mathieu Meyer / rank | |||
Property / author | |||
Property / author: François Blanchard / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Nathael Gozlan / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bernard Host / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Mathieu Meyer / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1990130386 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1011.1764 / rank | |||
Normal rank |
Latest revision as of 23:56, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The logarithmic Sobolev constant of the lamplighter |
scientific article |
Statements
The logarithmic Sobolev constant of the lamplighter (English)
0 references
24 January 2013
0 references
A lamplighter graph \(G^*\) is constructed from a finite graph \(G=(V, E)\) with \(n\) vertices by associating with each vertex \(x\) in \(V\) a lamp that can be on or off as specified by a binary \(n\)-sequence \(s\). The vertex set of \(G^*\) consists of all pairs \((s, x)\) of sequences and vertices in \(G\). Any two such pairs \((s, x)\) and \((s^*, x^*)\) are adjacent in \(G^*\) if either (1) \(s=s^*\) and \(x\) is adjacent to \(x^*\) or (2) \(s(y)=s^*(y)\) for all \(y\) different from \(x\) and \(x=x^*\). For a random walk in \(G\) by a lamplighter, the first case corresponds to a move from \(x\) to \(x^*\) without changing any lights, and the second case corresponds to staying at \(x\) and randomly possibly changing the light only at that site \(x\). The convergence properties of the random walk and the lighting processes are studied by estimating the logarithmic Sobolev constant of \(G^*\). The results are illustrated by considering the torus, the regular tree, the complete graph and the hypercube.
0 references
logarithmic-Sobolev inequalities
0 references
wreath-product
0 references
lamplighter graph
0 references
spectral gap logarithmic-Sobolev inequalities
0 references