Non-hyperbolicity of random graphs with given expected degrees

Stochastic Models

Volumn 29, Issue 4, 2013, Pages 451-462

  Shang, Yilun ^a  

^a SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

Author keywords

Hyperbolicity; Inhomogeneous degree; Random graphs

Indexed keywords

HYPERBOLICITY; INHOMOGENEOUS DEGREE; POSITIVE PROBABILITY; POWER LAW DEGREE DISTRIBUTION; RANDOM GRAPHS; RANDOM NETWORK;

STATISTICS; STOCHASTIC MODELS;

GRAPH THEORY;

EID: 84887714552     PISSN: 15326349     EISSN: 15324214     Source Type: Journal    
DOI: 10.1080/15326349.2013.838510     Document Type: Article

References (29)

1. Albert, R.;, Barabási, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 2002, 74, 47-97.
2. Arnborg, S.;, Lagergren, J.;, Seese, D. Easy problems for tree-decomposable graphs. J. Algorithms 1991, 12, 308-340.
3. Bollobás, B. Random Graphs; Cambridge University Press: New York, 2001.
4. Bollobás, B.;, Janson, S.;, Riordan, O. The phase transition in inhomogeneous random graphs. Random Struct. Alg. 2007, 31, 3-122.
5. Brinkmann, G.;, Koolen, J.;, Moulton, V. On the hyperbolicity of chordal graphs. Ann. Comb. 2001, 5, 61-69.
6. Brisdon, M.;, Haefliger, A. Metric Spaces of Non-positive Curvature; Springer: New York, 1991.
7. Britton, T.;, Deijfen, M.;, Martin-Löf, A. Generating simple random graphs with prescribed degree distribution. J. Statist. Phys. 2006, 124, 1377-1397. (Pubitemid 44581233)
8. Clauset, A.;, Shalizi, C.R.;, Newman, M.E.J. Power-law distributions in empirical data. SIAM Rev. 2009, 51, 661-703.
9. Chen, W.;, Fang, W.;, Hu, G.;, Mahoney, M.W. On the hyperbolicity of small-world and tree-like random graphs. Lecture Notes Comp. Sci. 2012, 7676, 278-288.
10. Chung, F.;, Lu, L. The volume of the giant component of a random graph with given expected degrees. SIAM J. Discrete Math. 2006, 20, 395-411. (Pubitemid 46785431)
11. Chung, F.;, Lu, L.;, Vu, V. Eigenvalues of random power law graphs. Ann. Comb. 2003, 7, 21-33.
12. Clauset, A.;, Moore, C.;, Newman, M.E.J. Hierarchical structure and the prediction of missing links in networks. Nature 2008, 453, 98-101. (Pubitemid 351630323)
13. Gromov, M. Hyperbolic groups. In Essays in Group Theory; Gersten, S.M., Ed.; Springer: New York, 1987; 75-263.
14. Gubser, S.S.;, Klebanov, I.R.;, Polyakov, A.M. Gauge theory correlators from non-critical string theory. Phys. Lett. B 1998, 428, 105-114. (Pubitemid 128427609)
15. Jonckheere, E.;, Lohsoonthorn, P. A hyperbolic geometry approach to multi-path routing. Proc. 10th Mediterranean Conf. on Control and Automation, Lisbon, Portugal, 2002, FA5-1.
16. Jonckheere, E.;, Lohsoonthorn, P. Geometry of network security. Proc. American Control Conference, 2004, 976-981.
17. Jonckheere, E.;, Lou, M.;, Hespanha, J.;, Barooah, P. Effective resistance of Gromov-hyperbolic graphs: Application to asymptotic sensor network problems. Proc. 46th IEEE Conference on Decision and Control, 2007, 1453-1458. (Pubitemid 351277358)
18. Krioukov, D.;, Papadopoulos, F.;, Kitsak, M.;, Vahdat, A.;, Boguñá, M. Hyperbolic geometry of complex networks. Phys. Rev. E 2010, 82, 036106.
19. Maldacena, J. The large- n limit of superconformal field theories and supergravity. Int. J. Theor. Phys. 1999, 38, 1113-1133.
20. Narayan, O.;, Saniee, I. Large-scale curvature of networks. Phys. Rev. E 2011, 84, 066108.
21. Narayan, O.;, Saniee, I.;, Tucci, G.H. Lack of spectral gap and hyperbolicity in asymptotic Erdos-Rényi random graphs. Proc. 5th International Symposium on Communications, Control and Signal Processing, 2012, 1-4.
22. Newman, M.E.J. Random graphs with clustering. Phys. Rev. Lett. 2009, 103, 058701.
23. Papadopoulos, F.;, Kitsak, M.;, Serrano, M.Á.;, Boguñá, M.;, Krioukov, D. Popularity versus similarity in growing networks. Nature 2012, 489, 537-540.
24. Shang, Y. Lack of Gromov-hyperbolicity in colored random networks. Panamer. Math. J. 2011, 21, 27-36.
25. Shang, Y. Robustness of scale-free networks under attack with tunable grey information. EPL 2011, 95, 28005.
26. Shang, Y. Lack of Gromov-hyperbolicity in small-world networks. Cent. Eur. J. Math. 2012, 10, 1152-1158.
27. Shang, Y. Large dicliques in a directed inhomogeneous random graph. Int. J. Comput. Math. 2013, 90, 445-456.
28. Squartini, T.;, Garlaschelli, D. Analytical maximum-likelihood method to detect patterns in real networks. New J. Phys. 2011, 13, 083001.
29. Tucci, G.H. Non hyperbolicity in random regular graphs and their traffic characteristics. Cent. Eur. J. Math. 2013, 11, 1593-1597.