{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:24:13Z","timestamp":1773264253128,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642359255","type":"print"},{"value":"9783642359262","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_2","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"6-19","source":"Crossref","is-referenced-by-count":2,"title":["Infinite Random Geometric Graphs from the Hexagonal Metric"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeannette","family":"Janssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2008.10129305","volume":"5","author":"W. Aiello","year":"2009","unstructured":"Aiello, W., Bonato, A., Cooper, C., Janssen, J., Pra\u0142at, P.: A spatial web graph model with local influence regions. Internet Mathematics\u00a05, 175\u2013196 (2009)","journal-title":"Internet Mathematics"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.dam.2008.03.001","volume":"157","author":"P. Balister","year":"2009","unstructured":"Balister, P., Bollob\u00e1s, B., Sarkar, A., Walters, M.: Highly connected random geometric graphs. Discrete Applied Mathematics\u00a0157, 309\u2013320 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Barbeau, M., Kranakis, E.: Principles of Ad Hoc Networking. John Wiley and Sons (2007)","DOI":"10.1002\/9780470512494"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s004540010081","volume":"25","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Dickerson, M.T., Goodrich, M.T.: Voronoi diagrams for convex polygon-offset distance functions. Discrete & Computational Geometry\u00a025, 271\u2013291 (2001)","journal-title":"Discrete & Computational Geometry"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bonato, A.: A Course on the Web Graph. American Mathematical Society Graduate Studies Series in Mathematics, Providence, Rhode Island (2008)","DOI":"10.1090\/gsm\/089"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-18009-5_11","volume-title":"Algorithms and Models for the Web-Graph","author":"A. Bonato","year":"2010","unstructured":"Bonato, A., Janssen, J., Pra\u0142at, P.: The Geometric Protean Model for On-Line Social Networks. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol.\u00a06516, pp. 110\u2013121. Springer, Heidelberg (2010)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00026-011-0111-8","volume":"15","author":"A. Bonato","year":"2011","unstructured":"Bonato, A., Janssen, J.: Infinite random geometric graphs. Annals of Combinatorics\u00a015, 597\u2013617 (2011)","journal-title":"Annals of Combinatorics"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1016\/j.aim.2008.07.008","volume":"219","author":"C. Borgs","year":"2008","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., S\u00f3s, V.T., Vesztergombi, K.: Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing. Advances in Math.\u00a0219, 1801\u20131851 (2008)","journal-title":"Advances in Math."},{"key":"2_CR9","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., S\u00f3s, V.T., Vesztergombi, K.: Convergent Sequences of Dense Graphs II: Multiway Cuts and Statistical Physics, Preprint (2007)"},{"key":"2_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/9781139171854","volume-title":"Metric Spaces: Iteration and Application","author":"V. Bryant","year":"1985","unstructured":"Bryant, V.: Metric Spaces: Iteration and Application. Cambridge University Press, Cambridge (1985)"},{"key":"2_CR11","first-page":"333","volume-title":"Algorithms and Combinatorics","author":"P.J. Cameron","year":"1997","unstructured":"Cameron, P.J.: The random graph. In: Graham, R.L., Ne\u0161et\u0159il, J. (eds.) Algorithms and Combinatorics, vol.\u00a014, pp. 333\u2013351. Springer, New York (1997)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-0348-8268-2_15","volume-title":"European Congress of Mathematics","author":"P.J. Cameron","year":"2001","unstructured":"Cameron, P.J.: The random graph revisited. In: Casacuberta, C., Mir\u00f3-Roig, R.M., Verdera, J., Xamb\u00f3-Descamps, S. (eds.) European Congress of Mathematics, vol.\u00a0I, pp. 267\u2013274. Birkhauser, Basel (2001)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1998.0957","volume":"29","author":"L.P. Chew","year":"1998","unstructured":"Chew, L.P., Kedem, K., Sharir, M., Tagansky, B., Welzl, E.: Voronoi diagrams of lines in three dimensions under polyhedral convex distance functions. J. Algorithms\u00a029, 238\u2013255 (1998)","journal-title":"J. Algorithms"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1002\/rsa.20103","volume":"29","author":"R. Ellis","year":"2006","unstructured":"Ellis, R., Jia, X., Yan, C.H.: On random points in the unit disk. Random Algorithm and Structures\u00a029, 14\u201325 (2006)","journal-title":"Random Algorithm and Structures"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01895716","volume":"14","author":"P. Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: Asymmetric graphs. Acta Mathematica Academiae Scientiarum Hungaricae\u00a014, 295\u2013315 (1963)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/15427951.2006.10129124","volume":"3","author":"A. Flaxman","year":"2006","unstructured":"Flaxman, A., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks. Internet Mathematics\u00a03, 187\u2013205 (2006)","journal-title":"Internet Mathematics"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S0963548308009334","volume":"18","author":"A.M. Frieze","year":"2009","unstructured":"Frieze, A.M., Kleinberg, J., Ravi, R., Debany, W.: Line of sight networks. Combinatorics, Probability and Computing\u00a018, 145\u2013163 (2009)","journal-title":"Combinatorics, Probability and Computing"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Fu, N., Imai, H., Moriyama, S.: Voronoi diagrams on periodic graphs. In: Proceedings of the International Symposium on Voronoi Diagrams in Science and Engineering (2010)","DOI":"10.1109\/ISVD.2010.26"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"2535","DOI":"10.1214\/105051605000000575","volume":"15","author":"A. Goel","year":"2005","unstructured":"Goel, A., Rai, S., Krishnamachari, B.: Monotone properties of random geometric graphs have sharp thresholds. Annals of Applied Probability\u00a015, 2535\u20132552 (2005)","journal-title":"Annals of Applied Probability"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Icking, C., Klein, R., Le, N., Ma, L.: Convex distance functions in 3-space are different. In: Proceedings of the Ninth Annual Symposium on Computational Geometry (1993)","DOI":"10.1145\/160985.161007"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Janssen, J.: Spatial models for virtual networks. In: Proceedings of the 6th Computability in Europe (2010)","DOI":"10.1007\/978-3-642-13962-8_23"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","volume":"96","author":"L. Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Limits of dense graph sequences. J. Comb. Theory B\u00a096, 933\u2013957 (2006)","journal-title":"J. Comb. Theory B"},{"key":"2_CR23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/71.629486","volume":"8","author":"I. Stojmenovic","year":"1997","unstructured":"Stojmenovic, I.: Honeycomb networks: Topological properties and communication algorithms. IEEE Transactions on Parallel and Distributed Systems\u00a08, 1036\u20131042 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2_CR25","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall (2001)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:48Z","timestamp":1620135228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}