MétaCan
Menu
Back to cohort
Record W1506409176 · doi:10.1090/tran/7420

Random geometric graphs and isometries of normed spaces

2018· preprint· lv· W1506409176 on OpenAlexafffund
Paul Balister, Béla Bollobás, Karen Gunderson, Imre Leader, Mark Walters

Bibliographic record

VenueTransactions of the American Mathematical Society · 2018
Typepreprint
Languagelv
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of CanadaNational Science Foundation
KeywordsMathematicsBijectionIsometry (Riemannian geometry)CombinatoricsCountable setNormed vector spaceDiscrete mathematicsSpace (punctuation)Pure mathematicsComputer science

Abstract

fetched live from OpenAlex

Given a countable dense subset <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of a finite-dimensional normed space <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper X"> <mml:semantics> <mml:mi>X</mml:mi> <mml:annotation encoding="application/x-tex">X</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="0 greater-than p greater-than 1"> <mml:semantics> <mml:mrow> <mml:mn>0</mml:mn> <mml:mo>&gt;</mml:mo> <mml:mi>p</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">0&gt;p&gt;1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , we form a random graph on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> by joining, independently and with probability <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p"> <mml:semantics> <mml:mi>p</mml:mi> <mml:annotation encoding="application/x-tex">p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , each pair of points at distance less than <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="1"> <mml:semantics> <mml:mn>1</mml:mn> <mml:annotation encoding="application/x-tex">1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We say that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is <italic>Rado</italic> if any two such random graphs are (almost surely) isomorphic. Bonato and Janssen showed that in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script l Subscript normal infinity Superscript d"> <mml:semantics> <mml:msubsup> <mml:mi> ℓ </mml:mi> <mml:mi mathvariant="normal"> ∞ </mml:mi> <mml:mi>d</mml:mi> </mml:msubsup> <mml:annotation encoding="application/x-tex">\ell _\infty ^d</mml:annotation> </mml:semantics> </mml:math> </inline-formula> almost all <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are Rado. Our main aim in this paper is to show that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script l Subscript normal infinity Superscript d"> <mml:semantics> <mml:msubsup> <mml:mi> ℓ </mml:mi> <mml:mi mathvariant="normal"> ∞ </mml:mi> <mml:mi>d</mml:mi> </mml:msubsup> <mml:annotation encoding="application/x-tex">\ell _\infty ^d</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is the unique normed space with this property: indeed, in every other space almost all sets <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are non-Rado. We also determine which spaces admit some Rado set: this turns out to be the spaces that have an <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script l Subscript normal infinity"> <mml:semantics> <mml:msub> <mml:mi> ℓ </mml:mi> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\ell _\infty</mml:annotation> </mml:semantics> </mml:math> </inline-formula> direct summand. These results answer questions of Bonato and Janssen. A key role is played by the determination of which finite-dimensional normed spaces have the property that every bijective step-isometry (meaning that the integer part of distances is preserved) is in fact an isometry. This result may be of independent interest.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies
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.449
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0000.002
Science and technology studies0.0000.013
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.000

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.020
GPT teacher head0.294
Teacher spread0.274 · 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 teacher head, not a consensus.

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

Citations3
Published2018
Admission routes2
Has abstractyes

Explore more

Same venueTransactions of the American Mathematical SocietySame topicAdvanced Topology and Set TheoryFrench-language works237,207