MétaCan
Menu
Back to cohort
Record W3027437889 · doi:10.1112/blms.12657

Stochastic approximation of lamplighter metrics

2022· article· en· W3027437889 on OpenAlexafffund
Florent P. Baudier, Pavlos Motakis, Thomas Schlumprecht, András Zsák

Bibliographic record

VenueBulletin of the London Mathematical Society · 2022
Typearticle
Languageen
FieldComputer Science
TopicComputational Geometry and Mesh Generation
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of CanadaNational Science Foundation
KeywordsMathematicsMetric spaceLipschitz continuityEmbeddingMetric (unit)CombinatoricsDistortion (music)Upper and lower boundsDiscrete mathematicsPure mathematicsMathematical analysisComputer science

Abstract

fetched live from OpenAlex

We observe that embeddings into random metrics can be fruitfully used to study the L 1 $L_1$ -embeddability of lamplighter graphs or groups, and more generally lamplighter metric spaces. Once this connection has been established, several new upper bound estimates on the L 1 $L_1$ -distortion of lamplighter metrics follow from known related estimates about stochastic embeddings into dominating tree-metrics. For instance, every lamplighter metric on an n $n$ -point metric space embeds bi-Lipschitzly into L 1 $L_1$ with distortion O ( log n ) $O(\log n)$ . In particular, for every finite group G $G$ the lamplighter group H = Z 2 ≀ G $H=\mathbb {Z}_2\wr G$ bi-Lipschitzly embeds into L 1 $L_1$ with distortion O ( log log | H | ) $O(\log \log |H|)$ . In the case where the ground space in the lamplighter construction is a graph with some topological restrictions, better distortion estimates can be achieved. Finally, we discuss how a coarse embedding into L 1 $L_1$ of the lamplighter group over the d $d$ -dimensional infinite lattice Z d $\mathbb {Z}^d$ can be constructed from bi-Lipschitz embeddings of the lamplighter graphs over finite d $d$ -dimensional grids, and we include a remark on Lipschitz free spaces over finite metric spaces.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.782
Threshold uncertainty score0.312

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.015
GPT teacher head0.224
Teacher spread0.209 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueBulletin of the London Mathematical SocietySame topicComputational Geometry and Mesh GenerationFrench-language works237,207