English
Related papers

Related papers: Random triangles in planar regions containing a fi…

200 papers

Se enuncia los principales teoremas empleados en la resoluci'on de tri'angulos oblicu'angulos. Con ellos, se ilustra c'omo resolver los cinco casos de resoluci'on que se presentan, incluyendo algunos caso at'ipicos (cuando se conoce el…

General Mathematics · Mathematics 2019-09-27 Diego Fernando Ramírez Jiménez

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

Probability · Mathematics 2019-04-02 Jens Grygierek

We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…

Computational Geometry · Computer Science 2023-05-03 Nattawut Phetmak , Jittat Fakcharoenphol

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

Combinatorics · Mathematics 2024-09-16 Swee Hong Chan , Igor Pak

Any permutation-invariant function of data points $\vec{r}_i$ can be written in the form $\rho(\sum_i\phi(\vec{r}_i))$ for suitable functions $\rho$ and $\phi$. This form - known in the machine-learning literature as Deep Sets - also…

Cosmology and Nongalactic Astrophysics · Physics 2025-04-02 Connor Hainje , David W. Hogg

This paper is devoted to the analysis of random motions on the line and in the space R^d (d > 1) performed at finite velocity and governed by a non-homogeneous Poisson process with rate \lambda(t). The explicit distributions p(x,t) of the…

Probability · Mathematics 2015-09-23 R. Garra , E. Orsingher

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

Probability · Mathematics 2021-05-05 Nicolas Broutin , Henning Sulzbach

The probability that all eigenvalues of a product of $m$ independent $N \times N$ sub-blocks of a Haar distributed random real orthogonal matrix of size $(L_i+N) \times (L_i+N)$, $(i=1,\dots,m)$ are real is calculated as a multi-dimensional…

Mathematical Physics · Physics 2017-07-06 Peter J. Forrester , Santosh Kumar

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

Combinatorics · Mathematics 2007-05-23 Kurt Johansson

Let n points be chosen randomly and independently in the unit disk. "Sylvester's question" concerns the probability p_n that they are the vertices of a convex n-sided polygon. Here we establish the link with another problem. We show that…

Statistical Mechanics · Physics 2010-08-26 H. J. Hilhorst , P. Calka , G. Schehr

An interesting description of a collinear configuration of four particles is found in terms of two spherical coordinates. An algorithm to compute the four coordinates of particles of a collinear Four-Body central configuration is presented…

Mathematical Physics · Physics 2016-07-07 E. Piña

Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…

Probability · Mathematics 2009-09-29 Jean-François Marckert , Grégory Miermont

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…

Dynamical Systems · Mathematics 2014-04-21 Jesús San Martín , Mason A. Porter

We obtain results concerning the so-called factorization for the convergence of random variables almost everywhere (almost surely or with probability one), belonging to the classical Lebesgue-Riesz spaces and we extend these results to the…

Probability · Mathematics 2024-01-25 Maria Rosaria Formica , Eugeny Ostrovsky , Leonid Sirota

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

Probability · Mathematics 2020-10-13 Imre Bárány , Matthieu Fradelizi , Xavier Goaoc , Alfredo Hubard , Günter Rote

Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…

Classical Analysis and ODEs · Mathematics 2020-07-14 Walter Van Assche

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…

Combinatorics · Mathematics 2009-09-29 Olivier Bodini , Eric Fusy , Carine Pivoteau

We consider the configuration space of planar $n$-gons with fixed perimeter, which is diffeomorphic to the complex projective space $\mathbb{C}P^{n-2}$. The oriented area function has the minimal number of critical points on the…

Geometric Topology · Mathematics 2024-07-22 Giorgi Khimshiashvili , Gaiane Panina , Dirk Siersma

We study integer programming instances over polytopes P(A,b)={x:Ax<=b} where the constraint matrix A is random, i.e., its entries are i.i.d. Gaussian or, more generally, its rows are i.i.d. from a spherically symmetric distribution. The…

Data Structures and Algorithms · Computer Science 2013-08-27 Karthekeyan Chandrasekaran , Santosh Vempala
‹ Prev 1 8 9 10 Next ›