On the Strong Convergence and Complete Convergence for Pairwise NQD Random Variables
Bibliographic record
Abstract
Let an,n≥1 be a sequence of positive constants with an/n↑ and let X,Xn,n≥1 be a sequence of pairwise negatively quadrant dependent random variables. The complete convergence for pairwise negatively quadrant dependent random variables is studied under mild condition. In addition, the strong laws of large numbers for identically distributed pairwise negatively quadrant dependent random variables are established, which are equivalent to the mild condition ∑n=1∞PX>an<∞ . Our results obtained in the paper generalize the corresponding ones for pairwise independent and identically distributed 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.035 | 0.106 |
| Meta-epidemiology (narrow) | 0.003 | 0.002 |
| Meta-epidemiology (broad) | 0.004 | 0.005 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.003 | 0.011 |
| Scholarly communication | 0.005 | 0.013 |
| Open science | 0.005 | 0.009 |
| Research integrity | 0.004 | 0.011 |
| Insufficient payload (model declined to judge) | 0.014 | 0.003 |
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".