A weighted graph zeta function involved in the Szegedy walk

10/11/2021
by   Ayaka Ishikawa, et al.
0

We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/13/2018

Graph-Based Ascent Algorithms for Function Maximization

We study the problem of finding the maximum of a function defined on the...
04/30/2019

Computing the hull number in toll convexity

A walk W between vertices u and v of a graph G is called a tolled walk ...
02/12/2015

Spectral Sparsification of Random-Walk Matrix Polynomials

We consider a fundamental algorithmic question in spectral graph theory:...
06/30/2019

Connecting edge-colouring

This paper studies the problem of connecting edge-colouring. Given an un...
07/01/2018

A complete characterization of plateaued Boolean functions in terms of their Cayley graphs

In this paper we find a complete characterization of plateaued Boolean f...
02/12/2021

A Subexponential Algorithm for ARRIVAL

The ARRIVAL problem is to decide the fate of a train moving along the ed...
05/08/2019

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm

We show that the 2-dimensional Weisfeiler-Leman algorithm stabilizes n-v...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.