[PDF][PDF] Linked decompositions of networks and the power of choice in Polya urns.
HC Lin, C Amanatidis, M Sideri, RM Karp… - SODA, 2008 - aiw.cs.aueb.gr
HC Lin, C Amanatidis, M Sideri, RM Karp, CH Papadimitriou
SODA, 2008•aiw.cs.aueb.gr… To prove that the degrees of the components become roughly balanced when running PA(m),
note that if we think of the sum of the degrees of each component as the occupancy of a Polya
urn, then our random process is very much like the Polya urns process with the power of
choice, defined previously, with c bins and m choices. Although Polya urns with the power of
choice is not quite the same process as the one we would like to analyze, the analysis used
in the proof of Theorem 3.2, which shows that Polya urns with the power of choice produces …
note that if we think of the sum of the degrees of each component as the occupancy of a Polya
urn, then our random process is very much like the Polya urns process with the power of
choice, defined previously, with c bins and m choices. Although Polya urns with the power of
choice is not quite the same process as the one we would like to analyze, the analysis used
in the proof of Theorem 3.2, which shows that Polya urns with the power of choice produces …
Abstract
A linked decomposition of a graph with n nodes is a set of subgraphs covering the n nodes such that all pairs of subgraphs intersect; we seek linked decompositions such that all subgraphs have about
aiw.cs.aueb.gr
Showing the best result for this search. See all results