相关论文: Random Walk on a Surface Group: Boundary Behavior …
In this note, we study the Martin boundary of the simple random walk on an example of directed graph. More precisely, the Martin boundary is shown to be trivial, i.e. there is no non-constant positive harmonic functions. The proof involves…
We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…
Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…
The Martin compactification is investigated for a d-dimensional random walk which is killed when at least one of it's coordinates becomes zero or negative. The limits of the Martin kernel are represented in terms of the harmonic functions…
This is the second of two papers on the end-to-end distance of a weakly self-repelling walk on a four dimensional hierarchical lattice. It completes the proof that the expected value grows as a constant times \sqrt{T} log^{1/8}T (1+O((log…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We consider a random walk on the support of an ergodic simple point process on R^d, d>1, furnished with independent energy marks. The jump rates of the random walk decay exponentially in the jump length and depend on the energy marks via a…
Using Roelcke formula for the Green function, we explicitly construct a basis in the kernel of the adjoint Laplacian on a compact polyhedral surface $X$ and compute the $S$-matrix of $X$ at the zero value of the spectral parameter. We apply…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
Aging refers to the property of two-time correlation functions to decay very slowly on (at least) two time scales. This phenomenon has gained recent attention due to experimental observations of the history dependent relaxation behavior in…
We give the random environment version of Mogul'ski\v{\i} estimation in quenched sense.Assume that $\{\mu\}_{n\in\bfN}$ (called environment) is a sequence of i.i.d. random probability measures on $\bfR.$~ Let $\{X_n\}_{n\in\bfN}$ be a…
In many complex systems, for the activity f(i) of the constituents or nodes i, a power-law relationship was discovered between the standard deviation sigma(i) and the average strength of the activity: sigma(i) ~ <f(i)>^alpha; universal…
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…
Acoustic room modes and the Green's function mode expansion are well-known for rectangular rooms with perfectly reflecting walls. First-order approximations also exist for nearly rigid boundaries; however, current analytical methods fail to…
The discrete Green's function (without boundary) $\mathbb{G}$ is a pseudo-inverse of the combinatorial Laplace operator of a graph $G=(V,E)$. We reveal the intimate connection between Green's function and the theory of exact stopping rules…
Let $(X, \cal B, \nu)$ be a probability space and let $\Gamma$ be a countable group of $\nu$-preserving invertible maps of $X$ into itself. To a probability measure $\mu$ on $\Gamma$ corresponds a random walk on $X$ with Markov operator $P$…
The main results of this article provide asymptotics at infinity of the Green's functions near and at the spectral gap edges for "generic" periodic second-order elliptic operators on noncompact Riemannian co-compact coverings with abelian…
Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…
We consider the spectral radius of a large random matrix $X$ with independent, identically distributed entries. We show that its typical size is given by a precise three-term asymptotics with an optimal error term beyond the radius of the…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.