MétaCan
Menu
Back to cohort
Record W4414773635 · doi:10.1017/apr.2025.10033

Non-uniqueness phase in hyperbolic marked random connection models using the spherical transform

2025· article· en· W4414773635 on OpenAlexafffund
Matthew Dickson

Bibliographic record

VenueAdvances in Applied Probability · 2025
Typearticle
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsUniversity of British Columbia
FundersDivision of Mathematical SciencesEngineering and Physical Sciences Research CouncilNatural Sciences and Engineering Research Council of Canada
KeywordsConnection (principal bundle)Convolution (computer science)ScalingFunction (biology)Operator (biology)Phase (matter)Adjacency listFourier transform

Abstract

fetched live from OpenAlex

Abstract A non-uniqueness phase for infinite clusters is proven for a class of marked random connection models (RCMs) on the d -dimensional hyperbolic space, double struck upper H Superscript d H d ${\mathbb{H}^d}$ , in a high volume-scaling regime. The approach taken in this paper utilizes the spherical transform on double struck upper H Superscript d H d ${\mathbb{H}^d}$ to diagonalize convolution by the adjacency function and the two-point function and bound their upper L squared right arrow upper L squared L 2 → L 2 $L^2\to L^2$ operator norms. Under some circumstances, this spherical transform approach also provides bounds on the triangle diagram that allows for a derivation of certain mean-field critical exponents. In particular, the results are applied to some Boolean and weight-dependent hyperbolic RCMs. While most of the paper is concerned with the high volume-scaling regime, the existence of the non-uniqueness phase is also proven without this scaling for some RCMs whose resulting graphs are almost surely not locally finite.

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.006
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: Empirical
Teacher disagreement score0.006
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0020.004
Scholarly communication0.0030.004
Open science0.0020.003
Research integrity0.0020.002
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.040
GPT teacher head0.358
Teacher spread0.318 · 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

Citations1
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueAdvances in Applied ProbabilitySame topicStochastic processes and statistical mechanicsFrench-language works237,207