Random Lie bracket on sl2(Fp)

ABSTRACT We study a random walk on the Lie algebra where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we analyze the limiting distribution of the random walk and the speed at which it converges to this distribution. These questions reduce to the study of a random walk on a cyclic group. We show that, with high probability, the walk exhibits a pre‐cutoff phenomenon after roughly steps. Notably, the limiting distribution need not be uniform, and it depends on the prime divisors of . Furthermore, we prove that by incorporating a simple random twist into the walk, we can embed a well‐known affine random walk on into the modified random Lie bracket, allowing us to show that the entire Lie algebra is covered in roughly steps in the generic case.

Authors

Institutions

Publication Details

Journal
Random Structures and Algorithms
Published
2026-01-01
DOI
https://doi.org/10.1002/rsa.70042
Primary Topic
Random Matrices and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Random Lie bracket on sl2(Fp)

Urban Jezernik, Matevž Miščič
Random Structures and Algorithms
Random Matrices and Applications
article

Random Lie bracket on sl2(Fp)

Urban Jezernik, Matevž Miščič
article en

Abstract

ABSTRACT We study a random walk on the Lie algebra where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we analyze the limiting distribution of the random walk and the speed at which it converges to this distribution. These questions reduce to the study of a random walk on a cyclic group. We show that, with high probability, the walk exhibits a pre‐cutoff phenomenon after roughly steps. Notably, the limiting distribution need not be uniform, and it depends on the prime divisors of . Furthermore, we prove that by incorporating a simple random twist into the walk, we can embed a well‐known affine random walk on into the modified random Lie bracket, allowing us to show that the entire Lie algebra is covered in roughly steps in the generic case.

Random Structures and AlgorithmsVol. 68(1)
Institute of Mathematics, Physics, and Mechanics (SI)
Openalex Percentile: Top 96%
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.