We show that the only flow solving the stochastic differential equation (SDE) on $ℝ$ $$\mathrm{d}{X}_t=1_{\{X_{t}gt;0\}}{W}^{+}\left(\mathrm{d}t\right)+1_{\{X_{t}lt;0\}}\mathrm{d}{W}^{-}\left(\mathrm{d}t\right),$$ where $W^{+}$ and $W^{-}$ are two independent white noises, is a coalescing flow we will denote by ${\varphi }^{\pm }$. The flow ${\varphi }^{\pm }$ is a Wiener solution of the SDE. Moreover, $K^{+}=𝖤\left[{\delta }_{{\varphi }^{\pm }}\right|W^{+}]$ is the unique solution (it is also a Wiener solution) of the SDE $$K_{s,t}^{+}f\left(x\right)=f\left(x\right)+{\int }_s^t{K}_{s,u}\left(1_{ℝ}^{+}{f}^{\text{'}}\right)\left(x\right)W^{+}\left(\mathrm{d}u\right)+\frac{1}{2}{\int }_s^t{K}_{s,u}f``\left(x\right)\mathrm{d}u$$ for $slt;t$, $x\in ℝ$ and $f$ a twice continuously differentiable function. A third flow ${\varphi }^{+}$ can be constructed out of the $n$-point motions of $K^{+}$. This flow is coalescing and its $n$-point motion...

We study supercritical branching Brownian motion on the real line starting at the origin and with constant drift $c$. At the point $xgt;0$, we add an absorbing barrier, i.e. individuals touching the barrier are instantly killed without producing offspring. It is known that there is a critical drift $c_0$, such that this process becomes extinct almost surely if and only if $c\ge c_0$. In this case, if $Z_x$ denotes the number of individuals absorbed at the barrier, we give an asymptotic for $P(Z_x=n)$ as $n$ goes to infinity....

We consider the hexagonal circle packing with radius $1/2$ and perturb it by letting the circles move as independent Brownian motions for time $t$. It is shown that, for large enough $t$, if ${𝛱}_t$ is the point process given by the center of the circles at time $t$, then, as $t\to \infty$, the critical radius for circles centered at ${𝛱}_t$ to contain an infinite component converges to that of continuum percolation (which was shown – based on a Monte Carlo estimate – by Balister, Bollobás and Walters to be strictly...

In this paper we give a construction of operators satisfying q-CCR relations for q > 1: $A\left(f\right)A*\left(g\right)-A*\left(g\right)A\left(f\right)=q^N⟨f,g⟩I$ and also q-CAR relations for q < -1: $B\left(f\right)B*\left(g\right)+B*\left(g\right)B\left(f\right)={\left|q\right|}^N⟨f,g⟩I$, where N is the number operator on a suitable Fock space ${ℱ}_q\left(\right)$ acting as Nx₁ ⊗ ⋯ ⊗ xₙ = nx₁ ⊗ ⋯ ⊗xₙ. Some applications to combinatorial problems are also given.

Let (M,d) be a metric space with a fixed origin O. P. Lévy defined Brownian motion X(a); a ∈ M as 0. X(O) = 0. 1. X(a) - X(b) is subject to the Gaussian law of mean 0 and variance d(a,b). He gave an example for $M=S^m$, the m-dimensional sphere. Let $Y\left(B\right);B\in ℬ\left(S^m\right)$ be the Gaussian random measure on $S^m$, that is, 1. Y(B) is a centered Gaussian system, 2. the variance of Y(B) is equal of μ(B), where μ is the uniform measure on $S^m$, 3. if B₁ ∩ B₂ = ∅ then Y(B₁) is independent of Y(B₂). 4. for $B_i$, i = 1,2,..., $B_i\cap B_j=\varnothing$,...

A linear Boltzmann equation is interpreted as the forward equation for the probability density of a Markov process $\left(K\right(t),i(t),Y(t\left)\right)$ on $({𝕋}^2\times \{1,2\}\times {ℝ}^2)$, where ${𝕋}^2$ is the two-dimensional torus. Here $\left(K\right(t),i(t\left)\right)$ is an autonomous reversible jump process, with waiting times between two jumps with finite expectation value but infinite variance. $Y\left(t\right)$ is an additive functional of $K$, defined as ${\int }_0^{t}v\left(K\left(s\right)\right)\mathrm{d}s$, where $\left|v\right|\sim 1$ for small $k$. We prove that the rescaled process ${(NlnN)}^{-1/2}Y\left(Nt\right)$ converges in distribution to a two-dimensional Brownian motion. As a consequence,...

A graph $G=(V,E)$ is called improperly $(d_1,\cdots ,d_k)$-colorable if the vertex set $V$ can be partitioned into subsets $V_1,\cdots ,V_k$ such that the graph $G\left[V_i\right]$ induced by the vertices of $V_i$ has maximum degree at most $d_i$ for all $1\le i\le k$. In this paper, we mainly study the improper coloring of $1$-planar graphs and show that $1$-planar graphs with girth at least $7$ are $(2,0,0,0)$-colorable.

A proper vertex coloring of a graph $G$ is acyclic if there is no bicolored cycle in $G$. In other words, each cycle of $G$ must be colored with at least three colors. Given a list assignment $L=\left\{L\right(v):v\in V\}$, if there exists an acyclic coloring $\pi$ of $G$ such that $\pi \left(v\right)\in L\left(v\right)$ for all $v\in V$, then we say that $G$ is acyclically $L$-colorable. If $G$ is acyclically $L$-colorable for any list assignment $L$ with $\left|L\right(v\left)\right|\ge k$ for all $v\in V$, then $G$ is acyclically $k$-choosable. In 2006, Montassier, Raspaud and Wang conjectured that every planar graph without...

A proper coloring $c:V\left(G\right)\to \{1,2,...,k\}$, $k\ge 2$ of a graph $G$ is called a graceful $k$-coloring if the induced edge coloring $c^{\text{'}}:E\left(G\right)\to \{1,2,...,k-1\}$ defined by $c^{\text{'}}\left(uv\right)=|c\left(u\right)-c\left(v\right)|$ for each edge $uv$ of $G$ is also proper. The minimum integer $k$ for which $G$ has a graceful $k$-coloring is the graceful chromatic number ${\chi }_g\left(G\right)$. It is known that if $T$ is a tree with maximum degree $\Delta$, then ${\chi }_g\left(T\right)\le \lceil \frac{5}{3}\Delta \rceil$ and this bound is best possible. It is shown for each integer $\Delta \ge 2$ that there is an infinite class of trees $T$ with maximum degree $\Delta$ such that ${\chi }_g\left(T\right)=\lceil \frac{5}{3}\Delta \rceil$. In particular, we investigate for each...

Let $P$ be a discrete multidimensional probability distribution over a finite set of variables $N$ which is only partially specified by the requirement that it has prescribed given marginals $\{P_A;A\in 𝒮\}$, where $𝒮$ is a class of subsets of $N$ with $\bigcup 𝒮=N$. The paper deals with the problem of approximating $P$ on the basis of those given marginals. The divergence of an approximation $\widehat{P}$ from $P$ is measured by the relative entropy $H\left(P\right|\widehat{P})$. Two methods for approximating $P$ are compared. One of them uses formerly introduced...