Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-13T07:07:59.940Z Has data issue: false hasContentIssue false
  • English
  • Français

Distances in Random Induced Subgraphs of Generalized n-Cubes

Published online by Cambridge University Press:  21 November 2002

C. M. REIDYS
C. M. REIDYS
Affiliation:
Los Alamos National Laboratory, D2, New Mexico, NM 87548, USA (e-mail [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we study distances in random subgraphs of a generalized n-cube [Qscr ]ns over a finite alphabet S of size s. [Qscr ]ns is the direct product of complete graphs over s vertices, its vertices being the n-tuples (x1, …, xn), with xi ∈ S, i = 1, … n, and two vertices being adjacent if they differ in exactly one coordinate. A random (induced) subgraph γ of [Qscr ]ns is obtained by selecting [Qscr ]ns-vertices with independent probability pn and then inducing the corresponding edges from [Qscr ]ns. Our main result is that dγ (P,Q) [les ] [2k+3]d[Qscr ]ns (P,Q) almost surely for P,Q ∈ γ, pn = n−a and 0 [les ] a < ½, where k = [1+3a/1−2a] and dγ and d[Qscr ]ns denote the distances in γ and [Qscr ]ns, respectively.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 11 , Issue 6 , November 2002 , pp. 599 - 605
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)