Mihail, Milena and Amanatidis, Yorgos and Young, Stephen (2009) KERNEL MODELS FOR COMPLEX NETWORKS. In: Proceedings of the WebSci'09: Society On-Line, 18-20 March 2009, Athens, Greece.
![[img]](/style/images/fileicons/application_pdf.png) | PDF (preprint) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 85Kb | |
| PDF (Final Version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 80Kb |
Abstract
We advocate the study of complex network models based on kernel functions. These are hybrids between macroscopic random graph models for networks with heavy tailed statistics (or other desired structural characteristics), and microscopic models that incorporate network semantics. In particular, kernel-based models assign explicit semantics to network elements (nodes and links), while they maintain the conceptual and implementational simplicity of random graph models.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Graph Models, Complex Networks, Linked Data |
| Subjects: | Web Science Events > Web Science 2009 |
| ID Code: | 218 |
| Deposited By: | W S R I Administrator |
| Deposited On: | 24 Jan 2009 08:45 |
| Last Modified: | 17 Mar 2009 22:52 |
Repository Staff Only: item control page
