{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:48Z","timestamp":1725570768706},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180088"},{"type":"electronic","value":"9783642180095"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-18009-5_5","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:31:28Z","timestamp":1291303888000},"page":"36-49","source":"Crossref","is-referenced-by-count":15,"title":["Component Evolution in General Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Milan","family":"Bradonji\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aric","family":"Hagberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas W.","family":"Hengartner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allon G.","family":"Percus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys.\u00a074(1), 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. John Wiley & Sons, Inc., New York (2000)","edition":"2"},{"issue":"5439","key":"5_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Behrisch, M.: Component evolution in random intersection graphs. Electr. J. Comb.\u00a014 (2007)","DOI":"10.37236\/935"},{"key":"5_CR5","unstructured":"Bernstein, S.N.: On a modification of chebyshevs inequality and of the error formula of laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math.\u00a04(25) (1924)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.20256","volume":"53","author":"M. Bloznelis","year":"2009","unstructured":"Bloznelis, M., Jaworski, J., Rybarczyk, K.: Component evolution in a secure wireless sensor network. Netw.\u00a053(1), 19\u201326 (2009)","journal-title":"Netw."},{"issue":"25","key":"5_CR7","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences of the United States of America\u00a099(25), 15879\u201315882 (2002)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1017\/S0269964809990064","volume":"23","author":"M. Deijfen","year":"2009","unstructured":"Deijfen, M., Kets, W.: Random intersection graphs with tunable degree distribution and clustering. Probab. Eng. Inf. Sci.\u00a023(4), 661\u2013674 (2009)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Canad. J. Math.\u00a018, 106\u2013112 (1966)","journal-title":"Canad. J. Math."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Godehardt, E., Jerzy Jaworski, K.R.: Random intersection graphs and classification. In: Advances in Data Analysis, vol.\u00a045, pp. 67\u201374 (2007)","DOI":"10.1007\/978-3-540-70981-7_8"},{"issue":"6988","key":"5_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1038\/nature02541","volume":"429","author":"S. Eubank","year":"2004","unstructured":"Eubank, S., Guclu, H., Anil Kumar, V.S., Marathe, M.V., Srinivasan, A., Toroczkai, Z., Wang, N.: Modelling disease outbreaks in realistic urban social networks. Nature\u00a0429(6988), 180\u2013184 (2004)","journal-title":"Nature"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-H","volume":"16","author":"J.A. Fill","year":"2000","unstructured":"Fill, J.A., Scheinerman, E.R., Singer-Cohen, K.B.: Random intersection graphs when m\u2009=\u2009\u03c9(n): An equivalence theorem relating the evolution of the g(n, m, p) and g(n,p) models. Random Struct. Algorithms\u00a016(2), 156\u2013176 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S1571-0653(04)00377-4","volume":"10","author":"E. Godehardt","year":"2001","unstructured":"Godehardt, E., Jaworski, J.: Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics\u00a010, 129\u2013132 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.physa.2006.04.047","volume":"371","author":"J.-L. Guillaume","year":"2006","unstructured":"Guillaume, J.-L., Latapy, M.: Bipartite graphs as models of complex networks. Physica A: Statistical and Theoretical Physics\u00a0371(2), 795\u2013813 (2006)","journal-title":"Physica A: Statistical and Theoretical Physics"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0963548308009103","volume":"17","author":"J. Jaworski","year":"2008","unstructured":"Jaworski, J., Stark, D.: The vertex degree distribution of passive random intersection graph models. Comb. Probab. Comput.\u00a017(4), 549\u2013558 (2008)","journal-title":"Comb. Probab. Comput."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Karo\u0144ski, M., Scheinerman, E., Singer-Cohen, K.: On random intersection graphs:the subgraph problem. Combinatorics, Probability and Computing\u00a08 (1999)","DOI":"10.1017\/S0963548398003459"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Lager\u00e5s, A.N., Lindholm, M.: A note on the component structure in random intersection graphs. Electronic Journal of Combinatorics\u00a015(1) (2008)","DOI":"10.37236\/885"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"16131","DOI":"10.1103\/PhysRevE.64.016131","volume":"64","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J.: Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E\u00a064(1), 016131 (2001)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"36122","DOI":"10.1103\/PhysRevE.68.036122","volume":"68","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. E\u00a068(3), 036122 (2003)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"26118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E\u00a064(2), 026118 (2001)","journal-title":"Phys. Rev. E"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.tcs.2008.06.047","volume":"406","author":"S. Nikoletseas","year":"2008","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Large independent sets in general random intersection graphs. Theor. Comput. Sci.\u00a0406, 215\u2013224 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/978-3-540-27836-8_86","volume-title":"Automata, Languages and Programming","author":"S.E. Nikoletseas","year":"2004","unstructured":"Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The existence and efficient construction of large independent sets in general random intersection graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1029\u20131040. Springer, Heidelberg (2004)"},{"issue":"50","key":"5_CR23","doi-asserted-by":"publisher","first-page":"5261","DOI":"10.1016\/j.tcs.2009.08.028","volume":"410","author":"S.E. Nikoletseas","year":"2009","unstructured":"Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: Expander properties and the cover time of random intersection graphs. Theor. Comput. Sci.\u00a0410(50), 5261\u20135272 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR24","unstructured":"van der Hofstad, R.: Random graphs and complex networks. Lecture notes in preparation, http:\/\/www.win.tue.nl\/~rhofstad\/NotesRGCN.html"},{"key":"5_CR25","unstructured":"Rybarczyk, K.: Equivalence of the random intersection graph and G(n,p) (2009) (submitted), http:\/\/arxiv.org\/abs\/0910.5311"},{"key":"5_CR26","unstructured":"Singer-Cohen, K.: Random intersection graphs. PhD thesis, Johns Hopkins University (1995)"},{"issue":"6684","key":"5_CR27","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of Small-World networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18009-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T08:03:36Z","timestamp":1592121816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18009-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642180088","9783642180095"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18009-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}