Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs
复制标题
随机二部图中左完美匹配的最优度分布
DOI:
10.1007/s00224-014-9577-1
复制
发表时间:
2012
影响因子:
0.5
通讯作者:
Michael Rink
中科院分区:
文献类型:
--
作者:
Martin Dietzfelbinger;Michael Rink
Consider a random bipartite multigraphGwithnleft nodes andm≥n≥2 right nodes. Each left nodexhasdx≥1 random right neighbors. The average left degree Δ is fixed, Δ≥2. We ask whether for the probability thatGhas a left-perfect matching it is advantageous not to fixdxfor each left nodexbut rather choose it at random according to some (cleverly chosen) distribution. We show the following, provided that the degrees of the left nodes are independent: If Δ is an integer, then it is optimal to use a fixed degree of Δ for all left nodes. If Δ is non-integral, then an optimal degree-distribution has the property that each left nodexhas two possible degrees, ⌊Δ⌋ and ⌈Δ⌉, with probabilitypxand 1−px, respectively, wherepxis from the closed interval [0,1] and the average over allpxequals ⌈Δ⌉−Δ. Furthermore, ifc=n/mand Δ>2 are constant, then each distribution of the left degrees that meets the conditions above determines the same thresholdc∗(Δ) that has the following property asngoes to infinity: Ifc<c∗(Δ) then asymptotically almost surely there exists a left-perfect matching. Ifc>c∗(Δ) then asymptotically almost surely there exists no left-perfect matching. The thresholdc∗(Δ) is the same as the known threshold for offlinek-ary cuckoo hashing for integral or non-integralk=Δ.
登录
查看更多内容
影响因子:
1
作者:
N. Fountoulakis;K. Panagiotou
通讯作者:
K. Panagiotou
DOI:
--
发表时间:
2009
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
A. Frieze;Páll Melsted
通讯作者:
Páll Melsted
DOI:
10.1007/978-3-642-35843-2_31
发表时间:
2013
期刊:
影响因子:
--
作者:
Michael Rink
通讯作者:
Michael Rink
DOI:
--
发表时间:
2010
期刊:
International Colloquium on Automata, Languages and Programming
影响因子:
--
作者:
N. Fountoulakis;K. Panagiotou
通讯作者:
K. Panagiotou