Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Testing expansion in bounded-degree graphs

Tools
- Tools
+ Tools

Czumaj, Artur and Sohler, Christian (2010) Testing expansion in bounded-degree graphs. In: Meeting on Combinatorics and Probability, Mathemat Res Inst, Oberwolfach, Germany, April 26-May 02, 2009. Published in: Combinatorics, Probability and Computing, Vol.19 (No.Special Issue 5-6). pp. 693-709.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1017/S096354831000012X

Abstract

We consider the problem of testing expansion in hounded-degree graphs. We focus on the notion of vertex expansion: an a-expander is a graph G = (V, E) in which every subset U subset of V of at most vertical bar V vertical bar/2 vertices has a neighbourhood of size at least alpha . vertical bar U vertical bar. Our main result is that one can distinguish good expanders from graphs that are far from being weak expanders in time (O) over tilde(root n). We prove that the property-testing algorithm proposed by Goldreich and Ron with appropriately set parameters accepts every alpha*-expander with probability at least 2/3 and rejects every graph that is epsilon-far from any alpha*-expander with probability at least 2/3, where alpha* = Theta(alpha(2)/d(2) log(n/epsilon)) and d is the maximum degree of the graphs. The algorithm assumes the bounded-degree graphs model with adjacency list graph representation and its running time is O(d(2) root n log (n/epsilon)/alpha(2)epsilon(3)).

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
Divisions: Faculty of Science > Computer Science
Journal or Publication Title: Combinatorics, Probability and Computing
Publisher: Cambridge University Press
ISSN: 0963-5483
Date: September 2010
Volume: Vol.19
Number: No.Special Issue 5-6
Number of Pages: 17
Page Range: pp. 693-709
Identification Number: 10.1017/S096354831000012X
Status: Peer Reviewed
Publication Status: Published
Title of Event: Meeting on Combinatorics and Probability
Type of Event: Conference
Location of Event: Mathemat Res Inst, Oberwolfach, Germany
Date(s) of Event: April 26-May 02, 2009
URI: http://wrap.warwick.ac.uk/id/eprint/4756

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us