Related papers: Green geometry, Martin boundary and random walk as…
Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We prove that supercritical branching random walk on a transient graph converges almost surely under rescaling to a random measure on the Martin boundary of the graph. Several open problems and conjectures about this limiting measure are…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
We consider a random, uniformly elliptic coefficient field $a$ on the lattice $\mathbb{Z}^d$. The distribution $\langle \cdot \rangle$ of the coefficient field is assumed to be stationary. Delmotte and Deuschel showed that the gradient and…
We consider a one dimensional asymmetric random walk whose jumps are identical, independent and drawn from a distribution \phi(\eta) displaying asymmetric power law tails (i.e. \phi(\eta) \sim c/\eta^{\alpha +1} for large positive jumps and…
We study a generalized functional related to the pullback metrics (3). We derive the first variation formula which yield stationary maps. We introduce the stress-energy tensor which is naturally linked to conservation law and yield…
This is a preprint of Chapter 2 in the following work: Marta Lewicka, A Course on Tug-of-War Games with Random Noise, 2020, Springer, reproduced with permission of Springer Nature Switzerland AG. We present the basic relation between the…
These notes were written for the mini-course "Extrema of log-correlated random variables: Principles and Examples" at the Introductory School held in January 2015 at the Centre International de Rencontres Math\'ematiques in Marseille. There…
Random walks on a group $G$ model many natural phenomena. A random walk is defined by a probability measure $p$ on $G$. We are interested in asymptotic properties of the random walks and in particular in the linear drift and the asymptotic…
We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…
The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective…
An explicit expression is derived for the distribution function of end-to-end vectors and for the mean square end-to-end distance of a flexible chain with excluded-volume interactions. The Hamiltonian for a flexible chain with weak…
We prove a shape theorem and derive a variational formula for the limiting quenched Lyapunov exponent and the Green's function of random walk in a random potential on a square lattice of arbitrary dimension and with an arbitrary finite set…
Let $\Omega \subset \mathbb{R}^N$ ($N \geq 3$) be a $C^2$ bounded domain and $K \subset \Omega$ be a compact, $C^2$ submanifold in $\mathbb{R}^N$ without boundary, of dimension $k$ with $0\leq k < N-2$. We consider the Schr\"odinger…
We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of…
We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…
We consider a random variable X satisfying almost-sure conditions involving G:=<DX,-DL^{-1}X> where DX is X's Malliavin derivative and L^{-1} is the inverse Ornstein-Uhlenbeck operator. A lower- (resp. upper-) bound condition on G is proved…