On the scale-free intersection graphs

Authors:
Xin Yao;Changshui Zhang;Jinwen Chen;Yanda Li
Affiliations:
Department of Automation, Tsinghua University, State Key Laboratory of Intelligence Technology and System, Beijing, P.R. China;Department of Automation, Tsinghua University, State Key Laboratory of Intelligence Technology and System, Beijing, P.R. China;Department of Mathematics, Tsinghua University, Beijing, P.R. China;Department of Automation, Tsinghua University, State Key Laboratory of Intelligence Technology and System, Beijing, P.R. China
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Year:
2005

Citing 4
Cited 1

Random intersection graphs when m= w(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n,P/italic) models

Random Structures & Algorithms
Statistical mechanics of complex networks

Statistical mechanics of complex networks
On Random Intersection Graphs: The Subgraph Problem

Combinatorics, Probability and Computing
The vertex degree distribution of random intersection graphs

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I

Random intersection graphs with tunable degree distribution and clustering

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a network model called scale-free intersection graphs, in which there are two types of vertices, terminal vertices and hinge vertices. Each terminal vertex selects some hinge vertices to link, according to their attractions, and two terminal vertices are connected if their selections intersect each other. We obtain analytically the relation between the vertices attractions and the degree distribution of the terminal vertices and numerical results agree with it well. We demonstrated that the degree distribution of terminal vertices are decided only by the attractions decay of the terminal vertices. In addition, a real world scale-free intersection graphs, BBS discussing networks is considered. We study its dynamic mechanism and obtain its degree distribution based on the former results of scale-free intersection graphs.