MétaCan
Menu
Back to cohort

On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs

2024· article· en· W6967393897 on OpenAlexafffund

Bibliographic record

VenueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2024
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Waterloo
KeywordsIsoperimetric inequalityConjectureCounterexampleConstant (computer programming)LogarithmEigenvalues and eigenvectors

Abstract

fetched live from OpenAlex

Houdré and Tetali defined a class of isoperimetric constants φ_p of graphs for 0 ≤ p ≤ 1, and conjectured a Cheeger-type inequality for φ_(1/2) of the form λ₂ ≲ φ_(1/2) ≲ √λ₂, where λ₂ is the second smallest eigenvalue of the normalized Laplacian matrix. If true, the conjecture would be a strengthening of the hard direction of the classical Cheeger’s inequality. Morris and Peres proved Houdré and Tetali’s conjecture up to an additional log factor, using techniques from evolving sets. We present the following related results on this conjecture. 1) We provide a family of counterexamples to the conjecture of Houdré and Tetali, showing that the logarithmic factor is needed. 2) We match Morris and Peres’s bound using standard spectral arguments. 3) We prove that Houdré and Tetali’s conjecture is true for any constant p strictly bigger than 1/2, which is also a strengthening of the hard direction of Cheeger’s inequality. Furthermore, our results can be extended to directed graphs using Chung’s definition of eigenvalues for directed graphs.

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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.043
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.038
GPT teacher head0.321
Teacher spread0.283 · 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

Citations0
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Same topicGraph theory and applicationsFrench-language works237,207