The topic of this thesis are random processes on finite and infinite groups. More specifically, we are concerned with random walks on finitely generated amenable groups and stochastic processes which arise as limits of trajectories of the interchange process on a line. In the first part of the thesis we construct a new class of finitely generated groups, called bubble groups. Analysis of the random walk on such groups shows that they are non-Liouville, but have return probability exponents close to $1/2$. Such behavior was previously unknown for random walks on groups. Our construction is based on permutational wreath products over tree-like Schreier graphs and the analysis of large deviations of inverted orbits on such graphs. In the secon...
Let H be a finite group and µ a probability measure on H. This data determines an invariant random w...
The random stirring process is a natural random walk on the set of permutations of the vertex set of...
In this thesis, we study a collection of stochastic properties arising from graph manipulations. The...
The topic of this thesis are random processes on finite and infinite groups. More specifically, we a...
The purpose of the focussed research group was to study the Uniform Sorting Network and related rand...
This thesis concerns applications of some probabilistic tools to phylogeny reconstruction and popula...
The first part of this thesis concerns random sorting networks. A sorting network is a shortest path...
The first part of this thesis concerns random sorting networks. A sorting network is a shortest path...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
We derive a large deviation principle for random permutations induced by probability measures of the...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
This paper initiates a limit theory of permutation valued processes, building on the recent theory o...
Let $\sigma$ be a random permutation chosen uniformly over the symmetric group $\mathfrak{S}_n$. We ...
This paper announces results which have been later developped in three articles: 1. "Random walks on...
Thesis (PhD) - Indiana University, Mathematics, 2006First we consider some isometry-invariant point ...
Let H be a finite group and µ a probability measure on H. This data determines an invariant random w...
The random stirring process is a natural random walk on the set of permutations of the vertex set of...
In this thesis, we study a collection of stochastic properties arising from graph manipulations. The...
The topic of this thesis are random processes on finite and infinite groups. More specifically, we a...
The purpose of the focussed research group was to study the Uniform Sorting Network and related rand...
This thesis concerns applications of some probabilistic tools to phylogeny reconstruction and popula...
The first part of this thesis concerns random sorting networks. A sorting network is a shortest path...
The first part of this thesis concerns random sorting networks. A sorting network is a shortest path...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
We derive a large deviation principle for random permutations induced by probability measures of the...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
This paper initiates a limit theory of permutation valued processes, building on the recent theory o...
Let $\sigma$ be a random permutation chosen uniformly over the symmetric group $\mathfrak{S}_n$. We ...
This paper announces results which have been later developped in three articles: 1. "Random walks on...
Thesis (PhD) - Indiana University, Mathematics, 2006First we consider some isometry-invariant point ...
Let H be a finite group and µ a probability measure on H. This data determines an invariant random w...
The random stirring process is a natural random walk on the set of permutations of the vertex set of...
In this thesis, we study a collection of stochastic properties arising from graph manipulations. The...