scholarly journals STATES ON THE CUNTZ ALGEBRAS AND p-ADIC RANDOM WALKS

2011 ◽  
Vol 90 (2) ◽  
pp. 197-211 ◽  
Author(s):  
P. E. T. JORGENSEN ◽  
A. M. PAOLUCCI

AbstractWe study Markov measures and p-adic random walks with the use of states on the Cuntz algebras Op. Via the Gelfand–Naimark–Segal construction, these come from families of representations of Op. We prove that these representations reflect selfsimilarity especially well. In this paper, we consider a Cuntz–Krieger type algebra where the adjacency matrix depends on a parameter q ( q=1 is the case of Cuntz–Krieger algebra). This is an ongoing work generalizing a construction of certain measures associated to random walks on graphs.

Author(s):  
Mark Newman

An introduction to the mathematical tools used in the study of networks. Topics discussed include: the adjacency matrix; weighted, directed, acyclic, and bipartite networks; multilayer and dynamic networks; trees; planar networks. Some basic properties of networks are then discussed, including degrees, density and sparsity, paths on networks, component structure, and connectivity and cut sets. The final part of the chapter focuses on the graph Laplacian and its applications to network visualization, graph partitioning, the theory of random walks, and other problems.


2007 ◽  
Vol 202 (1) ◽  
pp. 144-154 ◽  
Author(s):  
Jianjun Paul Tian ◽  
Zhenqiu Liu

1990 ◽  
Vol 4 (4) ◽  
pp. 489-492 ◽  
Author(s):  
José Luis Palacios

Aleliunas et al. [3] proved that for a random walk on a connected raph G = (V, E) on N vertices, the expected minimum number of steps to visit all vertices is bounded by 2|E|(N - 1), regardless of the initial state. We give here a simple proof of that result through an equality involving hitting times of vertices that can be extended to an inequality for hitting times of edges, thus obtaining a bound for the expected minimum number of steps to visit all edges exactly once in each direction.


1998 ◽  
Vol 8 (4) ◽  
pp. 656-701 ◽  
Author(s):  
T. Coulhon ◽  
A. Grigoryan

Sign in / Sign up

Export Citation Format

Share Document