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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amaral, L.A.N., Scala, A., Barthélémy, M., Stanley, H.E.: Classes of small-world networks. Proc. Natl. Acad. Sci. USA 97, 11149–11152 (2000)
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
Dorogovtsev, S.N., Mendes, J.F.F.: Effect of the accelerating growth of communications networks on their struction. Phys. Rev. E. 63, 25101 (2001)
Stark, D.: The vertex degree distribution of random intersection graphs. Random Structures and Algorithms 24, 249–258 (2004)
Fill, J.A., Scheinerman, E.R., Singer-Cohen, K.B.: Random intersection graphs when m = ω(n): An equivalence theorem relating the evolutio of G(m, n, p) and G(n, p) models. Random Structures and Algorithms 16, 156–176 (2000)
Karoński, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8, 131–159 (1999)
Kou, Z.B., Zhang, C.S.: Reply networks on a bulletin board system. Phys. Rev. E. 67, 36117 (2003)
Newman, M.E.J.: The Structure of scientific collaboration networks. Proc. Nat. Acad. Sci. U.S A. 98, 404 (2001)
Newman, M.E.J.: Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E. 64, 6131 (2001)
Newman, M.E.J.: Properties of highly clustered networks. Phys. Rev. E. 68, 026121 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, X., Zhang, C., Chen, J., Li, Y. (2005). On the Scale-Free Intersection Graphs. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424826_129
Download citation
DOI: https://doi.org/10.1007/11424826_129
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25861-2
Online ISBN: 978-3-540-32044-9
eBook Packages: Computer ScienceComputer Science (R0)