Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T21:20:23.666Z Has data issue: false hasContentIssue false
  • English
  • Français

SUBEXPONENTIAL INTERVAL GRAPHS GENERATED BY IMMIGRATION–DEATH PROCESSES

Published online by Cambridge University Press:  18 March 2010

Naoto Miyoshi ,
Mariko Ogura ,
Takeya Shigezumi  and
Ryuhei Uehara
Naoto Miyoshi
Affiliation:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan E-mail: miyoshi@is.titech.ac.jp
Mariko Ogura
Affiliation:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan E-mail: miyoshi@is.titech.ac.jp
Takeya Shigezumi
Affiliation:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan E-mail: miyoshi@is.titech.ac.jp
Ryuhei Uehara
Affiliation:
School of Information Science, Japan Advanced Institute of Science and Technology, Tokyo, Japan
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We propose a simple model of random interval graphs generated by immigration–death processes (also known as M/G/∞ queuing processes), where the length of each interval follows a subexponential distribution, and provide a condition under which the stationary degree distribution is also subexponential. Furthermore, we consider the conditional expectation of the cluster coefficient of a vertex given the degree and show that it vanishes in the limit as the degree goes to infinity under the same condition as that for obtaining the tail asymptotics of the stationary degree distribution.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 24 , Issue 2 , April 2010 , pp. 289 - 301
Copyright
Copyright © Cambridge University Press 2010

References

1.Asmussen, S. (2003). Applied probability and queues, 2nd ed.New York: Springer-Verlag.Google Scholar
2.Asmussen, S., Klüppelberg, C. & Sigman, K. (1999). Sampling at subexponential times, with queueing applications. Stochastic Processes and their Applications 79: 265–286.CrossRefGoogle Scholar
3.Barabási, A.-L. & Albert, R. (1999). Emergence of scaling in random networks. Science 286: 509–512.CrossRefGoogle ScholarPubMed
4.Chistyakov, V.P. (1964). A theorem on sums of independent positive random variables and its applications to branching random processes. Theory of Probability and its Applications 9: 640–648.CrossRefGoogle Scholar
5.Cline, D.B.H. (1986). Convolution tails, product tails and domains of attraction. Probability Theory and Related Fields 72: 529–557.CrossRefGoogle Scholar
6.Cox, D.R. & Isham, V. (1980). Point processes. New York: Chapman & Hall.Google Scholar
7.Daley, D.J. & Vere-Jones, D. (2003/2008). An introduction to the theory of point processes, 2nd ed.New York: Springer-Verlag, Vols. I and II.CrossRefGoogle Scholar
8.Embrechts, P., Klüppelberg, C. & Mikosch, T. (1997). Modelling extremal events; for insurance and finance. Berlin: Springer-Verlag.CrossRefGoogle Scholar
9.Foss, S. & Korshunov, D. (2000). Sampling at a random time with a heavy-tailed distribution. Markov Processes and Related Fields 6: 543–568.Google Scholar
10.Golumbic, M.C. (2004). Algorithmic graph theory and perfect graphs, 2nd ed.Amsterdam: Elsevier.Google Scholar
11.Jelenković, P., Momčilović, P. & Zwart, B. (2004). Reduced load equivalence under subexponentiality. Queueing Systems 46: 97–112.Google Scholar
12.McKee, T.A. & McMorris, F.R. (1999). Topics in intersection graph theory. Philadelphia: SIAM.CrossRefGoogle Scholar
13.Miyoshi, N., Shigezumi, T., Uehara, R. & Watanabe, O. (2009). Scale free interval graphs. Theoretical Computer Sciences 410: 4588–4600.CrossRefGoogle Scholar
14.Newman, M. (2003). The structure and function of complex networks. SIAM Review 45: 167–256.CrossRefGoogle Scholar
15.Rolski, T., Schmidli, H., Schmidt, V. & Teugels, J. (1999). Stochastic processes for insurance and finance. Chichester, UK: Wiley.CrossRefGoogle Scholar
16.Takács, L. (1962). Introduction to the theory of queues. Oxford: Oxford University Press.Google Scholar
17.Watts, D.J. & Strogatz, D.H. (1998). Collective dynamics of ‘small-world’ networks. Nature 393 440–442.CrossRefGoogle ScholarPubMed
18.Wolff, R.W. (1982). Poisson arrivals see time averages. Operations Research 30: 223–231.CrossRefGoogle Scholar