Computer Science > Discrete Mathematics
[Submitted on 13 Nov 2019]
Title:On the Relativized Alon Second Eigenvalue Conjecture III: Asymptotic Expansions for Tangle-Free Hashimoto Traces
View PDFAbstract:This is the third in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs.
In this paper we consider random graphs that are random covering graphs of large degree $n$ of a fixed base graph. We prove the existence of asympototic expansion in $1/n$ for the expected value of the number of strictly non-backtracking closed walks of length $k$ times the indicator function that the graph is free of certain {\em tangles}; moreover, we prove that the coefficients of these expansions are "nice functions" of $k$, namely approximately equal to a sum of polynomials in $k$ times exponential functions of $k$.
Our results use the methods of Friedman used to resolve Alon's original conjecture, combined with the results of Article~II in this series of articles. One simplification in this article over the previous methods of Friedman is that the "regularlized traces" used in this article, which we call {\em certified traces}, are far easier to define and work with than the previously utilized {\em selective traces}.
Current browse context:
cs.DM
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.