Analytical solution of a stochastic content-based network model

Authors: Mungan, Muhittin; Kabakçinodotoglu, Alkan; Balcan, Duygu; Erzan, Ayse

Source: Journal of Physics A: Mathematical and General, Volume 38, Number 44, 4 November 2005 , pp. 9599-9620(22)

Publisher: Institute of Physics Publishing

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

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.

Document Type: Research article

DOI: 10.1088/0305-4470/38/44/001

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$42.18 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A