In this paper we study the parabolic Anderson equation $\partial u(x,t)/\partial t=\kappa 𝛥u(x,t)+\xi (x,t)u(x,t)$, $x\in {\mathbb{Z}}^d$, $t\ge 0$, where the $u$-field and the $\xi$-field are $ℝ$-valued, $\kappa \in [0,\infty )$ is the diffusion constant, and $𝛥$ is the discrete Laplacian. The $\xi$-field plays the role of athat drives the equation. The initial condition $u(x,0)=u_0\left(x\right)$, $x\in {\mathbb{Z}}^d$, is taken to be non-negative and bounded. The solution of the parabolic Anderson equation describes the evolution of a field of particles performing independent simple random walks with binary branching: particles jump at rate $2d\kappa$,...

Take a centered random walk $S_n$ and consider the sequence of its partial sums $A_n:={\sum }_{i=1}^n{S}_i$. Suppose $S_1$ is in the domain of normal attraction of an $\alpha$-stable law with $1lt;\alpha \le 2$. Assuming that $S_1$ is either right-exponential (i.e. $\mathbb{P}(S_{1}gt;x|S_{1}gt;0)={\mathrm{e}}^{-ax}$ for some $agt;0$ and all $xgt;0$) or right-continuous (skip free), we prove that $$\mathbb{P}\{A_{1}gt;0,\cdots ,A_{N}gt;0\}\sim C_{\alpha }{N}^{1/\left(2\alpha \right)-1/2}$$ as $N\to \infty$, where $C_{\alpha }gt;0$ depends on the distribution of the walk. We also consider a conditional version of this problem and study positivity of integrated discrete bridges.

This paper is concerned with the small time behaviour of a Lévy process $X$. In particular, we investigate theof the times, ${\overline{T}}_b\left(r\right)$ and $T_b^{*}\left(r\right)$, at which $X$, started with $X_0=0$, first leaves the space-time regions $\{(t,y)\in {ℝ}^2:y\le r{t}^b,t\ge 0\}$ (one-sided exit), or $\{(t,y)\in {ℝ}^2:|y|\le r{t}^b,t\ge 0\}$ (two-sided exit), $0\le blt;1$, as $r\downarrow 0$. Thus essentially we determine whether or not these passage times behave like deterministic functions in the sense of different modes of convergence; specifically convergence in probability, almost surely and in $L^p$. In many instances these are...

We study a continuous time growth process on the $d$-dimensional hypercubic lattice ${𝒵}^d$, which admits a phenomenological interpretation as the combustion reaction $A+B\to 2A$, where $A$ represents heat particles and $B$ inert particles. This process can be described as an interacting particle system in the following way: at time 0 a simple symmetric continuous time random walk of total jump rate one begins to move from the origin of the hypercubic lattice; then, as soon as any random walk visits a site...

Let $m\ge 3$ be an integer. The so-calledis a discrete time Markov chain which is very popular in theoretical computer science, modelling famous algorithms used in searching and sorting. This random process satisfies a well-known phase transition: when $m\le 26$, the asymptotic behavior of the process is Gaussian, but for $m\ge 27$ it is no longer Gaussian and a limit $W^{DT}$ of a complex-valued martingale arises. In this paper, we consider the multitype branching process which is the continuous time version of...

Suppose that $𝒢$ is a finite, connected graph and $X$ is a lazy random walk on $𝒢$. The lamplighter chain $X^{\diamond }$ associated with $X$ is the random walk on the wreath product ${𝒢}^{\diamond }={𝐙}_2\wr 𝒢$, the graph whose vertices consist of pairs $(\underline{f},x)$ where $f$ is a labeling of the vertices of $𝒢$ by elements of ${𝐙}_2=\{0,1\}$ and $x$ is a vertex in $𝒢$. There is an edge between $(\underline{f},x)$ and $(\underline{g},y)$ in ${𝒢}^{\diamond }$ if and only if $x$ is adjacent to $y$ in $𝒢$ and $f_z=g_z$ for all $z\ne x,y$. In each step, $X^{\diamond }$ moves from a configuration $(\underline{f},x)$ by updating $x$ to $y$ using the transition rule of $X$ and then...

We prove that, assuming , if $X$ is a space with ${\aleph }_1$-calibre and a zeroset diagonal, then $X$ is submetrizable. This gives a consistent positive answer to the question of Buzyakova in Observations on spaces with zeroset or regular $G_{\delta }$-diagonals, Comment. Math. Univ. Carolin. 46 (2005), no. 3, 469–473. We also make some observations on spaces with ${\aleph }_1$-calibre.

For a number field $K$ with ring of integers ${𝒪}_K$, we prove an analogue over finite rings of the form ${𝒪}_K/{𝒫}^m$ of the fundamental theorem on the Fourier transform of a relative invariant of prehomogeneous vector spaces, where $𝒫$ is a big enough prime ideal of ${𝒪}_K$ and $m\>1$. In the appendix, F.Sato gives an application of the Theorems 1.1, 1.3 and the Theorems A, B, C in J.Denef and A.Gyoja [, Compos. Math., (1998), 237–346] to the functional equation of $L$-functions of Dirichlet type associated with prehomogeneous...

Let $\varphi$ be a substitution of Pisot type on the alphabet $𝒜=\{1,2,...,d\}$; $\varphi$ satisfies theif for every $i,j\in 𝒜$, there are integers $k,n$ such that ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same $k$-th letter, and the prefixes of length $k-1$ of ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same image under the abelianization map. We prove that the strong coincidence condition is satisfied if $d=2$ and provide a partial result for $d\ge 2$.

A vertex $k$-coloring of a graph $G$ is a if $M\left(u\right)\ne M\left(v\right)$ for every edge $uv\in E\left(G\right)$, where $M\left(u\right)$ and $M\left(v\right)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$ has a multiset $k$-coloring is the ${\chi }_m\left(G\right)$ of $G$. For an integer $\ell \ge 0$, the $\ell$- of a graph $G$, ${\mathrm{cor}}^{\ell }\left(G\right)$, is the graph obtained from $G$ by adding, for each vertex $v$ in $G$, $\ell$ new neighbors which are end-vertices. In this paper, the multiset chromatic numbers are determined for $\ell$- of all complete graphs, the regular complete...

We will consider the following problem $$-\Delta u-\lambda \frac{u}{{\left|x\right|}^2}={\left|\nabla u\right|}^p+cf,u\>0\text{in}\Omega ,$$ where $\Omega \subset {ℝ}^N$ is a domain such that $0\in \Omega$, $N\ge 3$, $c\>0$ and $\lambda \>0$. The main objective of this note is to study the precise threshold $p_{+}=p_{+}\left(\lambda \right)$ for which there is novery weak supersolutionif $p\ge p_{+}\left(\lambda \right)$. The optimality of $p_{+}\left(\lambda \right)$ is also proved by showing the solvability of the Dirichlet problem when $1\le p\<p_{+}\left(\lambda \right)$, for $c\>0$ small enough and $f\ge 0$ under some hypotheses that we will prescribe.

We study a branching random walk on $ℝ$ with an absorbing barrier. The position of the barrier depends on the generation. In each generation, only the individuals born below the barrier survive and reproduce. Given a reproduction law, Biggins et al. [ (1991) 573–581] determined whether a linear barrier allows the process to survive. In this paper, we refine their result: in the boundary case in which the speed of the barrier matches the speed of the minimal position of a...

In this paper, we study the size of the giant component $C_G$ in the random geometric graph $G=G(n,r_n,f)$ of $n$ nodes independently distributed each according to a certain density $f(·)$ in ${[0,1]}^2$ satisfying ${inf}_{x\in {[0,1]}^2}f\left(x\right)gt;$ $0$. If $\frac{c_1}{n}\le r_n^2\le c_2\frac{logn}{n}$ for some positive constants $c_1$, $c_2$ and $n{r}_n^2⟶\infty$ as $n\to \infty$, we show that the giant component of $G$ contains at least $n-\mathrm{o}\left(n\right)$ nodes with probability at least $1-{\mathrm{e}}^{-\beta n{r}_n^2}$ for all $n$ and for some positive constant $\beta$. We also obtain estimates on the diameter and number of the non-giant components of $G$.

For each n ≥ 1, let $v_{n,k},k\ge 1$ and $u_{n,k},k\ge 1$ be mutually independent sequences of nonnegative random variables and let each of them consist of mutually independent and identically distributed random variables with means v̅ₙ and u̅̅ₙ, respectively. Let $X{ₙ}^B\left(t\right)=(1/cₙ){\sum }_{j=1}^{\left[nt\right]}(v_{n,j}-v̅ₙ)$, $X{ₙ}^A\left(t\right)=(1/cₙ){\sum }_{j=1}^{\left[nt\right]}(u_{n,j}-u̅̅ₙ)$, t ≥ 0, and $Xₙ=X{ₙ}^B-X{ₙ}^A$. The main result gives conditions under which the weak convergence $Xₙ\stackrel{}{\to }X$, where X is a Lévy process, implies $X{ₙ}^B\stackrel{}{\to }{X}^B$ and $X{ₙ}^A\stackrel{}{\to }{X}^A$, where $X^B$ and $X^A$ are mutually independent Lévy processes and $X=X^B-X^A$.

We consider random walk on a discrete torus $E$ of side-length $N$, in sufficiently high dimension $d$. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time $u{N}^d$. We show that when $u$ is chosen small, as $N$ tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const $logN$. Moreover, this connected component occupies a...

We consider the spatial $𝛬$-Fleming–Viot process model ( (2010) 162–216) for frequencies of genetic types in a population living in ${ℝ}^d$, in the special case in which there are just two types of individuals, labelled $0$ and $1$. At time zero, everyone in a given half-space has type 1, whereas everyone in the complementary half-space has type $0$. We are concerned with patterns of frequencies of the two types at large space and time scales. We consider two cases, one in which the...