English
Related papers

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

200 papers

This paper extends the blurring mean shift algorithm from vector-valued data to functional data, enabling effective clustering in infinite-dimensional settings without requiring specification of the number of clusters. To address the…

Methodology · Statistics 2026-04-14 Toshinari Morimoto , Ting-Li Chen , Su-Yun Huang , Ruey S. Tsay

This paper deals with Pareto solutions of a nonsmooth fractional interval-valued multiobjective optimization. We first introduce four types of Pareto solutions of the considered problem by considering the lower-upper interval order relation…

Optimization and Control · Mathematics 2022-12-26 Nguyen Huy Hung , Nguyen Van Tuyen

Let $(X_1 , \ldots , X_d)$ be random variables taking nonnegative integer values and let $f(z_1, \ldots , z_d)$ be the probability generating function. Suppose that $f$ is real stable; equivalently, suppose that the polarization of this…

Probability · Mathematics 2016-07-12 Subhroshekhar Ghosh , Thomas M. Liggett , Robin Pemantle

For a uniform process $\{ X_t: t\in E\}$ (by which $X_t $ is uniformly distributed on $(0,1)$ for $t\in E$) and a function $w(x)>0$ on $(0,1)$, we give a sufficient condition for the weak convergence of the empirical process based on $\{…

Probability · Mathematics 2014-12-30 Yuping Yang

In this paper, in the absence of any constraint qualifications, we develop sequential necessary and sufficient optimality conditions for a constrained multiobjective fractional programming problem characterizing a Henig proper efficient…

Optimization and Control · Mathematics 2023-03-13 Mohamed Bilal Moustaid , Mohamed Laghdir , Issam Dali Ahmed Rikouane

The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. We give a new characterization of…

We develop a new toolbox for the analysis of the global behavior of stochastic discrete particle systems. We introduce and study the notion of the Schur generating function of a random discrete configuration. Our main result provides a…

Probability · Mathematics 2021-01-01 Alexey Bufetov , Vadim Gorin

We present a phase condition under which there is no suitable multiplier for a given continuous-time plant. The condition can be derived from either the duality approach or from the frequency interval approach. The condition has a simple…

Optimization and Control · Mathematics 2021-09-03 William Paul Heath , Joaquin Carrasco , Jingfan Zhang

Ideal density-functional approximations (DFAs) should account for dynamic, static, and nondynamic correlation. While common DFAs struggle with the latter two, the Ziegler-Rauk-Baerends-Daul multiplet sum method (MSM) provides a pragmatic…

Chemical Physics · Physics 2026-05-29 Mark E Casida , Abraham Ponra , Gadzikano Munyuki , Bharathi Natarajan

We establish a central limit theorem for the fluctuations of the linear statistics in the $\beta$-ensemble of dimension $N$ at a temperature proportional to $N$ and with confining smooth potential. In this regime, the particles do not…

Probability · Mathematics 2024-11-12 Charlie Dworaczek Guera , Ronan Memin

(This is the third version of a working paper.) We develop a family of self-normalized concentration inequalities for marginal mean under martingale-difference structure and $\phi/\tilde{\phi}$-mixing conditions, where the latter includes…

Statistics Theory · Mathematics 2025-12-17 Zihao Yuan

In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie…

Dynamical Systems · Mathematics 2017-06-29 Michael Björklund , Alexander Gorodnik

In this paper, we develop necessary and sufficient conditions for the validity of a martingale approximation for the partial sums of a stationary process in terms of the maximum of consecutive errors. Such an approximation is useful for…

Probability · Mathematics 2011-02-11 Mikhail Gordin , Magda Peligrad

A broad class of optimization problems can be cast in composite form, that is, considering the minimization of the composition of a lower semicontinuous function with a differentiable mapping. This paper investigates the versatile template…

Optimization and Control · Mathematics 2024-08-07 Alberto De Marchi , Patrick Mehlitz

Motivated by random evolutions which do not start from equilibrium, in a recent work, Peligrad and Voln\'{y} (2018) showed that the quenched CLT (central limit theorem) holds for ortho-martingale random fields. In this paper, we study the…

Probability · Mathematics 2019-09-12 Na Zhang , Lucas Reding , Magda Peligrad

We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of K\"uhn and…

Combinatorics · Mathematics 2024-10-24 Eoin Hurley , Felix Joos , Richard Lang

The paper concerns the $d$-dimensional stochastic approximation recursion, $$ \theta_{n+1}= \theta_n + \alpha_{n + 1} f(\theta_n, \Phi_{n+1}) $$ where $ \{ \Phi_n \}$ is a stochastic process on a general state space, satisfying a…

Statistics Theory · Mathematics 2024-11-18 Vivek Borkar , Shuhang Chen , Adithya Devraj , Ioannis Kontoyiannis , Sean Meyn

We study the bootstrap for the maxima of the sums of independent random variables, a problem of high relevance to many applications in modern statistics. Since the consistency of bootstrap was justified by Gaussian approximation in…

Statistics Theory · Mathematics 2020-08-03 Hang Deng

Whereas classical invariance principles for ergodic Markov chains address the situation in which the time horizon of observations is much larger than the mixing time, the quality of approximation is questionable when this is not the case…

Probability · Mathematics 2026-05-12 Gabriele Bellerino , Angelika Rohde

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

Computational Complexity · Computer Science 2018-01-31 Giacomo Patrizi
‹ Prev 1 3 4 5 6 7 10 Next ›