Pith. sign in

REVIEW 2 cited by

On the spectral radius of the non-backtracking matrix of the configuration model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.07321 v2 pith:Y53DWALH submitted 2024-04-10 math.GR math.PR

classification math.GRmath.PR
keywords configurationmatrixmodeleigenvalueleadingmathbbnon--backtrackingnumber
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We prove a concentration result for the leading eigenvalue of the non--backtracking matrix of the configuration model under the assumption of uniformly bounded degrees. Let $P$ denote the limiting degree distribution. Assuming polynomial approximation, we show that as the number of vertices tends to infinity, the leading eigenvalue of the non--backtracking matrix concentrates around \[ \frac{\mathbb{E}[P(P-1)]}{\mathbb{E}[P]}. \] This quantity corresponds to the mean offspring number of the excess--degree branching process associated with the local limit of the configuration model. As a byproduct of our work we explain how this result can be applied to prove the density of the growth rates of the subgroups of the free group.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Critical-exponent stratification and inverse realization on biregular trees

    math.GR 2026-07 accept novelty 7.0 of 10

    Free type-preserving actions on biregular trees realize every critical exponent up to (1/2)log(rs); finitely generated actions have a countable dense spectrum, and rank-two values equal roots of three explicit polynom...

  2. Counterfactual Operator Relevance for PDE Discovery: Screening, Pruning, and Identifiability

    cs.LG 2025-06 reject novelty 2.0 of 10

    Counterfactual term deletion is proposed as a relevance diagnostic for PDE discovery, but the six promised theorems are not in the paper and the main recovery theorem's proof is internally contradictory.

Pith tools