中文
相关论文

相关论文: Random Covering Sets in Metric Space with Exponent…

200 篇论文

Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially distributed resetting. We also approximate the moments of cover…

概率论 · 数学 2025-05-13 Samantha Linn , Sean D Lawley

We provide upper and lower bounds for the expected length $\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\mathbb…

组合数学 · 数学 2014-02-04 Michael Earnest , Anant Godbole , Yevgeniy Rudoy

In this paper, we study the lower- and upper-bounded covering (LUC) problem, where we are given a set $P$ of $n$ points, a collection $\mathcal{B}$ of balls, and parameters $L$ and $U$. The goal is to find a minimum-sized subset…

数据结构与算法 · 计算机科学 2020-09-22 Sayan Bandyapadhyay , Aniket Basu Roy

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

动力系统 · 数学 2019-08-15 Peter Müller , Christoph Richard

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

计算几何 · 计算机科学 2014-04-01 Glencora Borradaile , Erin Wolf Chambers

We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\mathbb{R}^{2}$, and a geometric object $t$, the goal is to…

计算几何 · 计算机科学 2025-06-03 Sathish Govindarajan , Mayuresh Patle , Siddhartha Sarkar

We suppose we are given a list of points $x_1, \dots, x_n \in \mathbb{R}$, a target probability measure $\mu$ and are asked to add additional points $x_{n+1}, \dots, x_{n+m}$ so that $x_1, \dots, x_{n+m}$ is as close as possible to the…

最优化与控制 · 数学 2025-10-14 François Clément , Stefan Steinerberger

Consider $q_n$ a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with $n$ faces. In this paper we show that, when $n$ goes to $+\infty$, $q_n$ suitably normalized converges weakly in a certain sense…

概率论 · 数学 2007-05-23 Jean-François Marckert , Abdelkader Mokkadem

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

概率论 · 数学 2018-09-17 Valentin Bahier

Concentration of measure is a phenomenon in which a random variable that depends in a smooth way on a large number of independent random variables is essentially constant. The random variable will "concentrate" around its median or…

概率论 · 数学 2015-08-25 Meg Walters

We derive sufficient conditions for a family $(X^n,\rho_n,P_n)$ of metric probability spaces to have the measure concentration property. Specifically, if the sequence $\{P_n\}$ of probability measures satisfies a strong mixing condition…

概率论 · 数学 2007-05-23 Leonid Kontorovich

In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel combinatorial problem formalizing this tradeoff: from a…

数据结构与算法 · 计算机科学 2025-12-01 Sophie Boileau , Andrew Hong , David Liben-Nowell , Alistair Pattison , Anna N. Rafferty , Charlie Roslansky

If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least {\pi}. This bound is sharp, and the equality case is characterized.

度量几何 · 数学 2011-10-20 Karoly Bezdek , Rolf Schneider

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…

概率论 · 数学 2020-12-15 Dariusz Buraczewski , Bohdan Dovgay , Alexander Marynych

Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…

数据库 · 计算机科学 2012-07-30 Nguyen Duc Thuan

We study the problem of covering and learning sums $X = X_1 + \cdots + X_n$ of independent integer-valued random variables $X_i$ (SIIRVs) with unbounded, or even infinite, support. De et al. at FOCS 2018, showed that the maximum value of…

机器学习 · 计算机科学 2022-10-25 Alkis Kalavasis , Konstantinos Stavropoulos , Manolis Zampetakis

Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…

组合数学 · 数学 2020-08-31 Anant Godbole , Thomas Grubb , Kyutae Han , Bill Kay

We investigate the topologies of random geometric complexes built over random points sampled on Riemannian manifolds in the so-called "thermodynamic" regime. We prove the existence of universal limit laws for the topologies; namely, the…

概率论 · 数学 2020-11-23 Antonio Auffinger , Antonio Lerario , Erik Lundberg

The following anticoncentration property is proved. The probability that the $k$-order statistic of an arbitrarily correlated jointly Gaussian random vector $X$ with unit variance components lies within an interval of length $\varepsilon$…

统计理论 · 数学 2021-07-23 Damian Kozbur

We study random compact subsets of R^3 which can be described as "random Menger sponges". We use those random sets to construct a pair of compact sets A and B in R^3 which are of the same positive measure, such that A can be covered by…

度量几何 · 数学 2021-04-06 Tomasz Cieśla , Łukasz Grabowski