Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

We prove two generalizations of the Cheeger’s inequality. The first generalization relates the second eigenvalue to the edge expansion and the vertex expansion of the graph G, λ2 = Ω(φ V (G) · φ(G)), where φ (G) denotes the robust vertex expansion of G and φ(G) denotes the edge expansion of G. The second generalization relates the second eigenvalue to the edge expansion and the expansion profil...

متن کامل

Bone-Borne Maxillary Expansion and Traditional Rapid Maxillary Expansion: A Systematic Review and Meta-Analysis

Introduction: The aim of this study was to perform a systematic review and meta-analysis to compare the effect of bone-borne expansion (BBE) and tooth-borne expansion (TBE) in patients with maxillary constriction. Methods: Electronic databases, including MEDLINE, EMBASE, and Cochrane Central Register of Controlled Trials, were searched up to February 2019. Elig...

متن کامل

Rumor spreading and vertex expansion

We study the relation between the rate at which rumors spread throughout a graph and the vertex expansion of the graph. We consider the standard rumor spreading protocol where every node chooses a random neighbor in each round and the two nodes exchange the rumors they know. For any n-node graph with vertex expansion α, we show that this protocol spreads a rumor from a single node to all other ...

متن کامل

Tight products and graph expansion

In this paper we study a new product of graphs called tight product. A graph H is said to be a tight product of two (undirected multi) graphs G1 and G2, if V (H) = V (G1) × V (G2) and both projection maps V (H) → V (G1) and V (H) → V (G2) are covering maps. It is not a priori clear when two given graphs have a tight product (in fact, it is NP -hard to decide). We investigate the conditions unde...

متن کامل

synthesis of amido alkylnaphthols using nano-magnetic particles and surfactants

we used dbsa and nano-magnetic for the synthesis of amido alkylnaphtols.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 2017

ISSN: 0097-5397,1095-7111

DOI: 10.1137/16m1079816