概率论

In this paper, we study purely discontinuous symmetric Markov processes on closed subsets of ${\mathbb R}^d$, $d\ge 1$, with jump kernels of the form $J(x,y)=|x-y|^{-d-\alpha}{\mathcal B}(x,y)$, $\alpha\in (0,2)$, where the function…

Muller's ratchet, in its prototype version, models a haploid, asexual population whose size~$N$ is constant over the generations. Slightly deleterious mutations are acquired along the lineages at a constant rate, and individuals carrying…

We study the long-time mixing behavior of the stochastic nonlinear Schr\"odinger equation in $\mathbb{R}^d$, $d\le 3$. It is well known that, under a sufficiently strong damping force, the system admits unique ergodicity, although the rate…

A new algorithm for exactly sampling from the set of proper colorings of a graph is presented. This is the first such algorithm that has an expected running time that is guaranteed to be linear in the size of a graph with maximum degree \(…

We consider a reflected process in the positive orthant driven by an exogenous jump process. For a given input process, we show that there exists a unique minimal strong solution to the given particle system up until a certain maximal…

Simple sufficient conditions are given that ensure the uniform continuity in distribution for Borel transformations of random fields.

In this paper, we prove that the Euclidean distance between two independent random vectors uniformly distributed on $l_p^n$-balls $(1 \leq p \leq \infty)$ or on its boundary satisfies a central limit theorem as $n$ tends to $\infty$. Also,…

In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by K\"onig, O'Connell and Roch. These processes describe movements of exchangeable interacting particles and are discrete…

We discuss a class of discrete Gaussian free fields on Hamming graphs, where interactions are determined solely by the Hamming distance between vertices. The purpose of examining this class is that it differs significantly from the commonly…

We study the critical branching random walk on $\mathbb{Z}^d$ started from a distant point $x$ and conditioned to hit some compact set $K$ in $\mathbb{Z}^d$. We are interested in the occupation time in $K$ and present its asymptotic…

We study the limiting spectral distribution of the normalized Laplacian $\mathcal L$ of an Erd\H{o}s-R\'enyi graph $G(n,p)$. To account for the presence of isolated vertices in the sparse regime, we define $\mathcal L$ using the…

We prove a sharp upper bound on negative moments of sums of independent Steinhaus random variables (that is uniform on circles in the plane). Together with the series of earlier works: K\"onig-Kwapie\'n (2001), Baernstein II-Culverhouse…

We survey classical localization problems arising from quantum network models in symmetry class C and their mappings to history-dependent random walks on directed lattices. We describe how localization versus delocalization of trajectories…

We introduce a general diploid population model with self-fertilization and possible overlapping generations, and study the genealogy of a sample of $n$ genes as the population size $N$ tends to infinity. Unlike traditional approach in…

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…

In this paper, we study the Backward stochastic Volterra integral equation driven by G-Brownian motion (G-BSVIE). By adopting a different backward iteration method, we construct the approximating sequences on each local interval. With the…

Under nondegeneracy assumptions on the diffusion coefficients, we establish the derivative formulae of Bismut-Elworthy-Li's type for forward-backward stochastic differential equations with respect to Poisson random measure using the lent…

Attach to each edge of the complete graph on $n$ vertices, i.i.d. exponential random variables with mean $n$. Aldous [1] proved that the longest path with average weight below $p$ undergoes a phase transition at $p=\frac{1}{e}$: it is…

We study the replica-symmetric saddle point equations for the Ising perceptron with Gaussian disorder and margin $\kappa\ge 0$. We prove that for each $\kappa\ge 0$ there is a critical capacity $\alpha_c(\kappa)=\frac{2}{\pi\,\mathbb…

By the Pr\'ekopa-Leindler inequality, the difference $X-X'$ has a log-concave density provided that $X$ has a log-concave density and $X, X'$ are independent and identically distributed. We prove that the opposite direction does not always…