中文
相关论文

相关论文: Almost sure convergence of the minimum bipartite m…

200 篇论文

Consider the length $L_{MM}^E$ of the minimum matching of N points in d-dimensional Euclidean space. Using numerical simulations and the finite size scaling law $< L_{MM}^E > = \beta_{MM}^E(d) N^{1-1/d}(1+A/N+... )$, we obtain precise…

无序系统与神经网络 · 物理学 2009-10-30 Jacques Boutet de Monvel , Olivier C. Martin

We investigate the average minimum cost of a bipartite matching between two samples of n independent random points uniformly distributed on a unit cube in d $\ge$ 3 dimensions, where the matching cost between two points is given by any…

偏微分方程分析 · 数学 2021-06-02 Michael Goldman , Dario Trevisan

In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph $G$ on two sets of points $A$ and $B$ in $\mathbb{R}^2$ and the weight of each…

计算几何 · 计算机科学 2024-05-30 Sujoy Bhore , Sarfaraz Equbal , Rohit Gurjar

Let $L$ be the Euclidean functional with $p$-th power-weighted edges. Examples include the sum of the $p$-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the…

概率论 · 数学 2007-05-23 Yooyoung Koo , Sungchul Lee

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

概率论 · 数学 2025-02-06 Stefan Gerdjikov , Martin Minchev , Mladen Savov

It is well known that R^N has subspaces of dimension proportional to N on which the \ell_1 norm is equivalent to the \ell_2 norm; however, no explicit constructions are known. Extending earlier work by Artstein--Avidan and Milman, we prove…

泛函分析 · 数学 2009-04-12 Shachar Lovett , Sasha Sodin

We study the asymptotics of a Markovian system of $N \geq 3$ particles in $[0,1]^d$ in which, at each step in discrete time, the particle farthest from the current centre of mass is removed and replaced by an independent $U [0,1]^d$ random…

概率论 · 数学 2015-04-27 Michael Grinfeld , Stanislav Volkov , Andrew R. Wade

In a complete bipartite graph with vertex sets of cardinalities $n$ and $m$, assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as $n\rightarrow\infty$, with $m = \lceil…

概率论 · 数学 2014-05-07 Mustafa Khandwawala

We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…

概率论 · 数学 2023-07-20 Michael Goldman , Dario Trevisan

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

概率论 · 数学 2021-07-20 Mario Correddu , Dario Trevisan

We consider a complete nonnegative biminimal submanifold M (that is, a complete biminimal submanifold with lambda>=0) in a Euclidean space E^N. Assume that the immersion is proper, that is, the preimage of every compact set in E^N is also…

微分几何 · 数学 2015-06-03 Shun Maeta

We investigate the average minimum cost of a bipartite matching, with respect to the squared Euclidean distance, between two samples of n i.i.d. random points on a bounded Lipschitz domain in the Euclidean plane, whose common law is…

偏微分方程分析 · 数学 2021-10-28 Luigi Ambrosio , Michael Goldman , Dario Trevisan

A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $\mathbb{R}^d$ has cardinality $O(d^{4/3})$.

组合数学 · 数学 2019-03-27 Andrey Kupavskii , Nabil H. Mustafa , Konrad J. Swanepoel

We study a random matching problem on closed compact $2$-dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume…

概率论 · 数学 2026-05-01 Nicolas Clozeau , Francesco Mattesini

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

概率论 · 数学 2020-11-09 Michael P. Casey

Biased sampling and missing data complicates statistical problems ranging from causal inference to reinforcement learning. We often correct for biased sampling of summary statistics with matching methods and importance weighting. In this…

统计理论 · 数学 2022-06-02 James Sharpnack

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

统计理论 · 数学 2008-10-06 Zuoxiang Peng , Jiaona Li , Saralees Nadarajah

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…

数据结构与算法 · 计算机科学 2017-03-27 Ching-Lueh Chang

We prove that if $(\mathcal{M},d)$ is an $n$-point metric space that embeds quasisymmetrically into a Hilbert space, then for every $\tau>0$ there is a random subset $\mathcal{Z}$ of $\mathcal{M}$ such that for any pair of points $x,y\in…

度量几何 · 数学 2025-03-13 Alan Chang , Assaf Naor , Kevin Ren

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

组合数学 · 数学 2007-05-23 Rod Canfield , Sylvie Corteel , Pawel Hitczenko
‹ 上一页 1 2 3 10 下一页 ›