Related papers: Central Limit Theorem for Euclidean Minimal Spanni…
In this paper, we study the averaging principle and central limit theorem for multi-scale stochastic differential equations with state-dependent switching. To accomplish this, we first study the Poisson equation associated with a Markov…
This article relaxes the integrability condition imposed in the literature for the robust $\alpha$-stable central limit theorem under sublinear expectation. Specifically, for $\alpha \in(0,1]$, we prove that the normalized sums of i.i.d.…
We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…
This paper investigates the boundary stabilization of an Euler-Bernoulli beam under constant axial tension and subject to an internal time-delay. First, the well-posedness of the system is established using semigroup of linear operators…
This work focuses on the temporal average of the backward Euler--Maruyama (BEM) method, which is used to approximate the ergodic limit of stochastic ordinary differential equations with super-linearly growing drift coefficients. We give the…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
We study one-dimensional nonlinear stochastic cable equations driven by a multiplicative space-time white noise. Using the Malliavin-Stein method, we prove a central limit theorem for the spatial average of the solution. The convergence is…
Consider~\(n\) nodes distributed independently across~\(N\) cities contained with the unit square~\(S\) according to a distribution~\(f.\) Each city is modelled as an~\(r_n \times r_n\) square contained within~\(S\) and~\(MSTC_n\) denotes…
We develop a general stability theory for equilibrium points of Poisson dynamical systems and relative equilibria of Hamiltonian systems with symmetries, including several generalisations of the Energy-Casimir and Energy-Momentum methods.…
For a weighted graph $G = (V, E, w)$ and a designated source vertex $s \in V$, a spanning tree that simultaneously approximates a shortest-path tree w.r.t. source $s$ and a minimum spanning tree is called a shallow-light tree (SLT).…
This work is devoted to study the existence of periodic solutions for a family of discontinuous differential systems $Z(x,y;\epsilon)$ with many zones. We show that for $\epsilon$ sufficiently small the averaged functions at any order…
The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens…
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…
Generalizing both Substable FSMs and Indicator FSMs, we introduce alpha-stabilized subordination, a procedure which produces new FSMs (H-sssi symmetric stable processes) from old ones. We extend these processes to isotropic stable fields…
We consider compactifications of type II string theory using exact internal CFT's with central charge $c=9+\epsilon$, $|\epsilon| \ll 1$, leading to an effective potential for the dilaton. For $\epsilon>0$ the potential is positive and the…
We study of the effect of weak noise on critical one dimensional maps; that is, maps with a renormalization theory. We establish a one dimensional central limit theorem for weak noises and obtain Berry--Esseen estimates for the rate of this…
Cellular signal transduction usually involves activation cascades, the sequential activation of a series of proteins following the reception of an input signal. Here we study the classic model of weakly activated cascades and obtain…
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n) \cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every…
We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…