{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:01Z","timestamp":1725497161647},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75414-5_15","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:22:54Z","timestamp":1196940174000},"page":"236-246","source":"Crossref","is-referenced-by-count":2,"title":["The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Sotiris","family":"Nikoletseas","sequence":"first","affiliation":[]},{"given":"Christoforos","family":"Raptopoulos","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. John Wiley & Sons, Inc., Chichester (2000)","edition":"2"},{"key":"15_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"3","key":"15_CR3","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P. Diaconis","year":"1993","unstructured":"Diaconis, P., Saloff-Coste, L.: Comparison Theorems for Reversible Markov Chains. The Annals of Applied Probability\u00a03(3), 696\u2013730 (1993)","journal-title":"The Annals of Applied Probability"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/jagm.2000.1149","volume":"39","author":"J. D\u00edaz","year":"2001","unstructured":"D\u00edaz, J., Penrose, M.D., Petit, J., Serna, M.: Approximating Layout Problems on Random Geometric Graphs. Journal of Algorithms\u00a039, 78\u2013116 (2001)","journal-title":"Journal of Algorithms"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-49543-6_23","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"J. D\u00edaz","year":"1998","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: Random Geometric Problems on [0, 1]2. In: Rolim, J.D.P., Serna, M.J., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 294\u2013306. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A Random Graph Model for Optical Networks of Sensors. In: The 1st International Workshop on Efficient and Experimental Algorithms (WEA) (2003), also in the IEEE Transactions on Mobile Computing Journal 2(3) 186\u2013196 (2003)","key":"15_CR6","DOI":"10.1109\/TMC.2003.1233525"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1007\/11523468_56","volume-title":"Automata, Languages and Programming","author":"C. Efthymiou","year":"2005","unstructured":"Efthymiou, C., Spirakis, P.: On the Existence of Hamilton Cycles in Random Intersection Graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 690\u2013701. Springer, Heidelberg (2005)"},{"unstructured":"Fill, J.A., Sheinerman, 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, http:\/\/citeseer.nj.nec.com\/fill98random.html","key":"15_CR8"},{"key":"15_CR9","first-page":"67","volume-title":"Studies in Classification, Data Analysis and Knowledge Organisation","author":"E. Godehardt","year":"2002","unstructured":"Godehardt, E., Jaworski, J.: Two models of Random Intersection Graphs for Classification. In: Opitz, O., Schwaiger, M. (eds.) Studies in Classification, Data Analysis and Knowledge Organisation, pp. 67\u201382. Springer, Heidelberg (2002)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. Information and Computation\u00a082, 93\u2013133 (1989)","journal-title":"Information and Computation"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Scheinerman, E.R., Singer-Cohen, K.B.: On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing journal\u00a08, 131\u2013159 (1999)","journal-title":"Combinatorics, Probability and Computing journal"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","volume":"33","author":"E. Marczewski","year":"1945","unstructured":"Marczewski, E.: Sur deux propri\u00e9t\u00e9s des classes d\u2019 ensembles. Fund. Math.\u00a033, 303\u2013307 (1945)","journal-title":"Fund. Math."},{"unstructured":"Nikoletseas, S., Palem, K., Spirakis, P., Yung, M.: Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 508\u2013519. Springer, Heidelberg (1994), also in the Special Issue on Randomized Computing of the International Journal of Foundations of Computer Science (IJFCS) 11(2), 247\u2013262 (2000)","key":"15_CR13"},{"unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.: 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), also in the Theoretical Computer Science (TCS) Journal (to appear, 2007)","key":"15_CR14"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-59042-0_93","volume-title":"STACS 1995","author":"S. Nikoletseas","year":"1995","unstructured":"Nikoletseas, S., Spirakis, P.: Expander Properties in Random Regular Graphs with Edge Faults. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 421\u2013432. Springer, Heidelberg (1995)"},{"doi-asserted-by":"crossref","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability (2003)","key":"15_CR16","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11602613_50","volume-title":"Algorithms and Computation","author":"C. Raptopoulos","year":"2005","unstructured":"Raptopoulos, C., Spirakis, P.: Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 493\u2013504. Springer, Heidelberg (2005)"},{"unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting: a Markov Chain Approach. PhD Thesis, University of Edimburg (1988)","key":"15_CR18"},{"doi-asserted-by":"crossref","unstructured":"Sinclair, A. (ed.): Algorithms for Random Generation and Counting. Birkhauser (1992)","key":"15_CR19","DOI":"10.1007\/978-1-4612-0323-0"},{"unstructured":"Singer-Cohen, K.B.: Random Intersection Graphs. PhD thesis, John Hopkins University (1995)","key":"15_CR20"},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.20005","volume":"24","author":"D. Stark","year":"2004","unstructured":"Stark, D.: The Vertex Degree Distribution of Random Intersection Graphs. Random Structures & Algorithms\u00a024(3), 249\u2013258 (2004)","journal-title":"Random Structures & Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:03Z","timestamp":1619521263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754138"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_15","relation":{},"subject":[]}}