{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:29:29Z","timestamp":1742930969174,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642305405"},{"type":"electronic","value":"9783642305412"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30541-2_8","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T15:48:16Z","timestamp":1340034496000},"page":"93-112","source":"Crossref","is-referenced-by-count":10,"title":["On Certain Properties of Random Apollonian Networks"],"prefix":"10.1007","author":[{"given":"Alan","family":"Frieze","sequence":"first","affiliation":[]},{"given":"Charalampos E.","family":"Tsourakakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Experimental Mathemathics\u00a010(1), 53\u201366 (2001)","journal-title":"Experimental Mathemathics"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Albenque, M., Marckert, J.F.: Some families of increasing planar maps. Electronic Journal of Probability\u00a013, 1624\u20131671","DOI":"10.1214\/EJP.v13-563"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley-Interscience (2008)","DOI":"10.1002\/9780470277331"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"018702","DOI":"10.1103\/PhysRevLett.94.018702","volume":"94","author":"J.S. Andrade","year":"2005","unstructured":"Andrade, J.S., Herrmann, H.J., Andrade, R.F.S., da Silva, L.R.: Apollonian networks: simultaneously scale-free, small world Euclidean, space filling, and with matching graphs. Phys. Rev. Lett.\u00a094, 018702 (2005)","journal-title":"Phys. Rev. Lett."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Andrade, R.F.S., Miranda, J.G.V.: Spectral Properties of the Apollonian Network. Physica A\u00a0356 (2005)","DOI":"10.1016\/j.physa.2005.05.003"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"3","author":"K. Azuma","year":"1967","unstructured":"Azuma, K.: Weighted sums of certain dependent variables. Tohoku Math. J\u00a03, 357\u2013367 (1967)","journal-title":"Tohoku Math. J"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"8_CR8","unstructured":"Bodini, O., Darrasse, A., Soria, M.: Distances in random Apollonian network structures Arxiv, \n                    http:\/\/arxiv.org\/abs\/0712.2129"},{"key":"8_CR9","unstructured":"Bollob\u00e1s, B., Riordan, O.: The Diameter of a Scale-Free Random Graph. Combinatorica (2002)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The Degree Sequence of a Scale Free Random Graph Process. Random Struct. Algorithms\u00a018(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1090\/S0025-5718-1982-0658230-7","volume":"19","author":"D.W. Boyd","year":"1982","unstructured":"Boyd, D.W.: The Sequence of Radii of the Apollonian Packing. Mathematics of Computation\u00a019, 249\u2013254 (1982)","journal-title":"Mathematics of Computation"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00453-006-0112-x","volume":"46","author":"N. Broutin","year":"2006","unstructured":"Broutin, N., Devroye, L.: Large Deviations for the Weighted Height of an Extended Class of Trees. Algorithmica\u00a046, 271\u2013297 (2006)","journal-title":"Algorithmica"},{"key":"8_CR13","unstructured":"Chung Graham, F.: Spectral Graph Theory. American Mathematical Society (1997)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Chung Graham, F., Lu, L.: Complex Graphs and Networks, (107). American Mathematical Society (2006)","DOI":"10.1090\/cbms\/107"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L., Vu, V.H.: Spectra of random graphs with given expected degrees. Proceedings of the National Academy of Sciences of the United States of America\u00a0100, 6313\u20136318","DOI":"10.1073\/pnas.0937490100"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/rsa.10084","volume":"22","author":"C. Cooper","year":"2003","unstructured":"Cooper, C., Frieze, A.: A general model of web graphs. Random Structures & Algorithms\u00a022(3), 311\u2013335 (2003)","journal-title":"Random Structures & Algorithms"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s11786-010-0041-6","volume":"3","author":"C. Cooper","year":"2010","unstructured":"Cooper, C., Uehara, R.: Scale Free Properties of random k-trees. Mathematics in Computer Science\u00a03(4), 489\u2013496 (2010)","journal-title":"Mathematics in Computer Science"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Darrasse, A., Soria, M.: Degree distribution of random Apollonian network structures and Boltzmann sampling. In: 2007 Conference on Analysis of Algorithms, AofA 2007, DMTCS Proceedings (2007)","DOI":"10.46298\/dmtcs.3521"},{"key":"8_CR19","unstructured":"Darrasse, A., Hwang, H.-K., Bodini, O., Soria, M.: The connectivity-profile of random increasing k-trees, Arxiv, \n                    http:\/\/arxiv.org\/abs\/0910.3639"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"016128","DOI":"10.1103\/PhysRevE.71.016128","volume":"71","author":"J.P.K. Doye","year":"2005","unstructured":"Doye, J.P.K., Massen, C.P.: Self-similar disk packings as model spatial scale-free networks. Phys. Rev. E\u00a071, 016128 (2005)","journal-title":"Phys. Rev. E"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-45465-9_11","volume-title":"Automata, Languages and Programming","author":"A. Fabrikant","year":"2002","unstructured":"Fabrikant, A., Koutsoupias, E., Papadimitriou, C.: Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 110\u2013122. Springer, Heidelberg (2002)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Flaxman, A., Frieze, A., Fenner, T.: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics\u00a02(1) (2005)","DOI":"10.1080\/15427951.2005.10129097"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Gao, Y.: The degree distribution of random k-trees. Theoretical Computer Science\u00a0410(8-10) (2009)","DOI":"10.1016\/j.tcs.2008.10.015"},{"key":"8_CR24","unstructured":"Gao, Y., Hobson, C.: Random k-tree as a model for complex networks. In: Workshop on Algorithms and Models for the Web-Graph, WAW (2006)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lagarias, J.C., Mallows, C.L., Wilks, A.R., Yan, C.H.: Apollonian Circle Packings: Number Theory. J. Number Theory\u00a0100(1), 1\u201345, MR1971245","DOI":"10.1016\/S0022-314X(03)00015-5"},{"key":"8_CR26","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sumes of bounded random variables. J. Amer. Statist. Assoc.\u00a058, 13\u201330 (1963)","journal-title":"J. Amer. Statist. Assoc."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Kloks, T.: Treewidth: Computations and Approximations. Springer (1994)","DOI":"10.1007\/BFb0045375"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using Kronecker multiplication. In: Machine Learning Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvalis, Oregon, USA, June 20-24 (2007)","DOI":"10.1145\/1273496.1273559"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45726-7_20","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M. Mihail","year":"2002","unstructured":"Mihail, M., Papadimitriou, C.: On the Eigenvalue Power Law. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, pp. 254\u2013262. Springer, Heidelberg (2002)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Panholzer, A., Seitz, G.: Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model. In: DMTCS Proc., AofA 2010, pp. 549\u2013564 (2010)","DOI":"10.46298\/dmtcs.2778"},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2007.10129135","volume":"4","author":"P. Pralat","year":"2007","unstructured":"Pralat, P., Wormald, N.: Growing Protean Graphs. Internet Mathematics\u00a04(1), 1\u201316 (2007)","journal-title":"Internet Mathematics"},{"key":"8_CR32","unstructured":"Strang, G.: Linear Algebra and Its Applications. Brooks Cole (2005)"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Wu, Z.-X., Xu, X.-J., Wang, Y.-H.: Comment on \u201cMaximal planar networks with large clustering coefficient and power-law degree distribution\u201d. Physical Review, E\u00a073, 058101 (2006)","DOI":"10.1103\/PhysRevE.73.058101"},{"key":"8_CR34","unstructured":"Zhang, Z.Z., Comellas, F., Fertin, G., Rong, L.L.: High dimensional Apollonian networks, ArXiv, \n                    http:\/\/arxiv.org\/abs\/cond-mat\/0503316"},{"key":"8_CR35","doi-asserted-by":"crossref","first-page":"046141","DOI":"10.1103\/PhysRevE.71.046141","volume":"71","author":"T. Zhou","year":"2005","unstructured":"Zhou, T., Yan, G., Wang, B.H.: Maximal planar networks with large clustering coefficient and power-law degree distribution. Phys. Rev. E\u00a071, 046141 (2005)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30541-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T02:38:23Z","timestamp":1676774303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30541-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642305405","9783642305412"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30541-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}