کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4599305 | 1631133 | 2014 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The spectra of multiplicative attribute graphs
ترجمه فارسی عنوان
طیف های نمودارهای چند ضلعی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
A multiplicative attribute graph is a random graph in which vertices are represented by random words of length t in a finite alphabet Î, and the probability of adjacency is a symmetric function ÎtÃÎtâ[0,1]. These graphs are a generalization of stochastic Kronecker graphs, and both classes have been shown to exhibit several useful real world properties. We establish asymptotic bounds on the spectra of the adjacency matrix and the normalized Laplacian matrix for these two families of graphs under certain mild conditions. As an application we examine various properties of the stochastic Kronecker graph and the multiplicative attribute graph, including the diameter, clustering coefficient, chromatic number, and bounds on low-congestion routing.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 462, 1 December 2014, Pages 39-58
Journal: Linear Algebra and its Applications - Volume 462, 1 December 2014, Pages 39-58
نویسندگان
Mary Radcliffe, Stephen J. Young,