Bibliographic record
Abstract
In the final two lectures we want to treat one of the most important and inspiring realizations of free independence. Canonical examples for free random variables appeared in the context of group algebras of free products of groups and in the context of creation and annihilation operators on full Fock spaces. These are two (closely related) examples where the occurrence of free independence is not very surprising, because its definition was just modeled according to the situation on the group (or von Neumann) algebra of the free group. But there are objects from a quite different mathematical universe which are also free (at least asymptotically), namely special random matrices . A priori, random matrices have nothing to do with free independence and this surprising connection is one of the key results in free probability theory. It establishes links between quite different fields. We will present in this and the next lecture the fundamental results of Voiculescu on the asymptotic free independence of special random matrices. Our approach will be quite combinatorial and fits well with our combinatorial description of free independence. In a sense, we will show that the combinatorics of free probability theory arises as the limit N → ∞ of the combinatorics of the considered N × N random matrices. Moments of Gaussian random variables Random matrices are matrices whose entries are classical random variables, and the most important class of random matrices are the socalled Gaussian random matrices whose entries form a Gaussian family of classical random variables.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.012 | 0.005 |
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".