IJCsatellite IJCsatellite/cond-mat

http://arxiv.org/abs/cond-mat/0506301

cond-mat/0506301

From: Hideo Hasegawa [view email]
Date (v1): Tue, 14 Jun 2005 03:23:39 GMT   (372kb)
Date (revised v2): Wed, 15 Jun 2005 02:24:51 GMT   (372kb)

Nonextensive maximum-entropy approach to small-world networks

Authors: Hideo Hasegawa (Tokyo Gakugei Univ.)
Comments: 14 pages, 7 figures, corrected typos and refined figs
Subj-class: Disordered Systems and Neural Networks; Statistical Mechanics

The degree distribution $P(k)$ in complex networks has been obtained by maximizing the nonextensive information entropy with the three constraints: $<1>=1$, $<k>=?mu$ and $<k^2>=?rho$, where $<>$ denotes the average over $P(k)$. The distribution $P(k)$ is expressed by a generalized Gaussian (referred to as {?it $Q$-Gaussian}) which has a maximum at $k=?mu$ with a width proportional to $?sqrt{?rho-?mu^2}$, in contrast to a conventional $q$-Gaussian with a maximum at the zero value. It has been shown that $Q$-Gaussian well describes the degree distribution in small-world networks. An alternative, differential-equation approach to $Q$-Gaussian is discussed also.


© Copyright 2013 Kei Tokita, Powered by Pukiwiki.  Last-modified: Sun, 23 Jun 2013 13:50:21 JST (2334d)   リロード   新規 編集 凍結 差分 添付 複製 改名   トップ 一覧 検索 最終更新 バックアップ   ヘルプ   最終更新のRSS