English
Related papers

Related papers: Strategies for Asymptotic Normalization

200 papers

An asymptotic interation method for solving second-order homogeneous linear differential equations of the form y'' = lambda(x) y' + s(x) y is introduced, where lambda(x) \neq 0 and s(x) are C-infinity functions. Applications to Schroedinger…

Mathematical Physics · Physics 2009-11-10 Hakan Ciftci , Richard L. Hall , Nasser Saad

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Number Theory · Mathematics 2019-10-25 Kathrin Bringmann , Chris Jennings-Shaffer , Karl Mahlburg

This paper concerns the asymptotic behavior of a random variable $W_\lambda$ resulting from the summation of the functionals of a Gibbsian spatial point process over windows $Q_\lambda \uparrow R^d$. We establish conditions ensuring that…

Probability · Mathematics 2014-09-24 Aihua Xia , J. E. Yukich

We consider the method of self-similar renormalization for calculating critical temperatures and critical indices. A new optimized variant of the method for an effective summation of asymptotic series is suggested and illustrated by several…

Statistical Mechanics · Physics 2009-10-30 S. Gluzman , V. I. Yukalov

An autonomous system of ordinary differential equations describing nonlinear oscillations on the plane is considered. The influence of time-dependent perturbations decaying at infinity in time is investigated. It is assumed that the…

Dynamical Systems · Mathematics 2023-05-29 Oskar A. Sultanov

In this paper, we examine applications of the theory of operator-valued processes to algebraic methods in probability theory. We show a central limit theorem for general conservation operator processes. Utilizing this, we analyze the…

Probability · Mathematics 2025-11-04 Ryosuke Sato

An asymptotically optimal sampling-based planner employs sampling to solve robot motion planning problems and returns paths with a cost that converges to the optimal solution cost, as the number of samples approaches infinity. This…

Robotics · Computer Science 2022-01-07 Kostas E. Bekris , Rahul Shome

We obtain an asymptotic H\"older estimate for functions satisfying a dynamic programming principle arising from a so-called ellipsoid process. By the ellipsoid process we mean a generalization of the random walk where the next step in the…

Analysis of PDEs · Mathematics 2020-08-05 Ángel Arroyo , Mikko Parviainen

We study maximum-likelihood-type estimation for diffusion processes when the coefficients are nonrandom and observation occurs in nonsynchronous manner. The problem of nonsynchronous observations is important when we consider the analysis…

Statistics Theory · Mathematics 2022-07-04 Teppei Ogihara

Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…

Numerical Analysis · Mathematics 2026-03-19 Alireza Entezari , Arunava Banerjee

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

This paper features and elaborates recent developments and modifications in asymptotic techniques in solving differential equation in non linear dynamics. These methods are proved to be powerful to solve weakly as well as strongly non…

Mathematical Physics · Physics 2016-08-17 R. Dutta

Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both…

Logic in Computer Science · Computer Science 2011-06-28 Ugo Dal Lago , Margherita Zorzi

Non-standard distributional approximations have received considerable attention in recent years. They often provide more accurate approximations in small samples, and theoretical improvements in some cases. This paper shows that the…

Statistics Theory · Mathematics 2017-12-12 Matias D. Cattaneo , Michael Jansson , Whitney K. Newey

We consider a linear mixed-effects model with a clustered structure, where the parameters are estimated using maximum likelihood (ML) based on possibly unbalanced data. Inference with this model is typically done based on asymptotic theory,…

Statistics Theory · Mathematics 2021-03-30 Chih-Hao Chang , Hsin-Cheng Huang , Ching-Kang Ing

We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly…

Logic in Computer Science · Computer Science 2015-07-01 Jeroen Ketema , Jakob Grue Simonsen

We consider controlled martingales with bounded steps where the controller is allowed at each step to choose the distribution of the next step, and where the goal is to hit a fixed ball at the origin at time $n$. We show that the algebraic…

Probability · Mathematics 2016-06-23 Scott N. Armstrong , Ofer Zeitouni

In this paper, we consider the asymptotical regularization with convex constraints for nonlinear ill-posed problems. The method allows to use non-smooth penalty terms, including the L1-like and the total variation-like penalty functionals,…

Numerical Analysis · Mathematics 2022-03-23 Min Zhong , Wei Wang

We introduce the notion of perturbations of quantum stochastic models using the series product, and establish the asymptotic convergence of sequences of quantum stochastic models under the assumption that they are related via a right series…

Mathematical Physics · Physics 2019-04-18 Luc Bouten , John E. Gough

This paper examines restart strategies for algorithms whose successful termination depends on an unknown parameter $\lambda$. After each restart, $\lambda$ is increased, until the algorithm terminates successfully. It is assumed that there…

Optimization and Control · Mathematics 2025-01-20 Lisa Schönenberger , Hans-Georg Beyer