This thesis consists of five papers dealing with various aspects of spatial random processes. In the first three papers the main focus is on a special class of such processes, namely measures of maximal entropy for subshifts of finite type. These are shown to be closely related to Gibbs measures, and the question of whether a given subshift of finite type has a unique measure of maximal entropy is also discussed. In the fourth paper the theory of subshifts of finite type is exploited in order to derive properties of uniform spanning trees for a certain class of infinite graphs. The fifth paper deals with stationary first passage percolation, the main result being a necessary and sufficient condition for a compact set B in R<sup>d</sup> to a...
Thesis (PhD) - Indiana University, Mathematics, 2006First we consider some isometry-invariant point ...
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spann...
Some aspects of real-world road networks seem to have an approximate scale invariance property, moti...
This thesis consists of five papers dealing with various aspects of spatial random processes. In the...
20 pagesInternational audienceConsider a uniformly sampled random $d$-regular graph on $n$ vertices....
We investigate random walks on the integer lattice perturbed at the origin which maximize the entrop...
The thesis contains three articles about three different models, all of which are about probability ...
Stationary measures for an interactive exclusion process on ℤ are considered. The process is such th...
We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest ne...
A new class of multiscale stochastic processes called spatial random trees (SRTs) is introduced and ...
In this article, we lay solid foundations for the study of Maximal Entropy Random Walks (MERWs) on i...
We prove several theorems concerning random walks, harmonic functions, percolation, uniform spanning...
. Let \Gamma act on a countable set V with only finitely many orbits. Given a \Gamma-invariant rando...
This book provides a modern introductory tutorial on specialized theoretical aspects of spatial and ...
Abstract. We study spanning trees on Sierpiński graphs (i.e., finite approxima-tions to the Sierpin...
Thesis (PhD) - Indiana University, Mathematics, 2006First we consider some isometry-invariant point ...
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spann...
Some aspects of real-world road networks seem to have an approximate scale invariance property, moti...
This thesis consists of five papers dealing with various aspects of spatial random processes. In the...
20 pagesInternational audienceConsider a uniformly sampled random $d$-regular graph on $n$ vertices....
We investigate random walks on the integer lattice perturbed at the origin which maximize the entrop...
The thesis contains three articles about three different models, all of which are about probability ...
Stationary measures for an interactive exclusion process on ℤ are considered. The process is such th...
We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest ne...
A new class of multiscale stochastic processes called spatial random trees (SRTs) is introduced and ...
In this article, we lay solid foundations for the study of Maximal Entropy Random Walks (MERWs) on i...
We prove several theorems concerning random walks, harmonic functions, percolation, uniform spanning...
. Let \Gamma act on a countable set V with only finitely many orbits. Given a \Gamma-invariant rando...
This book provides a modern introductory tutorial on specialized theoretical aspects of spatial and ...
Abstract. We study spanning trees on Sierpiński graphs (i.e., finite approxima-tions to the Sierpin...
Thesis (PhD) - Indiana University, Mathematics, 2006First we consider some isometry-invariant point ...
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spann...
Some aspects of real-world road networks seem to have an approximate scale invariance property, moti...