MétaCan
Menu
Back to cohort
Record W4249553598 · doi:10.1002/jgt.20202

Between ends and fibers

2006· article· en· W4249553598 on OpenAlexaff
C. Paul Bonnington, R. Bruce Richter, Mark E. Watkins

Bibliographic record

VenueJournal of Graph Theory · 2006
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsMathematicsCombinatoricsEquivalence relationDisjoint setsVertex (graph theory)GraphDiscrete mathematics

Abstract

fetched live from OpenAlex

Abstract Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex‐sequence $\{{{x}}_{{n}}\}_{{{n}}={{0}}}^\infty\subseteq {{VP}}$ is said to be regulated by C if, for all n ϵℕ, ${{x}}_{{{n}}+{{1}}}$ never precedes x n on P , each vertex of P appears at most C times in the sequence, and $\delta_{{P}}({{x}}_{{n}},{{x}}_{{{n}}+{{1}}})\leq {{C}}$ . R. Halin (Math. Ann., 157, 1964 , 125–137) defined two rays to be end‐equivalent if they are joined by infinitely many pairwise‐disjoint paths; the resulting equivalence classes are called ends . More recently H. A. Jung (Graph Structure Theory, Contemporary Mathematics, 147, 1993 , 477–484) defined rays P and Q to be b‐equivalent if there exist sequences $\{{{x}}_{{n}}\}_{{{n}}={{0}}}^\infty\subseteq {{VP}}$ and $\{{{y}}_{{n}}\}_{{{n}}={{0}}}^\infty\subseteq {{VQ}}$ VQ regulated by some constant C ≥ 1 such that $\delta({{x}}_{{n}},{{y}}_{{n}})\leq {{C}}$ for all n ϵℕ; he named the resulting equivalence classes b‐fibers . Let $F_0$ denote the set of nondecreasing functions from $N$ into the set of positive real numbers. The relation ${{P}}\sim_{{f}} {{Q}}$ (called f‐equivalence ) generalizes Jung's condition to $\delta({{x}}_{{n}},{{y}}_{{n}})\leq {{Cf}}({{n}})$ . As f runs through $\cal{F}_{{0}}$ , uncountably many equivalence relations are produced on the set of rays that are no finer than b ‐equivalence while, under specified conditions, are no coarser than end‐equivalence. Indeed, for every Γ there exists an “end‐defining function” ${{f}}\in F_{{0}}$ that is unbounded and sublinear and such that ${{P}}\sim_{{f}} {{Q}}$ implies that P and Q are end‐equivalent. Say ${{P}}\approx {{Q}}$ if there exists a sublinear function ${{f}}\in F_{{0}}$ such that ${{P}}\sim_{{f}} {{Q}}$ . The equivalence classes with respect to $\approx$ are called bundles . We pursue the notion of “initially metric” rays in relation to bundles, and show that in any bundle either all or none of its rays are initially metric. Furthermore, initially metric rays in the same bundle are end‐equivalent. In the case that Γ contains translatable rays we give some sufficient conditions for every f ‐equivalence class to contain uncountably many g ‐equivalence classes (where ${lim}_{{{n}}\to\infty}{{g}}({{n}})/{{f}}({{n}})={{0}}$ ). We conclude with a variety of applications to infinite planar graphs. Among these, it is shown that two rays whose union is the boundary of an infinite face of an almost‐transitive planar map are never bundle‐ equivalent. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 125–153, 2007

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.581
Threshold uncertainty score0.341

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.012
GPT teacher head0.266
Teacher spread0.254 · 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.

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

Citations2
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Graph TheorySame topicAdvanced Graph Theory ResearchFrench-language works237,207