<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Analytical solution of a stochastic content-based network model

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Mungan, M

Balcan, D

Erzan, A

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

We define and completely solve a content-based directed network whose nodes consist of random words and an adjacency rule involving perfect or approximate matches for an alphabet with an arbitrary number of letters. The analytic expression for the out-degree distribution shows a crossover from a leading power law behaviour to a log-periodic regime bounded by a different power law decay. The leading exponents in the two regions have a weak dependence on the mean word length, and an even weaker dependence on the alphabet size. The in-degree distribution, on the other hand, is much narrower and does not show any scaling behaviour.

Source

Publisher

Iop Publishing Ltd

Citation

item.page.haspartof

Source

Journal of Physics A: Mathematical and General

item.page.ispartofseries

item.page.edition

DOI

10.1088/0305-4470/38/44/001

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators