Random lifts of graphs

  • Authors:

  • Alon Amit;Nathan Linial;Jiří Matoušek;Eyal Rozenman

  • Affiliations:

  • Institute of Mathematics, The Hebrew University, Jerusalem, Israel;Institute of Computer Science, The Hebrew University, Jerusalem, Israel;Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic;Institute of Computer Science, The Hebrew University, Jerusalem, Israel

  • Venue:
  • SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouquet Bd and