Open AccessBielemental random networks
Author(s) -
Hongbin Chen,
Ying Fan,
Fang Jin-Qing,
Zengru Di
Publication year - 2009
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.58.1383
Subject(s) - computer science , bipartite graph , random graph , shortest path problem , path (computing) , average path length , topology (electrical circuits) , theoretical computer science , mathematics , combinatorics , computer network , graph
On the basic of bipartite networksbielemental networks are defined as networks which include two kinds of vertexesand connections between different kinds of vertexes are permitted. In this articlea bielemental random network model is foundedand the structure of the bielemental random network is studied. Small-world effect can be found in such modelfurthermorethe average shortest path length is smaller than that of unipartite random networks. And the proportion of the numbers of two kinds of vertexes is a very important factor.