Original and modified non-perturbative renormalization group equations of the BMW scheme at the arbitrary order of truncation
Bibliographic record
Abstract
We consider the non-perturbative renormalization group (RG) equations, obtained as approximations of the exact Wetterich RG flow equation within the Blaizot–Mendez–Wschebor (BMW) truncation scheme. For the first time, we derive explicit RG flow equations for the scalar model at the arbitrary order of truncation. Moreover, we consider original, as well as modified, approximations, used to obtain a set of closed equations. We compare these equations at the s = 2 order of truncation with those recently derived in J. Phys. A: Math. Theor. 53 , 415002 (2020) within a new truncation scheme and find a striking similarity. Namely, the first-order equations of the latter scheme, those of the original BMW scheme, and those of the modified BMW scheme (at s = 2) differ only in one term. We solved these equations by a recently proposed and tested method of semi-analytic approximations. Thus, the critical exponents η , ν , and ω were evaluated, recovering also the known results of the original BMW scheme. In addition, we estimated the subleading correction-to-scaling exponent ω 2 for the three equations considered. To the best of our knowledge, this exponent has not yet been extracted from the Wetterich equation beyond the local potential (the zeroth order) approximation. Our current estimate for the 3D Ising model is ω 2 = 2.02 (40), where the error bars include the expected truncation error in the BMW scheme.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".