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$.

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...

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...

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.

We study weakly precompact sets and operators. We show that an operator is weakly precompact if and only if its adjoint is pseudo weakly compact. We study Banach spaces with the $p$-$L$-limited${}^{*}$ and the $p$-(SR${}^{*}$) properties and characterize these classes of Banach spaces in terms of $p$-$L$-limited${}^{*}$ and $p$-Right${}^{*}$ subsets. The $p$-$L$-limited${}^{*}$ property is studied in some spaces of operators.

The authors first establish the Marcinkiewicz-Zygmund inequalities with exponent $p$ ($1\le p\le 2$) for $m$-pairwise negatively quadrant dependent ($m$-PNQD) random variables. By means of the inequalities, the authors obtain some limit theorems for arrays of rowwise $m$-PNQD random variables, which extend and improve the corresponding results in [Y. Meng and Z. Lin (2009)] and [H. S. Sung (2013)]. It is worthy to point out that the open problem of [H. S. Sung, S. Lisawadi, and A. Volodin (2008)] can be...

A Banach space $X$ has the reciprocal Dunford-Pettis property ($RDPP$) if every completely continuous operator $T$ from $X$ to any Banach space $Y$ is weakly compact. A Banach space $X$ has the $RDPP$ (resp. property $\left(wL\right)$) if every $L$-subset of $X^{*}$ is relatively weakly compact (resp. weakly precompact). We prove that the projective tensor product $X\otimes {}_{\pi }Y$ has property $\left(wL\right)$ when $X$ has the $RDPP$, $Y$ has property $\left(wL\right)$, and $L(X,Y^{*})=K(X,Y^{*})$.

We show that, given an n-dimensional normed space X, a sequence of $N={(8/\epsilon )}^{2n}$ independent random vectors ${\left(X_i\right)}_{i=1}^N$, uniformly distributed in the unit ball of X*, with high probability forms an ε-net for this unit ball. Thus the random linear map $\Gamma :ℝ\to {ℝ}^N$ defined by $\Gamma x={(⟨x,X_i⟩)}_{i=1}^N$ embeds X in ${\ell }_{\infty }^N$ with at most 1 + ε norm distortion. In the case X = ℓ₂ⁿ we obtain a random 1+ε-embedding into ${\ell }_{\infty }^N$ with asymptotically best possible relation between N, n, and ε.

The notion of $\beta$-normality was introduced and studied by Arhangel’skii, Ludwig in 2001. Recently, almost $\beta$-normal spaces, which is a simultaneous generalization of $\beta$-normal and almost normal spaces, were introduced by Das, Bhat and Tartir. We introduce a new generalization of normality, namely weak $\beta$-normality, in terms of $\theta$-closed sets, which turns out to be a simultaneous generalization of $\beta$-normality and $\theta$-normality. A space $X$ is said to be weakly $\beta$-normal (w$\beta$-normal$)$ if for every...

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...

Let $G$ be a simple graph, let $d\left(v\right)$ denote the degree of a vertex $v$ and let $g$ be a nonnegative integer function on $V\left(G\right)$ with $0\le g\left(v\right)\le d\left(v\right)$ for each vertex $v\in V\left(G\right)$. A $g_c$-coloring of $G$ is an edge coloring such that for each vertex $v\in V\left(G\right)$ and each color $c$, there are at least $g\left(v\right)$ edges colored $c$ incident with $v$. The $g_c$-chromatic index of $G$, denoted by ${\chi }_{g_c}^{\text{'}}\left(G\right)$, is the maximum number of colors such that a $g_c$-coloring of $G$ exists. Any simple graph $G$ has the $g_c$-chromatic index equal to ${\delta }_g\left(G\right)$ or ${\delta }_g\left(G\right)-1$, where ${\delta }_g\left(G\right)={min}_{v\in V\left(G\right)}\lfloor d\left(v\right)/g\left(v\right)\rfloor$. A graph $G$ is nearly bipartite,...

Let X be a Polish space, and let C₀ and C₁ be disjoint coanalytic subsets of X. The pair (C₀,C₁) is said to be complete if for every pair (D₀,D₁) of disjoint coanalytic subsets of ${\omega }^{\omega }$ there exists a continuous function $f:{\omega }^{\omega }\to X$ such that $f^{-1}\left(C₀\right)=D₀$ and $f^{-1}\left(C₁\right)=D₁$. We give several explicit examples of complete pairs of coanalytic sets.

The generalized $k$-connectivity ${\kappa }_k\left(G\right)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized $k$-edge-connectivity which is defined as ${\lambda }_k\left(G\right)=min\{\lambda \left(S\right):S\subseteq V\left(G\right)$ and $\left|S\right|=k\}$, where $\lambda \left(S\right)$ denotes the maximum number $\ell$ of pairwise edge-disjoint trees $T_1,T_2,...,T_{\ell }$ in $G$ such that $S\subseteq V\left(T_i\right)$ for $1\le i\le \ell$. In this paper we prove that for any two connected graphs $G$ and $H$ we have ${\lambda }_3(G\square H)\ge {\lambda }_3\left(G\right)+{\lambda }_3\left(H\right)$, where $G\square H$ is the Cartesian product of $G$ and $H$. Moreover, the bound is sharp. We also...