English
Related papers

Related papers: A solution to the problem of Rasa connected with B…

200 papers

In this paper, we remark on the published paper "Treatment of Set-Valued Robustness via Separation and Scalarization" [1], which deals with the robust solution to an uncertain constrained set-valued optimization problem via scalarization…

Optimization and Control · Mathematics 2025-11-04 Abhik Digar , Kuntal Som

In this paper we study the regularity of paths in terms of properties of admissible nets. We show the right concentration inequality above the modulus of continuity. Using the approach we prove the Bernstein type inequality for the…

Probability · Mathematics 2014-05-09 Witold Bednorz

Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) errors. Assuming complex Gaussian distributed CSI errors, this…

Information Theory · Computer Science 2010-11-11 Kun-Yu Wang , Tsung-Hui Chang , Wing-Kin Ma , Anthony Man-Cho So , Chong-Yung Chi

In the present paper, a Nystrom-type method for second kind Volterra integral equations is introduced and studied. The method makes use of generalized Bernstein polynomials, defined for continuous functions and based on equally spaced…

Numerical Analysis · Mathematics 2022-07-15 Luisa Fermo , Domenico Mezzanotte , Donatella Occorsio

A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on…

Probability · Mathematics 2009-12-09 Fraser Daly , Claude Lefèvre , Sergey Utev

We design the first polynomial time approximation schemes (PTASs) for the Minimum Betweenness problem in tournaments and some related higher arity ranking problems. This settles the approximation status of the Betweenness problem in…

Data Structures and Algorithms · Computer Science 2010-07-12 Marek Karpinski , Warren Schudy

It is known that Bernoulli scheme of independent trials with two outcomes is connected with the binomial coefficients. The aim of this paper is to indicate stochastic processes which are connected with the $q$-polynomial coefficients (in…

Combinatorics · Mathematics 2007-05-23 Alexander I. Il'inskii

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

Numerical Analysis · Mathematics 2025-04-15 Yousra Gati , Vladimir Petrov Kostov , Mohamed Chaouki Tarchi

In this paper, we study the Bernstein polynomial model for estimating the multivariate distribution functions and densities with bounded support. As a mixture model of multivariate beta distributions, the maximum (approximate) likelihood…

Methodology · Statistics 2019-01-23 Tao Wang , Zhong Guan

Consistency-based methods have emerged as an effective approach to uncertainty quantification (UQ) in large language models. These methods typically rely on several generations obtained via multinomial sampling, measuring their agreement…

In 2015, using an innovative technique, Carando, Defant and Sevilla-Peris succeeded in proving a Bohnenblust--Hille type inequality with constants of polynomial growth in $m$ for a certain family of complex $m$-homogeneous polynomials. In…

Functional Analysis · Mathematics 2018-04-02 Mariana Maia , Tony Nogueira , Daniel Pellegrino

In the article, the authors establish the monotonicity of the ratios \begin{equation*} \frac{B_{2n-1}(t)}{B_{2n+1}(t)}, \quad \frac{B_{2n}(t)}{B_{2n+1}(t)},\quad \frac{B_{2m}(t)}{B_{2n}(t)},\quad \frac{B_{2n}(t)}{B_{2n-1}(t)}…

General Mathematics · Mathematics 2024-05-10 Zhen-Hang Yang , Feng Qi

We introduce a version of Stein's method for proving concentration and moment inequalities in problems with dependence. Simple illustrative examples from combinatorics, physics, and mathematical statistics are provided.

Probability · Mathematics 2007-05-23 Sourav Chatterjee

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case…

Discrete Mathematics · Computer Science 2014-07-14 Agnes Cseh , Martin Skutella

We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal…

In this paper, we explore some links between transforms derived by Stein's method and concentration inequalities. In particular, we show that the stochastic domination of the zero bias transform of a random variable is equivalent to…

Probability · Mathematics 2022-11-24 Santiago Arenas-Velilla , Emilien Joly

In this work, we develop a Bayesian framework for solving inverse problems in which the unknown parameter belongs to a space of Radon measures taking values in a separable Hilbert space. The inherent ill-posedness of such problems is…

Statistics Theory · Mathematics 2025-05-02 Phuoc-Truong Huynh

We consider a ranking problem where we have noisy observations from a matrix with isotonic columns whose rows have been permuted by some permutation $\pi$ *. This encompasses many models, including crowd-labeling and ranking in tournaments…

Statistics Theory · Mathematics 2023-10-03 Emmanuel Pilliat , Alexandra Carpentier , Nicolas Verzelen

In this paper, we are concerned with obtaining distribution-free concentration inequalities for mixture of independent Bernoulli variables that incorporate a notion of variance. Missing mass is the total probability mass associated to the…

Machine Learning · Statistics 2015-03-05 Bahman Yari Saeed Khanloo

One of the fundamental open questions in computational complexity is whether the class of problems solvable by use of stochasticity under the Random Polynomial time (RP) model is larger than the class of those solvable in deterministic…

Computational Complexity · Computer Science 2013-10-01 Michael Brand