English
Related papers

Related papers: Random polynomials: the closest roots to the unit …

200 papers

Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…

Numerical Analysis · Mathematics 2018-01-08 Myong-Hi Kim , Marco Martens , Scott Sutherland

Define the scaled empirical point process on an independent and identically distributed sequence $\{Y_i: i\le n\}$ as the random point measure with masses at $a_n^{-1} Y_i$. For suitable $a_n$ we obtain the weak limit of these point…

Probability · Mathematics 2016-08-16 André Dabrowski , Gail Ivanoof , Rafal Kulik

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…

Probability · Mathematics 2017-03-14 Ron Peled , Arnab Sen , Ofer Zeitouni

We investigate approximation of a Bernoulli partial sum process to the accompanying Poisson process in the non-i.i.d. case. The rate of closeness is studied in terms of the minimal distance in probability.

Probability · Mathematics 2022-07-20 Pavel S. Ruzankin , Igor S. Borisov

Pick n points independently at random in R^2, according to a prescribed probability measure mu, and let D^n_1 <= D^n_2 <= ... be the areas of the binomial n choose 3 triangles thus formed, in non-decreasing order. If mu is absolutely…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Svante Janson

In a uniform random recursive k-dag, there is a root, 0, and each node in turn, from 1 to n, chooses k uniform random parents from among the nodes of smaller index. If S_n is the shortest path distance from node n to the root, then we…

Probability · Mathematics 2015-05-13 Luc Devroye , Svante Janson

We study the density of the roots of the derivative of the characteristic polynomial Z(U,z) of an N x N random unitary matrix with distribution given by Haar measure on the unitary group. Based on previous random matrix theory models of the…

Mathematical Physics · Physics 2009-11-07 Francesco Mezzadri

We specify a small set, consisting of $O(d(\log\log d)^2)$ points, that intersects the basins under Newton's method of \emph{all} roots of \emph{all} (suitably normalized) complex polynomials of fixed degrees $d$, with arbitrarily high…

Dynamical Systems · Mathematics 2011-08-31 Béla Bollobás , Malte Lackmann , Dierk Schleicher

Let $\cP_n$ be the space of homogeneous polynomials of degree $n$ on $\bbR^{m+1}$. We consider the asymptotic behavior of some coefficients relating to the decomposition of $\cP_n$ into the sum of $\SO(m+1)$-irreducible components. Using…

Classical Analysis and ODEs · Mathematics 2018-02-27 V. Gichev

For a compact convex set $K$ and a Poisson point process $\eta$, the union of all Voronoi cells with a nucleus in $K$ is the Poisson-Voronoi approximation of $K$. Lower and upper bounds for the variance and a central limit theorem for the…

Probability · Mathematics 2011-12-26 Matthias Schulte

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

Number Theory · Mathematics 2024-09-05 Yoshiyuki Kitaoka

We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…

Combinatorics · Mathematics 2021-07-06 Richard Arratia , Stephen DeSalvo

A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…

Numerical Analysis · Mathematics 2019-06-28 Evan S. Gawlik , Yuji Nakatsukasa

Consider a random system $\mathfrak{f}_1(x)=0,\ldots,\mathfrak{f}_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $\mathfrak{f}_k$ has a prescribed set of exponent vectors in a set $A_k\subseteq \mathbb{Z}^n$ of size…

Algebraic Geometry · Mathematics 2023-08-21 Alperen A. Ergür , Máté L. Telek , Josué Tonelli-Cueto

It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$…

Probability · Mathematics 2026-05-05 Rinaldo B. Schinazi

We identify the scaling region of a width O(n^{-1}) in the vicinity of the accumulation points $t=\pm 1$ of the real roots of a random Kac-like polynomial of large degree n. We argue that the density of the real roots in this region tends…

Mathematical Physics · Physics 2009-11-10 A. P. Aldous , Y. V. Fyodorov

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

Probability · Mathematics 2019-08-27 Daniel Hug , Rolf Schneider

We generalise the known fact that for binomial $X_{n,k} \sim \mathrm{Bin}(n, k/n)$ one has $\inf_{k>1,n} \mathrm{P}(X_{n,k} \geq k) \geq \lim_{k \to 1+}\mathrm{P}(X_{2,k} \geq k) = 1/4$ to cover probabilities of exceeding a constant shift…

Probability · Mathematics 2023-08-11 Tilo Wiklund

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

Symbolic Computation · Computer Science 2023-02-14 Rémi Imbach , Guillaume Moroz
‹ Prev 1 4 5 6 7 8 10 Next ›