Location of Repository

We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one. Moreover, a regular partition approximates a given graph by a bounded number of quasi-random graphs. Regarding quasi-randomness, we present a new spectral characterization of low discrepancy, which extends to sparse graphs. Concerning regular partitions, we introduce a concept of regularity that takes into account vertex weights, and show that if $G=(V,E)$ satisfies a certain boundedness condition, then $G$ admits a regular partition. In addition, building on the work of Alon and Naor [Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), Chicago, IL, ACM, New York, 2004, pp. 72–80], we provide an algorithm that computes a regular partition of a given (possibly sparse) graph $G$ in polynomial time. As an application, we present a polynomial time approximation scheme for MAX CUT on (sparse) graphs without “dense spots.

Topics:
QA

Publisher: Society for Industrial and Applied Mathematics

Year: 2010

OAI identifier:
oai:wrap.warwick.ac.uk:3320

Provided by:
Warwick Research Archives Portal Repository

- (2007). A characterization for sparse ε-regular pairs,
- (2003). An optimal algorithm for checking regularity,
- (2004). Approximating the cut-norm via Grothendieck’s inequality,i nP r
- (2002). Barab´ asi, Statistical mechanics of complex networks,
- (2000). Gadgets, approximation, and linear programming,
- (1988). Geometric Algorithms and Combinatorial Optimization,
- (2004). Graphs and Hermitian matrices: Discrepancy and singular values,
- (1995). Interior point methods in semideﬁnite programming with applications to combinatorial optimization,
- (1997). Introduction to Matrix Analysis, 2nd ed.,
- (2006). Lifts, discrepancy, and nearly optimal spectral gap,
- (2008). Quasi-random graphs with given degree sequences,
- (1989). Quasi-random graphs,
- (1999). Quick approximation to matrices and applications,
- (1953). R´ esum´ ed el at h ´ eorie m´ etrique des produits tensoriels topologiques,B o l .
- (1978). Regular partitions of graphs,i nP r o b l
- (1981). s, The eigenvalues of random symmetric matrices,
- (2000). Semideﬁnite Programming for Combinatorial Optimization, Habilitation thesis,
- (2001). Some optimal inapproximability results,
- (2002). Sparse quasi-random graphs,
- (1997). Spectral Graph Theory,
- (1997). Szemer´ edi’s regularity lemma for sparse graphs,
- (1994). The algorithmic aspects of the regularity lemma,
- (2005). The sparse regularity lemma and its applications,
- (2006). Using discrepancy to control singular values for nonnegative matrices,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.