Small time convergence of subordinators with regularly or slowly varying canonical measure

We consider subordinators $X_{\alpha }={\left(X_{\alpha }\left(t\right)\right)}_{t\ge 0}$ in the domain of attraction at 0 of a stable subordinator ${\left(S_{\alpha }\left(t\right)\right)}_{t\ge 0}$ (where $\alpha \in (0,1)$); thus, with the property that ${\overline{\Pi }}_{\alpha }$, the tail function of the canonical measure of $X_{\alpha }$, is regularly varying of index $?\alpha \in (?1,0)$ as $x\downarrow 0$. We also analyse the boundary case, $\alpha =0$, when ${\overline{\Pi }}_{\alpha }$ is slowly varying at 0. When $\alpha \in (0,1)$, we show that ${\left(t{\overline{\Pi }}_{\alpha }\left(X_{\alpha }\left(t\right)\right)\right)}^{?1}$ converges in distribution, as $t\downarrow 0$, to the random variable ${\left(S_{\alpha }\left(1\right)\right)}^{\alpha }$. This latter random variable, as a function of $\alpha$, converges in distribution as $\alpha \downarrow 0$ to the inverse of an exponential random variable. We prove these convergences, also generalised to functional versions (convergence in $\mathbb{D}[0,1]$), and to trimmed versions, whereby a fixed number of its largest jumps up to a specified time are subtracted from the process. The $\alpha =0$ case produces convergence to an extremal process constructed from ordered jumps of a Cauchy subordinator. Our results generalise random walk and stable process results of Darling, Cressie, Kasahara, Kotani and Watanabe.     

Properties of G-martingales with finite variation and the application to G-Sobolev spaces

As is known, if $B={\left(B_t\right)}_{t\in [0,T]}$ is a $G$-Brownian motion, a process of form ${\int }_0^t{\eta }_{s}d{〈B〉}_s?{\int }_0^{t}2G\left({\eta }_s\right)ds$, $\eta \in M_G^1(0,T)$, is a non-increasing $G$-martingale. In this paper, we shall show that a non-increasing $G$-martingale cannot be form of ${\int }_0^t{\eta }_{s}ds$ or ${\int }_0^t{\gamma }_{s}d{〈B〉}_s$, $\eta ,\gamma \in M_G^1(0,T)$, which implies that the decomposition for generalized $G$-Itô processes is unique: For arbitrary $\zeta \in H_G^1(0,T)$, $\eta \in M_G^1(0,T)$ and non-increasing $G$-martingales $K,L$, if ${\int }_0^t{\zeta }_{s}d{B}_s+{\int }_0^t{\eta }_{s}ds+K_t=L_t,t\in [0,T],$then we have $\eta \equiv 0$, $\zeta \equiv 0$ and$K_t=L_t$. As an application, we give a characterization to the $G$-Sobolev spaces introduced in Peng and Song (2015).     

Refined basic couplings and Wasserstein-type distances for SDEs with Lévy noises

We establish the exponential convergence with respect to the $L^1$-Wasserstein distance and the total variation for the semigroup corresponding to the stochastic differential equation $d{X}_t=d{Z}_t+b\left(X_t\right)dt,$where ${\left(Z_t\right)}_{t\ge 0}$ is a pure jump Lévy process whose Lévy measure $\nu$ fulfills $\underset{x\in {\mathbb{R}}^d,\left|x\right|\le {\kappa }_0}{inf}[\nu \wedge ({\delta }_{x}1\nu )]\left({\mathbb{R}}^d\right)>0$for some constant ${\kappa }_0>0$, and the drift term $b$ satisfies that for any $x,y\in {\mathbb{R}}^d$, $〈b\left(x\right)?b\left(y\right),x?y〉\le \left\{\begin{array}{cc}{\Phi }_1\left(\right|x?y\left|\right)|x?y|,\hfill & |x?y|<l_0;\hfill \\ ?K_2|x?y{|}^2,\hfill & |x?y|\ge l_0\hfill \end{array}\right.$with some positive constants $K_2,l_0$ and positive measurable function ${\Phi }_1$. The method is based on the refined basic coupling for Lévy jump processes. As a byproduct, we obtain sufficient conditions for the strong ergodicity of the process ${\left(X_t\right)}_{t\ge 0}$.     

Point partition numbers: Decomposable and indecomposable critical graphs

Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number ${\chi }_t(G)$ is the least integer k for which G admits a coloring with k colors such that each color class induces a $(t?1)$-degenerate subgraph of G. So ${\chi }_1$ is the chromatic number and ${\chi }_2$ is the point arboricity. The point partition number ${\chi }_t$ with $t\ge 1$ was introduced by Lick and White. A graph G is called ${\chi }_t$-critical if every proper subgraph H of G satisfies ${\chi }_t(H)<{\chi }_t(G)$. In this paper we prove that if G is a ${\chi }_t$-critical graph whose order satisfies $|G|\le 2{\chi }_t(G)?2$, then G can be obtained from two non-empty disjoint subgraphs $G_1$ and $G_2$ by adding t edges between any pair $u,v$ of vertices with $u\in V(G_1)$ and $v\in V(G_2)$. Based on this result we establish the minimum number of edges possible in a ${\chi }_t$-critical graph G of order n and with ${\chi }_t(G)=k$, provided that $n\le 2k?1$ and t is even. For $t=1$ the corresponding two results were obtained in 1963 by Tibor Gallai.     

Stable-like fluctuations of Biggins’ martingales

Let ${\left(W_n\left(\theta \right)\right)}_{n\in {\mathbb{N}}_0}$ be Biggins’ martingale associated with a supercritical branching random walk, and let $W\left(\theta \right)$ be its almost sure limit. Under a natural condition for the offspring point process in the branching random walk, we show that if the law of $W_1\left(\theta \right)$ belongs to the domain of normal attraction of an $\alpha$-stable distribution for some $\alpha \in (1,2)$, then, as $n\to \infty$, there is weak convergence of the tail process ${(W\left(\theta \right)?W_{n?k}\left(\theta \right))}_{k\in {\mathbb{N}}_0}$, properly normalized, to a random scale multiple of a stationary autoregressive process of order one with $\alpha$-stable marginals.     

The survival probability of critical and subcritical branching processes in finite state space Markovian environment

Let ${\left(Z_n\right)}_{n\ge 0}$ be a branching process in a random environment defined by a Markov chain ${\left(X_n\right)}_{n\ge 0}$ with values in a finite state space $\mathbb{X}$. Let ${\mathbb{P}}_i$ be the probability law generated by the trajectories of ${\left(X_n\right)}_{n\ge 0}$ starting at $X_0=i\in \mathbb{X}.$ We study the asymptotic behaviour of the joint survival probability ${\mathbb{P}}_i\left(Z_n>0,X_n=j\right)$, $j\in \mathbb{X}$ as $n\to +\infty$ in the critical and strongly, intermediate and weakly subcritical cases.     

Fluctuation theory for level-dependent Lévy risk processes

A level-dependent Lévy process solves the stochastic differential equation $dU\left(t\right)=dX\left(t\right)??\left(U\left(t\right)\right)dt$, where $X$ is a spectrally negative Lévy process. A special case is a multi-refracted Lévy process with ${?}_k\left(x\right)={\sum }_{j=1}^k{\delta }_j{\mathbf{1}}_{\{x\ge b_j\}}$. A general rate function $?$ that is non-decreasing and locally Lipschitz continuous is also considered. We discuss solutions of the above stochastic differential equation and investigate the so-called scale functions, which are counterparts of the scale functions from the theory of Lévy processes. We show how fluctuation identities for $U$ can be expressed via these scale functions. We demonstrate that the derivatives of the scale functions are solutions of Volterra integral equations.     

Nonlinear stochastic time-fractional slow and fast diffusion equations on Rd

This paper studies the nonlinear stochastic partial differential equation of fractional orders both in space and time variables: $\left({?}^{\beta }+\frac{\nu }{2}{(?\Delta )}^{\alpha ∕2}\right)u(t,x)=I_t^{\gamma }\left[\rho \left(u(t,x)\right)\stackrel{?}{W}(t,x)\right],t>0,x\in {\mathbb{R}}^d,$where $\stackrel{?}{W}$ is the space–time white noise, $\alpha \in (0,2]$, $\beta \in (0,2)$, $\gamma \ge 0$ and $\nu >0$. Fundamental solutions and their properties, in particular the nonnegativity, are derived. The existence and uniqueness of solution together with the moment bounds of the solution are obtained under Dalang’s condition: $d<2\alpha +\frac{\alpha }{\beta }min(2\gamma ?1,0)$. In some cases, the initial data can be measures. When $\beta \in (0,1]$, we prove the sample path regularity of the solution.     

Fractional chromatic numbers of tensor products of three graphs

The tensor product $(G_1,G_2,G_3)$ of graphs $G_1$, $G_2$ and $G_3$ is defined by $V(G_1,G_2,G_3)=V\left(G_1\right)\times V\left(G_2\right)\times V\left(G_3\right)$and $E(G_1,G_2,G_3)=\left\{\left((u_1,u_2,u_3),(v_1,v_2,v_3)\right):\left|\{i:(u_i,v_i)\in E\left(G_i\right)\}\right|\ge 2\right\}.$Let ${\chi }_f\left(G\right)$ be the fractional chromatic number of a graph $G$. In this paper, we prove that if one of the three graphs $G_1$, $G_2$ and $G_3$ is a circular clique, ${\chi }_f(G_1,G_2,G_3)=min\{{\chi }_f\left(G_1\right){\chi }_f\left(G_2\right),{\chi }_f\left(G_1\right){\chi }_f\left(G_3\right),{\chi }_f\left(G_2\right){\chi }_f\left(G_3\right)\}.$     

Forcing clique immersions through chromatic number

Building on recent work of Dvořák and Yepremyan, we show that every simple graph of minimum degree $7t+7$ contains $K_t$ as an immersion and that every graph with chromatic number at least $3.54t+4$ contains $K_t$ as an immersion. We also show that every graph on $n$ vertices with no independent set of size three contains $K_{2\lfloor n∕5\rfloor }$ as an immersion.     

Spanning trees with at most 4 leaves in K1,5-free graphs

In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with ${\sigma }_4\left(G\right)\ge n?1$ contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected $K_{1,5}$-free graphs. We show that every $n$-vertex connected $K_{1,5}$-free graph $G$ with ${\sigma }_5\left(G\right)\ge n?1$ contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “${\sigma }_5\left(G\right)\ge n?1$” is best possible.     

Two disjoint shortest paths problem with non-negative edge length

In the two disjoint shortest paths problem ( 2-DSPP), the input is a graph (or a digraph) and its vertex pairs $(s_1,t_1)$ and $(s_2,t_2)$, and the objective is to find two vertex-disjoint paths $P_1$ and $P_2$ such that $P_i$ is a shortest path from $s_i$ to $t_i$ for $i=1,2$, if they exist. In this paper, we give a first polynomial-time algorithm for the undirected version of the 2-DSPP with an arbitrary non-negative edge length function.     

On color isomorphic subdivisions

Given a graph H and an integer $k?2$, let $f_k(n,H)$ be the smallest number of colors C such that there exists a proper edge-coloring of the complete graph $K_n$ with C colors containing no k vertex-disjoint color isomorphic copies of H. In this paper, we prove that $f_2(n,H_t)=\mathrm{\Omega }(n^{1+\frac{1}{2t?3}})$ where $H_t$ is the 1-subdivision of the complete graph $K_t$. This answers a question of Conlon and Tyomkyn (2021) [4].     

On the concentration phenomenon of L2-subcritical constrained minimizers for a class of Kirchhoff equations with potentials

In this paper, we study the existence and concentration behavior of minimizers for $i_V(c)=\underset{u\in S_c}{\inf }?I_V(u)$, here $S_c=\{u\in H^1({\mathbb{R}}^N)|{\int }_{{\mathbb{R}}^N}V(x)|u{|}^2<+\infty ,|u{|}_2=c>0\}$ and

$I_V(u)=\frac{1}{2}\underset{{\mathbb{R}}^N}{\int }(a|\mathrm{?}u{|}^2+V(x)|u{|}^2)+\frac{b}{4}{(\underset{{\mathbb{R}}^N}{\int }|\mathrm{?}u{|}^2)}^2?\frac{1}{p}\underset{{\mathbb{R}}^N}{\int }|u{|}^p,$

where $N=1,2,3$ and $a,b>0$ are constants. By the Gagliardo–Nirenberg inequality, we get the sharp existence of global constraint minimizers of $i_V(c)$ for $2<p<2^{?}$ when $V(x)\ge 0$, $V(x)\in {L^{\infty }}_{loc}({\mathbb{R}}^N)$ and $\underset{|x|\to +\infty }{\lim }?V(x)=+\infty$. For the case $p\in (2,\frac{2N+8}{N})\backslash \{4\}$, we prove that the global constraint minimizers $u_c$ of $i_V(c)$ behave like

$u_c(x)\approx \frac{c}{|Q_p{|}_2}{\left(\frac{m_c}{c}\right)}^{\frac{N}{2}}{Q}_p(\frac{m_c}{c}x?z_c),$

for some $z_c\in {\mathbb{R}}^N$ when c is large, where $Q_p$ is, up to translations, the unique positive solution of $?\frac{N(p?2)}{4}\mathrm{\Delta }{Q}_p+\frac{2N?p(N?2)}{4}{Q}_p=|Q_p{|}^{p?2}{Q}_p$ in ${\mathbb{R}}^N$ and $m_c={(\frac{\sqrt{a^2{D}_1^2?4b{D}_2{i}_0(c)}+a{D}_1}{2b{D}_2})}^{\frac{1}{2}}$, $D_1=\frac{Np?2N?4}{2N(p?2)}$ and $D_2=\frac{2N+8?Np}{4N(p?2)}$.