首页/论文/math/0205140

arXiv math/02051402002-05-13math.COmath.OCmath.PR

Almost sure convergence of the minimum bipartite matching functional in Euclidean space

J. H. Boutet de Monvel, O. C. Martin

备注：: To appear in Combinatorica
发表信息：: Combinatorica 22(4):523-530 (2002)

英文摘要：

Let $L_N = L_{MBM}(X_1,..., X_N; Y_1,..., Y_N)$ be the minimum length of a bipartite matching between two sets of points in $\mathbf{R}^d$, where $X_1,..., X_N,...$ and $Y_1,..., Y_N,...$ are random points independently and uniformly distributed in $[0,1]^d$. We prove that for $d \ge 3$, $L_N/N^{1-1/d}$ converges with probability one to a constant $β_{MBM}(d)>0$ as $N\to \infty $.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The Generic Bipartite Graphs of Diameter 3: Their Ages and their Almost Sure Theories

In an effort to find more examples of amalgamation classes whose almost sure theories are the same as their generic theories as well as amalgamation classes whose almost sure theories are different from their generic theories, we address our attention to two new cases: the bipartite diameter 3 metrically homogeneous graphs of generic type. These graphs were identified by Cherlin, and are determined by certain forbidden configurations. In this paper, we explicitly identify and enumerate their ages, for which we then establish both unlabeled and labeled 0-1 laws. Finally, we show that for one of…

2020-04-29math.COmath.LO

随机正则无三角图何时是二部图？

When are random regular triangle-free graphs bipartite?

University of Waterloo（滑铁卢大学）

本文研究随机正则无三角图，发现其在 $d=\frac{\sqrt 3}{2}\sqrt{n \log n}$ 处发生尖锐相变，较小 $d$ 时非二部，较大 $d$ 时二部。

2026-10-07math.CO

二部与欧几里得Gallai-Ramsey理论

Bipartite and Euclidean Gallai-Ramsey Theory

本文研究二部图与欧几里得空间的两类Gallai-Ramsey问题，证明二部图情形答案关于色数线性并给出s=2时的精确界，还通过图着色与空间着色的对应得到一类构型的欧氏Gallai-Ramsey数新上界。

2024-10-10math.CO

Decomposition of random graphs into complete bipartite graphs

We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $τ(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than $1/2$, almost surely $τ(G)$ is between $n- c(\ln_{1/p} n)^{3+ε}$ and $n - 2\ln_{1/(1-p)} n$ for any positive constants $c$ and $ε$.

2015-11-26math.CO

随机正则双部平面图的局部极限

Local Limit of Random Regular Bipartite Planar Maps

MODAL’X, Université Paris-Nanterre（MODAL’X，巴黎楠泰尔大学）；IRIF, Université Paris-Cité（IRIF，巴黎西岱大学）

本文证明了当顶点数趋于无穷时，均匀随机d-正则双部平面图的局部极限存在，通过建立图与开花树的双射关系，并扩展到无限树以转移收敛至平面图。

2026-04-27math.COmath.PR

Solution for a bipartite Euclidean traveling-salesman problem in one dimension

The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the …

2018-05-17cond-mat.dis-nnmath.CO

更多相关论文收起更多论文

Some possible numbers of edge coverings of a bipartite graph or shortest paths with fixed ends in a space of compact sets in $R^n$

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest paths, thus expanding previous works [1][2]

2013-12-09math.COmath.MG

关于在欧几里得空间中点对距离的总全序和线性序的赋值

On prescribing total preorders and linear orders to pairwise distances of points in Euclidean space

该研究证明了在欧几里得空间中，点对距离的全序和线性序可以由特定点集实现，并给出了最优的界限。

2026-02-08cs.DMmath.COmath.MG

On a perfect matching in a random bipartite digraph with average out-degree below two

Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of selections made by each vertex overall is below $2$. More precisely, in the first round each vertex chooses a potential mate uniformly at random, and independently of all vertices. Given a fixed integer $m$, a vertex is classified as unpopular if it has been chosen by at most $m$ vertices from the other side. Each unpopular vertex makes yet another uniform/ind…

2019-03-13math.CO

The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs

A simple generalization of the Hall's condition in bipartite graphs, the Normalized Matching Property (NMP) in a graph $G(X,Y,E)$ with vertex partition $(X,Y)$ states that for any subset $S\subseteq X$, we have $\frac{|N(S)|}{|Y|}\ge\frac{|S|}{|X|}$. In this paper, we show the following results about having the Normalized Matching Property in random and pseudorandom graphs. 1. We establish $p=\frac{\log n}{k}$ as a sharp threshold for having NMP in $\mathbb{G}(k,n,p)$, which is the graph with $|X|=k,|Y|=n$ (assuming $k\le n\leq \exp(o(k))$), and in which each pair $(x,y)\in X\times Y$ is an ed…

2021-06-24cs.DMmath.COmath.PR

两个随机点集上组合优化的最优传输方法

Optimal transport methods for combinatorial optimization over two random point sets

针对$d\u22653$维均匀随机二部几何图上的组合优化问题，将其最小成本收敛性的适用范围从$p<d/2$拓展至$p<d$，证明依托次可加性与最优传输松弛得到的二部匹配新界。

2023-07-19math.COmath.FAmath.PR

Almost spanning subgraphs of random graphs after adversarial edge removal

Let Delta>1 be a fixed integer. We show that the random graph G(n,p) with p>>(log n/n)^{1/Delta} is robust with respect to the containment of almost spanning bipartite graphs H with maximum degree Delta and sublinear bandwidth in the following sense: asymptotically almost surely, if an adversary deletes arbitrary edges in G(n,p) such that each vertex loses less than half of its neighbours, then the resulting graph still contains a copy of all such H.

2013-04-07math.CO

改进的欧几里得TSP常数上界使用带交叉

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers

Northwestern University（西北大学）

本文通过改进的带交叉策略，结合模拟和集中分析，将欧几里得TSP常数上界从0.90380改进至约0.88，并提出可能进一步提高至约0.85的替代启发式方法。

2026-02-11cs.CGcs.DSmath.CO