FWF - Pfade - Walks and Boundaries - a Wide Range

As it is typical for the research approaches of W. Woess, this project aims at doing mathematical research at the meeting point of several fields, strongly featuring the interplay of structure theory with probability, analysis, and combinatorics. “Random walks” are stochastic processes which evolve in discrete time steps on a state space with a geometric, algebraic or combinatorial structure. The spirit is conveyed by the title of a 1921 paper by G. Polya, “Über eine Aufgabe der Wahrscheinlichkeitstheorie betreffend die Irrfahrt im Straßennetz” (on an exercise of probability theory concerning the random walk in a street network). Since that, the theory has developed significantly. In the present project, the state space is not always a graph (street network), and the processes may also evolve in continuous time, resp., there may be an increasing number of moving particles. The “boundaries” of the title complete the spaces at infintiy. In other words, they provide a way of distinguishing points at infinity. In topic A, the random processes evolve on a boundary itself: ultrametric spaces arise as boundaries of trees. They appear e.g. in mathematical biology, while here one can trace back the inspiration to theoretical physics. Those spaces carry a family of natural random processes, generated by so-called hierarchical Laplacians. The plan is to combine random perturbations of those operators with randomising the underlying tree. B. Branching random walk studies the evolution of a population which moves according to random walk, while increasing by ongoing reproduction. We intend to study the random sequence of the empirical distributions of the population and their behaviour at infinity on trees and other infinite graphs. Topic C concerns variants of Brownian motion, where the geometry is negatively curved like in Einstein's model of the universe, and the motion encounters lines where it is “disturbed”. We want to describe the long range behaviour in terms of the so-called Martin boundary, and the task is to describe the latter rigorously. D. Polyharmonic functions are related with equations coming up in the theory of elasticity or in radar imaging. Little has been done concernig discrete counterparts related with random walks. Here, the plan is to address polyharmonic functions on trees and related structures. E. Counting self-avoiding walks in graphs draws its motivation from statsitical physics and comprises hard methods and famous results. Seemingly rather different from A-D, but part of the proposer's “panorama” in a natural way, we plan to study these walks from the viewpoint of formal language theory, thereby providing a link with theoretical computer science. This project and its employees are expected to interact strongly with the FWF-funded doctoral program (DK) “Discrete Mathematics”, of which Wolfgang Woess is the speaker.