中文
相关论文

相关论文: How doth the random triangle

200 篇论文

This article aims to introduce the paradigm of distributional robustness from the field of convex optimization to tackle optimal design problems under uncertainty. We consider realistic situations where the physical model, and thereby the…

最优化与控制 · 数学 2025-07-30 Charles Dapogny , Julien Prando , Boris Thibert

Random sampling in high dimensions has successfully been applied to phenomena as diverse as nuclear resonances, neural networks and black hole evaporation. Here we revisit an elegant argument by the British physicist Dennis Sciama, which…

物理学史与哲学 · 物理学 2024-02-23 Zhi-Wei Wang , Samuel L. Braunstein

If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…

历史与综述 · 数学 2016-02-10 Jesús Álvarez Lobo

Motivated by a problem on the 67th William Lowell Putnam Mathematical Competition, we will summarize three different solutions found on a website. This Putman problem is a special case of Sylvester's four point problem! Suppose four points…

度量几何 · 数学 2021-09-14 Sheree Sharpe

We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated manifold, as in recent work for curves in 3-dimensional…

几何拓扑 · 数学 2024-03-06 Chaim Even-Zohar , Joel Hass

In this paper a class of optimization problems with uncertain linear constraints is discussed. It is assumed that the constraint coefficients are random vectors whose probability distributions are only partially known. Possibility theory is…

最优化与控制 · 数学 2021-11-30 Romain Guillaume , Adam Kasperski , Pawel Zielinski

A finite Euclidean set is diameter-Ramsey if, for every number of colors, some finite same-diameter witness has the property that every coloring of the witness contains a monochromatic congruent copy of the set. Frankl, Pach, Reiher and…

组合数学 · 数学 2026-04-27 Yaping Mao

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…

离散数学 · 计算机科学 2019-05-07 Vincent Beffara , Cong Bang Huynh , Benjamin Lévêque

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

动力系统 · 数学 2015-08-17 Péter Pál Varjú

There is well-known problem of geometric probability which can be quote as the Broken Spaghetti Problem. It addresses the following question: A stick of spaghetti breaks into three parts and all points of the stick have the same probability…

历史与综述 · 数学 2022-09-30 ElHadji Abdou Aziz Diop , Masseye Gaye , Abdoul Karim Sane

A random set of points in Euclidean space is called `rigid' or `hyperuniform' if the number of points falling inside any given region has significantly smaller fluctuations than the corresponding number for a set of i.i.d. random points.…

概率论 · 数学 2019-03-29 Sourav Chatterjee

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

概率论 · 数学 2014-08-07 Attila Deák

Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…

组合数学 · 数学 2024-05-31 Catherine Greenhill , Matthew Kwan , David Wind

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

概率论 · 数学 2016-09-07 Sreela Gangopadhyay , Rahul Roy , Anish Sarkar

In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for which some g-element vertex-set contains at…

组合数学 · 数学 2019-12-09 Tom Bohman , Lutz Warnke

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

组合数学 · 数学 2017-03-14 Greg Kuperberg , Shachar Lovett , Ron Peled

Consider a set P of points in the unit square U, one of them being the origin. For each point p in P you may draw a rectangle in U with its lower-left corner in p. What is the maximum area such rectangles can cover without overlapping each…

计算几何 · 计算机科学 2021-02-17 Christoph Damerius , Dominik Kaaser , Peter Kling , Florian Schneider

Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…

统计方法学 · 统计学 2008-02-20 G. Mateu-Figueras , V. Pawlowsky-Glahn , J. J. Egozcue

Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…

概率论 · 数学 2015-02-27 Rahul Roy , Kumarjit Saha , Anish Sarkar

Recently W. Lao and M. Mayer [6], [7], [9] considered $U$-max - statistics, where instead of sum appears the maximum over the same set of indices. Such statistics often appear in stochastic geometry. The examples are given by the largest…

概率论 · 数学 2013-01-09 E. V. Koroleva , Ya. Yu. Nikitin