Scale free interval graphs

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Scale free graphs have attracted attention by their non-uniform structure that can be used as a model for various social and physical networks. In this paper, we propose a natural and simple random model for generating scale free interval graphs. The model generates a set of intervals randomly, which defines a random interval graph. The main advantage of the model is its simpleness. The structure/properties of the generated graphs are analyzable by relatively simple probabilistic and/or combinatorial arguments, which is different from the most of the other models for which we need to approximate the processes by certain differential equations. We indeed show that the distribution of degrees follows power law, and it achieves large cluster coefficient. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Miyoshi, N., Shigezumi, T., Uehara, R., & Watanabe, O. (2008). Scale free interval graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 292–303). https://doi.org/10.1007/978-3-540-68880-8_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free