A Variational Framework for the RLGL Algorithm

Computing the stationary distribution π of a large, irreducible Markov chain with transition matrix P is a fundamental task in applied mathematics and computer science [4]. Solving the eigenvalue problem π = πP is typically intractable for direct solvers in large dimensions, leaving iterative methods as the only viable option [7].

Authors

Institutions

Publication Details

Journal
ACM SIGMETRICS Performance Evaluation Review
Published
2026-03-31
DOI
https://doi.org/10.1145/3797823.3797860
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Variational Framework for the RLGL Algorithm

Lorenzo Gregoris, Nelly Litvak, Konstantin Avrachenkov
ACM SIGMETRICS Performance Evaluation Review
Markov Chains and Monte Carlo Methods
article

A Variational Framework for the RLGL Algorithm

Lorenzo Gregoris, Nelly Litvak, Konstantin Avrachenkov
article en

Abstract

Computing the stationary distribution π of a large, irreducible Markov chain with transition matrix P is a fundamental task in applied mathematics and computer science [4]. Solving the eigenvalue problem π = πP is typically intractable for direct solvers in large dimensions, leaving iterative methods as the only viable option [7].

ACM SIGMETRICS Performance Evaluation ReviewVol. 53(4)
Institut national de recherche en sciences et technologies du numérique (FR), Eindhoven University of Technology (NL)
Openalex Percentile: Top 28%
Markov Chains and Monte Carlo Methods
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.