{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:12:46Z","timestamp":1693861966993},"reference-count":19,"publisher":"Elsevier BV","issue":"13-14","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"U.S. NSF","award":["CCF 728763","CNS 1016742"]},{"name":"DARPA\/IPTO IT-MANET program","award":["W911NF-07-1-0028"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1016\/j.dam.2013.03.022","type":"journal-article","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T16:23:13Z","timestamp":1366647793000},"page":"2120-2132","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Percolation in the secrecy graph"],"prefix":"10.1016","volume":"161","author":[{"given":"Amites","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"Martin","family":"Haenggi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2013.03.022_br000005","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF01219071","article-title":"Uniqueness of the infinite cluster and continuity of connectivity functions for short- and long-range percolation","volume":"111","author":"Aizenman","year":"1987","journal-title":"Communications in Mathematical Physics"},{"key":"10.1016\/j.dam.2013.03.022_br000010","unstructured":"P. Balister, B. Bollob\u00e1s, Percolation in the k-nearest neighbor graph (submitted for publication)."},{"key":"10.1016\/j.dam.2013.03.022_br000015","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1002\/rsa.20064","article-title":"Continuum percolation in the square and the disk","volume":"26","author":"Balister","year":"2005","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/j.dam.2013.03.022_br000020","series-title":"Percolation","author":"Bollob\u00e1s","year":"2006"},{"key":"10.1016\/j.dam.2013.03.022_br000025","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01217735","article-title":"Density and uniqueness in percolation","volume":"121","author":"Burton","year":"1989","journal-title":"Communications in Mathematical Physics"},{"key":"10.1016\/j.dam.2013.03.022_br000030","series-title":"Lecture Notes on Particle Systems and Percolation","author":"Durrett","year":"1988"},{"key":"10.1016\/j.dam.2013.03.022_br000035","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0109045","article-title":"Random plane networks","volume":"9","author":"Gilbert","year":"1961","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"10.1016\/j.dam.2013.03.022_br000040","doi-asserted-by":"crossref","unstructured":"M. Haenggi, The secrecy graph and some of its properties, in: 2008 IEEE International Symposium on Information Theory, ISIT\u201908, Toronto, Canada, 2008.","DOI":"10.1109\/ISIT.2008.4595044"},{"key":"10.1016\/j.dam.2013.03.022_br000045","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1214\/154957806000000096","article-title":"Uniqueness and non-uniqueness in percolation theory","volume":"3","author":"H\u00e4ggstr\u00f6m","year":"2006","journal-title":"Probability Surveys"},{"key":"10.1016\/j.dam.2013.03.022_br000050","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/(SICI)1098-2418(199610)9:3<295::AID-RSA3>3.0.CO;2-S","article-title":"Nearest neighbor and hard sphere models in continuum percolation","volume":"9","author":"H\u00e4ggstr\u00f6m","year":"1996","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/j.dam.2013.03.022_br000055","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1214\/aop\/1176992809","article-title":"On continuum percolation","volume":"13","author":"Hall","year":"1985","journal-title":"Annals of Probability"},{"key":"10.1016\/j.dam.2013.03.022_br000060","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1017\/S0305004100034241","article-title":"A lower bound for the critical probability in a certain percolation process","volume":"56","author":"Harris","year":"1960","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"10.1016\/j.dam.2013.03.022_br000065","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1214\/aoap\/1177004978","article-title":"Uniqueness of unbounded occupied and vacant compenents in Boolean models","volume":"4","author":"Meester","year":"1994","journal-title":"Advances in Applied Probability"},{"key":"10.1016\/j.dam.2013.03.022_br000070","series-title":"Continuum Percolation","author":"Meester","year":"1996"},{"key":"10.1016\/j.dam.2013.03.022_br000075","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1214\/aoap\/1034968142","article-title":"Continuum percolation and Euclidean minimal spanning trees in high dimensions","volume":"6","author":"Penrose","year":"1996","journal-title":"Advances in Applied Probability"},{"key":"10.1016\/j.dam.2013.03.022_br000080","doi-asserted-by":"crossref","unstructured":"P.C. Pinto, J. Barros, M.Z. Win, Physical-layer security in stochastic wireless networks, in: Proceedings of the 11th IEEE Singapore International Conference on Communication Systems, 2008.","DOI":"10.1109\/ICCS.2008.4737329"},{"key":"10.1016\/j.dam.2013.03.022_br000085","doi-asserted-by":"crossref","unstructured":"P.C. Pinto, M.Z. Win, Continuum percolation in the intrinsically secure communications graph, posted on the arXiv, 22 July, 2010.","DOI":"10.1109\/ISITA.2010.5649155"},{"key":"10.1016\/j.dam.2013.03.022_br000090","doi-asserted-by":"crossref","unstructured":"P.C. Pinto, M.Z. Win, Percolation and connectivity in the intrinsically secure communications graph, posted on the arXiv, 24 August, 2010.","DOI":"10.1109\/ISITA.2010.5649155"},{"key":"10.1016\/j.dam.2013.03.022_br000095","series-title":"Probability with Martingales","author":"Williams","year":"1991"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13001698?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13001698?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T22:55:42Z","timestamp":1562972142000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X13001698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":19,"journal-issue":{"issue":"13-14","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["S0166218X13001698"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2013.03.022","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Percolation in the secrecy graph","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2013.03.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
