English
Related papers

Related papers: A Note on the Conditions for COS Convergence

200 papers

We consider the linear conic optimization problem with the cone of nonnegative polynomials. Its dual optimization problem is the generalized moment problem. Moment-SOS relaxations are powerful for solving them. This paper studies finite…

Optimization and Control · Mathematics 2024-07-08 Lei Huang , Jiawang Nie , Ya-Xiang Yuan

We study the rate of convergence in the Shape Theorem of first-passage percolation, obtaining the precise asymptotic rate of decay for the probability of linear order deviations under a moment condition. Our results are stated for a given…

Probability · Mathematics 2014-08-06 Daniel Ahlberg

One considers polynomial optimization problems with compact feasible set $\mathbf{\Omega}$ defined by SOS-concave polynomials $g_j$, and with a globally non-convex polynomial objective $f$. We show that if $f$ is strongly convex on…

Optimization and Control · Mathematics 2026-03-03 Srećko Ðurašinović , Jean B. Lasserre

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…

Data Structures and Algorithms · Computer Science 2019-07-09 Maryam Aliakbarpour , Themis Gouleakis , John Peebles , Ronitt Rubinfeld , Anak Yodpinyanee

In this article we study the expanding properties of random perturbations of contracting Lorenz maps satisfying the summability condition of exponent 1. Under general conditions on the maps and perturbation types, we prove stochastic…

Dynamical Systems · Mathematics 2026-04-10 Haoyang Ji

We consider the problem of estimating the support size of a distribution $D$. Our investigations are pursued through the lens of distribution testing and seek to understand the power of conditional sampling (denoted as COND), wherein one is…

Data Structures and Algorithms · Computer Science 2022-11-23 Diptarka Chakraborty , Gunjan Kumar , Kuldeep S. Meel

Generalizing earlier results on dust collapse in higher dimensions, we show here that cosmic censorship can be restored in gravitational collapse with tangential pressure present if we take the spacetime dimension to be $N\ge6$. This is…

General Relativity and Quantum Cosmology · Physics 2009-11-11 Ashutosh Mahajan , Rituparno Goswami , Pankaj S. Joshi

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

Existing guarantees for algorithms sampling from nonlogconcave measures on $\mathbb{R}^d$ are generally inexplicit or unscalable. Even for the class of measures with logdensities that have bounded Hessians and are strongly concave outside a…

Computation · Statistics 2025-05-27 Martin Chak

We study non-uniform percolation in a two-dimensional cluster growth model with multiple seeds. With increasing concentration of seeds, the percolation threshold is found to increase monotonically, while the exponents for correlation…

Disordered Systems and Neural Networks · Physics 2014-10-08 Hongting Yang , Stephan Haas

We introduce a concept of porosity for measures and study relations between dimensions and porosities for two classes of measures: measures on $R^n$ which satisfy the doubling condition and strongly porous measures on $R$.

chao-dyn · Physics 2009-10-31 Jean-Pierre Eckmann , Esa Jarvenpaa , Maarit Jarvenpaa

The trapped Bose system can be regarded as two-dimensional if the thermal fluctuation energy is less than the lowest energy in the perpendicular direction. Under this assumption, we derive an expression for the maximum thickness of an…

Statistical Mechanics · Physics 2009-10-31 Sang-Hoon Kim

In this paper we explore the possibility of using computational algebraic methods to analyze a class of consensus protocols. We state some necessary conditions for convergence under consensus protocols that are polynomials.

Symbolic Computation · Computer Science 2011-07-20 Joel George Manathara , Ambedkar Dukkipati , Debasish Ghose

The celebrated theorem of Komlos asserts that L1-boundedness is sufficient for a given sequence of functions to contain a subsequence along which (in a "lacunary" manner), and along whose every further subsequence ("hereditarily"), a strong…

Probability · Mathematics 2026-02-27 Istvan Berkes , Ioannis Karatzas , Walter Schachermayer

We consider the well-known problem of the computation of the (limiting) time-dependent performance characteristics of one-dimensional continuous-time birth and death processes on $\mathbb{Z}$ with time varying and possible state-dependent…

Probability · Mathematics 2021-10-18 Yacov Satin , Rostislav Razumchik , Alexander Zeifman , Ivan Kovalev

Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structured problems, these global constants can…

Optimization and Control · Mathematics 2026-04-21 Faris Chaudhry , Anthea Monod , Keisuke Yano

We establish general conditions under which there exists uniform in time convergence between a stochastic process and its approximated system. These standardised conditions consist of a local in time estimate between the original and the…

Probability · Mathematics 2024-12-09 Katharina Schuh , Iain Souttar

We study convergence properties of the full truncation Euler scheme for the Cox-Ingersoll-Ross process in the regime where the boundary point zero is inaccessible. Under some conditions on the model parameters (precisely, when the Feller…

Computational Finance · Quantitative Finance 2018-10-09 Andrei Cozma , Christoph Reisinger

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

This work establishes new convergence guarantees for gradient descent in smooth convex optimization via a computer-assisted analysis technique. Our theory allows nonconstant stepsize policies with frequent long steps potentially violating…

Optimization and Control · Mathematics 2024-02-06 Benjamin Grimmer
‹ Prev 1 3 4 5 6 7 10 Next ›