The diameter of a random subgraph of the hypercube

Authors:
Tomáš Kulich
Affiliations:
Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynská dolina, 84248 Bratislava, Slovak Republic
Venue:
Random Structures & Algorithms
Year:
2012

Citing 6
Cited 0

Programming languages for distributed computing systems

ACM Computing Surveys (CSUR)
PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
Asymptotic expansions in n-1 for percolation critical values on the n-cube and Zn

Random Structures & Algorithms
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube

Combinatorica
Distributed average consensus with least-mean-square deviation

Journal of Parallel and Distributed Computing
Majority bootstrap percolation on the hypercube

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an estimation for the diameter of random subgraph of a hypercube. In the article by A. V. Kostochka (Random Struct Algorithms 4 (1993) 215–229) the authors obtained lower and upper bound for the diameter. According to their work, the inequalities n + mp ≤ D(Gn) ≤ n + mp + 8 almost surely hold as n → ∞, where n is dimension of the hypercube and mp depends only on sampling probabilities. It is not clear from their work, whether the values of the diameter are really distributed on these 9 values, or whether the inequality can be sharpened. In this paper we introduce several new ideas, using which we are able to obtain an exact result: D(Gn) = n + mp (almost surely). © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.