Related papers: Central Limit Theorem for Euclidean Minimal Spanni…

Given a weighted toroidal graph, each realization to a Euclidean torus is associated with the Dirichlet energy. By minimizing the energy over all possible Euclidean structures and over all realizations within a fixed homotopy class, one…

We discuss the spectral asymptotics of some open subsets of the real line with random fractal boundary and of a random fractal, the continuum random tree. In the case of open subsets with random fractal boundary we establish the existence…

The hierarchical Dirichlet process is a discrete random measure used as a prior in Bayesian nonparametrics and motivated by the study of groups of clustered data. We study the asymptotic behavior of the power sum symmetric polynomials for…

We study a stationary Gibbs particle process with deterministically bounded particles on Euclidean space defined in terms of an activity parameter and non-negative interaction potentials of finite range. Using disagreement percolation we…

We prove the annealed Central Limit Theorem for random walks in bistochastic random environments on $Z^d$ with zero local drift. The proof is based on a "dynamicist's interpretation" of the system, and requires a much weaker condition than…

We present a fast and efficient method for studying vacuum stability constraints in multi-scalar theories beyond the Standard Model. This method is designed for a reliable use in large scale parameter scans. The minimization of the scalar…

We consider Robinson-Schensted-Knuth algorithm applied to a random input and study the growth of the bottom rows of the corresponding Young diagrams. We prove multidimensional Poisson limit theorem for the resulting Plancherel growth…

Aiming at monitoring a time series to detect stationarity as soon as possible, we introduce monitoring procedures based on kernel-weighted sequential Dickey-Fuller (DF) processes, and related stopping times, which may be called weighted…

We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…

In this paper, we investigate a class of multiscale McKean-Vlasov stochastic systems, where the entire system depends on the distributions of both fast and slow components. First of all, by applying the Poisson equation method, we prove…

In this paper, we study a class of multiscale McKean-Vlasov stochastic systems where the entire system depends on the distribution of the fast component. First of all, by the Poisson equation method we prove that the slow component…

Dirac's classical theorem asserts that, for $n \ge 3$, any $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular, then, by the breakthrough work of Csaba,…

In 1985, Frieze showed that the expected sum of the edge weights of the minimum spanning tree (MST) in the uniformly weighted graph converges to $\zeta(3)$. Recently, Hino and Kanazawa extended this result to a uniformly weighted simplicial…

We prove a nonstandard central limit theorem and weak invariance principle, with superdiffusive normalisation $(t\log t)^{1/2}$, for geodesic flows on a class of nonpositively curved surfaces with flat cylinder. We also prove that…

In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…

For $\alpha\in (1,2)$, we present a generalized central limit theorem for $\alpha$-stable random variables under sublinear expectation. The foundation of our proof is an interior regularity estimate for partial integro-differential…

We are concerned with the analysis of finite time collision trajectories for a class of singular anisotropic homogeneous potentials of degree $-\alpha$, with $\alpha\in(0,2)$ and their lower order perturbations. It is well known that, under…

Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…

In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in the literature. We study the problem where the neighborhoods…

This paper provides refined versions of some known functional central limit theorems for conditional Poisson sampling which are more suitable for applications. The theorems presented in this paper are generalizations of some results that…