tailieunhanh - Báo cáo toán học: "Coverings, Laplacians, and Heat Kernels of Directed Graphs"

Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: Coverings, Laplacians, and Heat Kernels of Directed Graphs. | Coverings Laplacians and Heat Kernels of Directed Graphs Clara E. Brasseur Oberlin College 52 West Lorain Street Oberlin OH 44074 Ryan E. Grady Department of Mathematics University of Notre Dame Notre Dame IN 46556 rgrady@ Stratos Prassidis y Department of Mathematics Canisius College Buffalo NY 14208 prasside@ Submitted Jun 27 2007 Accepted Feb 19 2009 Published Feb 27 2009 Mathematics Subject Classification 05C50 60B15 60J15 Abstract Combinatorial covers of graphs were defined by Chung and Yau. Their main feature is that the spectra of the Combinatorial Laplacian of the base and the total space are related. We extend their definition to directed graphs. As an application we compute the spectrum of the Combinatorial Laplacian of the homesick random walk RWh on the line. Using this calculation we show that the heat kernel on the weighted line can be computed from the heat kernel of 1 1 G-regular tree. 1 Introduction A finite presentation of a group determines a locally finite graph the Cayley graph. In general the graph depends on the presentation and it does not reflect the algebraic properties of the group. But the Cayley graph provides information on the large scale properties of the group . properties of the group at infinity. This is the motivation for the question posed by M. Gromov Partially Supported by an . . Grant IPartially Supported by a Canisus College Summer Research Grant THE ELECTRONIC JOURNAL OF COMBINATORICS 16 2009 R31 1 Question. What is the relation between the spectrum of a random walk on the Cayley graph of the group to the geometry at infinity of the group A classical result towards this direction is given in 5 where the spectral radius the maximal eigenvalue of the normalized adjacency operator on a graph is connected to properties of the graph and the group. Notice that the normalized adjacency operator encodes the simple random walk on the graph the one that each direction has the

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.