کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10481126 | 933054 | 2011 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the efficiency of data representation on the modeling and characterization of complex networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
⺠Sparse representations of networks are found to be significantly more efficient than the adjacency matrix representations for many problems if the network is not dense. ⺠For networks where the average degree is close to the number of nodes, sparse representations are slower. ⺠For some tasks, like the computation of the clustering coefficients, the sparse representation can be slower than the adjacency matrix representation even for relatively sparse networks. ⺠When using adjacency matrices, the use of representations for the elements of the matrix with low memory requirements can have a significant impact on performance.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 390, Issue 11, 1 June 2011, Pages 2172-2180
Journal: Physica A: Statistical Mechanics and its Applications - Volume 390, Issue 11, 1 June 2011, Pages 2172-2180
نویسندگان
Carlos Antônio Ruggiero, Odemir Martinez Bruno, Gonzalo Travieso, Luciano da Fontoura Costa,