{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:36:18Z","timestamp":1725842178276},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319267838"},{"type":"electronic","value":"9783319267845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26784-5_8","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T10:07:47Z","timestamp":1449655667000},"page":"95-106","source":"Crossref","is-referenced-by-count":3,"title":["Local Majority Dynamics on Preferential Attachment Graphs"],"prefix":"10.1007","author":[{"given":"Mohammed Amin","family":"Abdullah","sequence":"first","affiliation":[]},{"given":"Michel","family":"Bode","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Fountoulakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.07.026","volume":"180","author":"MA Abdullah","year":"2015","unstructured":"Abdullah, M.A., Draief, M.: Global majority consensus by local majority polling on graphs of a given degree sequence. Discrete Appl. Math. 180, 1\u201310 (2015)","journal-title":"Discrete Appl. Math."},{"key":"8_CR2","unstructured":"Abdullah, M.A., Fountoulakis, N.: A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs, \n                      arXiv:1404.4070"},{"key":"8_CR3","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. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"8_CR4","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs, (in preparation) \n                      http:\/\/stat-www.berkeley.edu\/pub\/users\/aldous\/RWG\/book.html"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24, 5\u201334 (2004)","journal-title":"Combinatorica"},{"key":"8_CR6","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 18, 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.disc.2003.10.020","volume":"282","author":"PG Buckley","year":"2004","unstructured":"Buckley, P.G., Osthus, D.: Popularity based random graph models leading to a scale-free degree sequence. Discrete Math. 282, 53\u201368 (2004)","journal-title":"Discrete Math."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-662-43951-7_37","volume-title":"Automata, Languages, and Programming","author":"C Cooper","year":"2014","unstructured":"Cooper, C., Els\u00e4sser, R., Radzik, T.: The power of two choices in distributed voting. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 435\u2013446. Springer, Heidelberg (2014)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.jctb.2006.05.007","volume":"97","author":"C Cooper","year":"2004","unstructured":"Cooper, C., Frieze, A.: The cover time of the preferential attachment graph. J. Comb. Theor. Ser. B 97, 269\u2013290 (2004)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"8_CR10","unstructured":"Cruise, J., Ganesh, A.: Probabilistic consensus via polling and majority rules. In: Proceeidngs of Allerton Conference (2010)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"SN Dorogovtsev","year":"2000","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks with preferential linking. Phys. Rev. Lett. 85, 4633\u20134636 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"8_CR12","unstructured":"Drinea, E., Enachescu, M., Mitzenmacher, M.: Variations on random graph models for the web. Technical report TR-06-01, Harvard University, Department of Computer Science (2001)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.2001.3088","volume":"171","author":"Y Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Inf. Comput. 171, 248\u2013268 (2001)","journal-title":"Inf. Comput."},{"key":"8_CR14","unstructured":"van der Hofstad, R.: Random Graphs and Complex Networks (2013). \n                      http:\/\/www.win.tue.nl\/~rhofstad\/NotesRGCN.pdf"},{"key":"8_CR15","unstructured":"Mossel, E., Neeman, J., Tamuz, O.: Majority dynamics and aggregation of nformation in social networks (2012). \n                      arXiv:1207.0893"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1093\/biomet\/42.3-4.425","volume":"42","author":"HA Simon","year":"1955","unstructured":"Simon, H.A.: On a class of skew distribution functions. Biometrika 42, 425\u2013440 (1955)","journal-title":"Biometrika"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1098\/rstb.1925.0002","volume":"213","author":"GU Yule","year":"1925","unstructured":"Yule, G.U.: A mathematical theory of evolution, based on the conclusions of Dr. J.G. Willis F.R.S. Phil. Trans. Roy. Soc. Lond. B 213, 21\u201387 (1925)","journal-title":"Phil. Trans. Roy. Soc. Lond. B"}],"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-319-26784-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:14:09Z","timestamp":1559337249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26784-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319267838","9783319267845"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26784-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}