English
Related papers

Related papers: On the functional CLT for slowly mixing triangular…

200 papers

Let $(\mathfrak{M},\rho,\mu)$ be a metric measure space satisfying a doubling condition, $p_0\in (1,\infty)$, and $T(t):L^{p_0}(\mathfrak{M},\mu)\rightarrow L^{p_0}(\mathfrak{M},\mu)$, $t\geq 0$, a strongly continuous semi-group. We provide…

Analysis of PDEs · Mathematics 2026-01-13 Brian Street

In the present paper, as a continuation of our preceding paper [10], we study another kind of central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a viewpoint of discrete geometric analysis…

Probability · Mathematics 2021-08-17 Satoshi Ishiwata , Hiroshi Kawabi , Ryuya Namba

This paper deals with the extreme value analysis for the triangular arrays, which appear when some parameters of the mixture model vary as the number of observations grow. When the mixing parameter is small, it is natural to associate one…

Statistics Theory · Mathematics 2021-03-17 Vladimir Panov , Ekaterina Morozova

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…

Probability · Mathematics 2020-05-15 Holger Sambale , Arthur Sinulis

We consider slow-roll inflationary models in a class of modified theories of gravity which contains non-minimal curvature-inflaton couplings, i.e., the $f(R,T)$ gravity, where $R$ is the Ricci scalar and $T$ is the trace of the inflaton…

General Relativity and Quantum Cosmology · Physics 2022-11-07 Che-Yu Chen , Yakefu Reyimuaji , Xinyi Zhang

In this paper we study asymptotic properties of different data-augmentation-type Markov chain Monte Carlo algorithms sampling from mixture models comprising discrete as well as continuous random variables. Of particular interest to us is…

Computation · Statistics 2014-04-04 Randal Douc , Florian Maire , Jimmy Olsson

We establish a central limit theorem (CLT) for families of products of $\epsilon$-independent random variables. We utilize graphon limits to encode the evolution of independence and characterize the limiting distribution. Our framework…

Probability · Mathematics 2025-04-15 Guillaume Cébron , Patrick Oliveira Santos , Pierre Youssef

We consider stochastic optimization problems with the dual tasks of (i) effectively finding the optimizer and (ii) reliably conducting statistical inference for the optimal objective function value. We find that classical simulation…

Methodology · Statistics 2025-09-15 Yuhang Wu , Zeyu Zheng , Yingfei Wang , Guangyu Zhang , Zuohua Zhang , Chu Wang

In this paper, we build upon the asymptotic theory for GARCH processes, considering the general class of augmented GARCH($p$, $q$) processes. Our contribution is to complement the well-known univariate asymptotics by providing a joint…

Statistics Theory · Mathematics 2019-12-24 Marcel Bräutigam , Marie Kratz

The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…

Logic in Computer Science · Computer Science 2024-08-07 Daniel Hausmann , Lutz Schröder

Under an appropriate regular variation condition, the affinely normalized partial sums of a sequence of independent and identically distributed random variables converges weakly to a non-Gaussian stable random variable. A functional version…

Probability · Mathematics 2012-10-12 Bojan Basrak , Danijel Krizmanić , Johan Segers

Realizing the potential for predictive density functional calculations of matter under extreme conditions depends crucially upon having an exchange-correlation (XC) free energy functional accurate over a wide range of state conditions.…

Materials Science · Physics 2018-02-21 Valentin V. Karasiev , James W. Dufty , S. B. Trickey

The Local Search algorithm (or Hill Climbing, or Iterative Improvement) is one of the simplest heuristics to solve the Satisfiability and Max-Satisfiability problems. It is a part of many satisfiability and max-satisfiability solvers, where…

Data Structures and Algorithms · Computer Science 2008-11-18 Andrei A. Bulatov , Evgeny S. Skvortsov

For a given pair of positive integers $d$ and $N$ with $N \geq 2$, for strictly stationary random fields that are indexed by the $d$-dimensional integer lattice and satisfy $N$-tuplewise independence, the dependence coefficients associated…

Probability · Mathematics 2011-07-21 Richard C. Bradley

For a well-posed non-selfadjoint indefinite second-order linear elliptic PDE with general coefficients $\mathbf A, \mathbf b,\gamma$ in $L^\infty$ and symmetric and uniformly positive definite coefficient matrix $\mathbf A$, this paper…

Numerical Analysis · Mathematics 2022-03-10 C. Carstensen , Neela Nataraj , Amiya K. Pani

We study mixing for a divergence-free passive vector field $u$ transported by another divergence-free vector field $U$, where $u$ evolves according to $ \partial_t u + (U \cdot \nabla) u + \nabla p = 0.$ In recent years, a lot of attention…

Analysis of PDEs · Mathematics 2026-05-14 Anuj Kumar , Franziska Weber

One of the most important optimality conditions to aid to solve a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality…

We consider linear spectral statistics of the form $\mathrm{tr} ( \varphi (H))$ for test functions $\varphi$ of low regularity and Wigner matrices $H$ with smooth entry distribution. We show that for functions $\varphi$ in the Sobolev space…

Probability · Mathematics 2022-04-08 Benjamin Landon , Philippe Sosoe

We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…

Numerical Analysis · Mathematics 2018-07-10 Peter Kritzer , Henryk Wozniakowski

Correlation Clustering (CC) is a fundamental unsupervised learning primitive whose strongest LP-based approximation guarantees require $\Theta(n^3)$ triangle inequality constraints and are prohibitive at scale. We initiate the study of…

Machine Learning · Computer Science 2026-02-17 Ibne Farabi Shihab , Sanjeda Akter , Anuj Sharma
‹ Prev 1 8 9 10 Next ›