There are various kernels that we can associate to the k-regular tree, Tk . Here we will take a few of those kernels and insert them into the Selberg trace formula on Tk . Amongst the results, we find a simple proof for the Graph Prime Number The...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=T10770840
[S.l.]: University of California, San Diego 2005
University of California, San Diego
2005
영어
Ph.D.
110 p.
Chair: Audrey Terras.
0
상세조회0
다운로드소속기관이 구독 중이 아닌 경우 오후 4시부터 익일 오전 9시까지 원문보기가 가능합니다.
다국어 초록 (Multilingual Abstract)
There are various kernels that we can associate to the k-regular tree, Tk . Here we will take a few of those kernels and insert them into the Selberg trace formula on Tk . Amongst the results, we find a simple proof for the Graph Prime Number The...
There are various kernels that we can associate to the k-regular tree, Tk . Here we will take a few of those kernels and insert them into the Selberg trace formula on Tk . Amongst the results, we find a simple proof for the Graph Prime Number Theorem and a proof of McKay's Theorem regarding the distribution of the adjacency matrix eigenvalues for a sequence of regular graphs of fixed degree whose number of vertices go to infinity. Using a simple change of variables, we are able to find the limiting distribution of the t-values of the Ihara zeta function for a (q + 1)-regular graph. We then provide evidence that, when our graphs are random, the level spacings of the t-values have the same distribution as the Gaussian Orthogonal Ensemble. And even when the graph is not random, the level spacings of the t-values are the same as the level spacings of the eigenvalues of the associated adjacency matrix.