Monday, February 22, 2016 4:15 pm
-
4:15 pm
EST (GMT -05:00)
Title: Counting walks on graphs
| Speaker: | Yan Xu |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
In
this
talk,
I
will
introduce
how
to
count
the
number
of
walks
without
backtracking
on
a
graph.
If
one
consider
primes
of
a
graph
as
closed
walks
that
do
not
contain
backtracking
and
are
not
a
power
of
any
other
walks,
one
can
de
ne
zeta-functions
of
a
graph
as
an
analog
of
Riemann-Zeta
function.
And
this
zeta-function
has
an
explicit
determinantal
formula
in
term
of
the
adjacency
matrix
of
a
graph.
For
more
information
about
our
reading
group,
please
visit
our
webpage
http://www.math.uwaterloo.ca/hwolkowi/reading.htm