图的正则覆盖顶点矩阵加权Zeta函数
A Vertex Matrix-Weighted Zeta Function of Regular Coverings of a Graph
摘要: 本文首先介绍了关于Zeta函数的课题来源及意义,然后介绍了相关研究成果和现状,之后引入了图的顶点矩阵加权的相关定义和定理,再之后给出了图的正则覆盖Zeta函数的行列式表达式及其证明,最后考虑到二部图的特殊性,给出了二部图的覆盖图顶点矩阵加权的Zeta函数。
Abstract: This paper first introduces the origin and significance of Zeta function, then introduces the related research results and the present situation, and then introduces the related definitions and theorems of vertex matrix weighting of graphs, the determinant expression and its proof of zeta functions of regular covering of a graph are given. At last, considering the particularity of bipartite graphs, the weighted Zeta functions of the vertex matrix of bipartite graphs are given.
文章引用:考梦诗. 图的正则覆盖顶点矩阵加权Zeta函数[J]. 理论数学, 2024, 14(6): 36-42. https://doi.org/10.12677/pm.2024.146225

参考文献

[1] Ihara, Y. (1966) On Discrete Subgroups of the Two by Two Projective Linear Group over p-Adic Fields. Journal of the Mathematical Society of Japan, 18, 219-235. [Google Scholar] [CrossRef
[2] Kotani, M. and Sunada, T. (2000) Zeta Functions of Finite Graphs. The University of Tokyo. Journal of Mathematical Sciences, 7, 7-25.
[3] Hashimoto, K.I. (1989) Zeta Functions of Finite Graphs and Representations of p-Adic Groups. Advanced Studies in Pure Mathematics, 15, 211-280. [Google Scholar] [CrossRef
[4] Bass, H. (1992) The Ihara-Selberg Zeta Function of a Tree Lattice. International Journal of Mathematics, 3, 717-797. [Google Scholar] [CrossRef
[5] Stark, H.M. and Terras, A.A. (1996) Zeta Functions of Finite Graphs and Coverings. Advances in Mathematics, 121, 124-165. [Google Scholar] [CrossRef
[6] He, Y. (2011) Graph Zeta Function and Gauge Theories. Journal of High Energy Physics, 2011, 64. [Google Scholar] [CrossRef
[7] Sato, I., Mitsuhashi, H. and Morita, H. (2013) A Matrix-Weighted Zeta Function of a Graph. Linear and Multilinear Algebra, 62, 114-125. [Google Scholar] [CrossRef
[8] Alon, N., Benjamini, I., Lubetzky, E. and Sodin, S. (2007) Non-Backtracking Random Walks Mix Faster. Communications in Contemporary Mathematics, 9, 585-603. [Google Scholar] [CrossRef
[9] Fitzner, R. and van der Hofstad, R. (2013) Non-Backtracking Random Walk. Journal of Statistical Physics, 150, 264-284. [Google Scholar] [CrossRef
[10] Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., et al. (2013) Spectral Redemption in Clustering Sparse Networks. Proceedings of the National Academy of Sciences, 110, 20935-20940. [Google Scholar] [CrossRef] [PubMed]
[11] Angel, O., Friedman, J. and Hoory, S. (2014) The Non-Backtracking Spectrum of the Universal Cover of a Graph. Transactions of the American Mathematical Society, 367, 4287-4318. [Google Scholar] [CrossRef
[12] Kempton, M. (2015) High Dimensional Spectral Graph Theory and Non-Backtracking Random Walks on Graphs. ProQuest LLC, 94.
[13] Konno, N., Mitsuhashi, H., Morita, H. and Sato, I. (2019) A New Weighted Ihara Zeta Function for a Graph. Linear Algebra and Its Applications, 571, 154-179. [Google Scholar] [CrossRef
[14] Zhu, L. (2021) A Vertex Weighted Bartholdi Zeta Function for a Graph. Linear Algebra and Its Applications, 621, 254-271. [Google Scholar] [CrossRef