English
Related papers

Related papers: Specifying a positive threshold function via extre…

200 papers

We consider the Cartesian product X of n finite intervals of integers and a map F from X to itself. As main result, we establish an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive…

Discrete Mathematics · Computer Science 2008-12-01 Adrien Richard

The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…

Statistics Theory · Mathematics 2008-01-22 Patricia Reynaud-Bouret , Vincent Rivoirard

The paper is devoted to the study of the unconditional extremal problem for a fractional linear integral functional defined on a set of probability distributions. In contrast to results proved earlier, the integrands of the integral…

Optimization and Control · Mathematics 2019-06-14 Peter Shnurkov , Kseniia Adamova

Let $\mathbf{X}^{(1)}_{n},\ldots,\mathbf{X}^{(m)}_{n}$, where $\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\ldots,X^{(i)}_{n})$, $i=1,\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their…

Probability · Mathematics 2016-03-15 Ruoting Gong , Christian Houdré , Ümit Işlak

For a continuous function $f$ defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is…

Numerical Analysis · Mathematics 2021-08-31 Fatih Idiz

We prove the main conjecture from [M. R. Douglas, B. Shiffman and S. Zelditch, Critical points and supersymmetric vacua, II: Asymptotics and extremal metrics. J. Differential Geom. 72 (2006), no. 3, 381-427] concerning the metric dependence…

Mathematical Physics · Physics 2008-02-18 Benjamin Baugher

The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…

Statistics Theory · Mathematics 2008-10-30 Patricia Reynaud-Bouret , Vincent Rivoirard

In the general setting of a locally compact Abelian group $G$, the Delsarte extremal problem asks for the supremum of integrals over the collection of continuous positive definite functions $f: G \to \mathbb{R}$ satisfying $f(0) = 1$ and…

Classical Analysis and ODEs · Mathematics 2024-11-26 Mita Dimpho Ramabulana

Suppose (standardized) measurements or statistics are monitored to raise an alarm when a threshold is exceeded. Often, the underlying population is heterogenous with respect to important discrete variables and thus samples may consist of…

Statistics Theory · Mathematics 2025-10-10 Ansgar Steland

Consider a family of Boolean models, indexed by integers $n \ge 1$, where the $n$-th model features a Poisson point process in ${\mathbb{R}}^n$ of intensity $e^{n \rho_n}$ with $\rho_n \to \rho$ as $n \to \infty$, and balls of independent…

Probability · Mathematics 2014-08-13 Venkat Anantharam , François Baccelli

We propose a new, generic and flexible methodology for nonparametric function estimation, in which we first estimate the number and locations of any features that may be present in the function, and then estimate the function parametrically…

Methodology · Statistics 2024-12-17 Rafal Baranowski , Yining Chen , Piotr Fryzlewicz

Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…

Computational Complexity · Computer Science 2015-08-14 Xi Chen , Igor C. Oliveira , Rocco A. Servedio

In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…

Logic · Mathematics 2015-07-01 Vassilios Gregoriades

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

Computer Science and Game Theory · Computer Science 2022-08-12 Xiaotie Deng , Hanyu Li , Ningyuan Li

We construct an example of a real-valued continuous non-constant function $f$ defined on a connected complete metric space $X$ such that every point of $X$ is a point of local minimum or local maximum for $f$. The space $X$ is connected but…

General Topology · Mathematics 2008-11-12 T. Banakh , M. Vovk , M. R. Wojcik

$\newcommand{\EC}{\mathsf{EC}}\newcommand{\KW}{\mathsf{KW}}\newcommand{\DT}{\mathsf{DT}}\newcommand{\psens}{\mathsf{psens}} \newcommand{\calB}{{\cal B}} $ For a Boolean function $f:\{0,1\}^n \to \{0,1\}$ computed by a circuit $C$ over a…

Computational Complexity · Computer Science 2020-09-17 Krishnamoorthy Dinesh , Samir Otiv , Jayalal Sarma

Let $n\ge1$ and $B\ge2$. A real-valued function $f$ defined on the $n$-simplex $\Delta_n$ is approximately convex with respect to $\Delta_{B-1}$ iff f(\sum_{i=1}^B t_ix_i) \le \sum_{i=1}^B t_if(x_i) +1 for all $x_1,...,x_B \in \Delta_n$ and…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

The conventional definition of extremality of a finite collection of sets is extended by replacing a fixed point (extremal point) in the intersection of the sets by a collection of sequences of points in the individual sets with the…

Optimization and Control · Mathematics 2025-07-22 Nguyen Duy Cuong , Alexander Y. Kruger

A nearest neighbor representation of a Boolean function $f$ is a set of vectors (anchors) labeled by $0$ or $1$ such that $f(\vec{x}) = 1$ if and only if the closest anchor to $\vec{x}$ is labeled by $1$. This model was introduced by…

Computational Complexity · Computer Science 2024-05-24 Mason DiCicco , Vladimir Podolskii , Daniel Reichman

We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…

Quantum Physics · Physics 2007-05-23 Yaoyun Shi