✦ LIBER ✦

Spectral density of random graphs with topological constraints

✍ Scribed by Rogers, Tim; Vicente, Conrad Pérez; Takeda, Koujin; Castillo, Isaac Pérez

Book ID: 120555070
Publisher: IOP Publishing
Year: 2010
Tongue: English
Weight: 552 KB
Volume: 43
Category: Article
ISSN: 1751-8113
DOI: 10.1088/1751-8113/43/19/195002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse regular random graphs: Spectral d

Sparse regular random graphs: Spectral density and eigenvectors

✍ Dumitriu, Ioana; Pal, Soumik 📂 Article 📅 2012 🏛 Institute of Mathematical Statistics 🌐 English ⚖ 326 KB

Topological cliques of random graphs

✍ B Bollobas; P.A Catlin 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Random symmetric matrices with a constra

Random symmetric matrices with a constraint: The spectral density of random impedance networks

✍ Stäring, J.; Mehlig, B.; Fyodorov, Yan V.; Luck, J. M. 📂 Article 📅 2003 🏛 The American Physical Society 🌐 English ⚖ 63 KB

Balanced graphs with edge density constr

Balanced graphs with edge density constraints

✍ John Sheehan 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

## Abstract Suppose that __G__ is a finite simple graph with |__V__(__G__)| = 2__n__ (__n__ ≠ 3). a partition (__X,Y__) of __V__(__G__) is balanced if (i) |__X__| = |__Y__| = __n__, (ii) δ(__X__) ≥ 1, δ(__Y__) ≥ 1. Where δ(__X__) is the minimum degree of the induced subgraph 〈X〉 with vertex set

Spectral results on graphs with regulari

Spectral results on graphs with regularity constraints

✍ Domingos M. Cardoso; Paula Rama 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Topology discovery of sparse random grap

Topology discovery of sparse random graphs with few participants

✍ Animashree Anandkumar; Avinatan Hassidim; Jonathan Kelner 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB