MétaCan
Menu
Back to cohort
Record W2131721310 · doi:10.1214/ecp.v19-3443

On free stable distributions

2014· article· en· W2131721310 on OpenAlexafffund
Takahiro Hasebe, Alexey Kuznetsov

Bibliographic record

VenueElectronic Communications in Probability · 2014
Typearticle
Languageen
FieldMathematics
TopicRandom Matrices and Applications
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsFactorizationRandom variableVariable (mathematics)Stability (learning theory)Distribution (mathematics)Stable distributionInfinite productSeries (stratigraphy)Pure mathematicsProbability density functionCumulative distribution functionStatistical physicsMathematical analysisStatistics

Abstract

fetched live from OpenAlex

We investigate analytical properties of free stable distributions and discover many connections with their classical counterparts. Our main result is an explicit formula for the Mellin transform, which leads to explicit series representations for the characteristic function and for the density of a free stable distribution. All of these formulas bear close resemblance to the corresponding expressions for classical stable distributions. As further applications of our results, we give an alternative proof of the duality law due to Biane and a new factorization of a classical stable random variable into an independent (in the classical sense) product of a free stable random variable and a power of a Gamma(2) random variable.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.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.

Opus teacher head0.038
GPT teacher head0.326
Teacher spread0.288 · 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 source (direct Gemma or distilled Codex), not a consensus.

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

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

Citations10
Published2014
Admission routes2
Has abstractyes

Explore more

Same venueElectronic Communications in ProbabilitySame topicRandom Matrices and ApplicationsFrench-language works237,207