. A. Bibliography-[-ad15-]-m, M. Abdullah, and . Draief, Global majority consensus by local majority polling on graphs of a given degree sequence, Discrete Applied Mathematics, pp.1-10, 2015.

P. [. Adler, K. Berenbrink, and . Schröder, Analyzing an Infinite Parallel Job Allocation Process, Proceedings of the 6th Annual European Symposium on Algorithms. ESA, pp.417-428, 1998.
DOI : 10.1007/3-540-68530-8_35

M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen, Parallel randomized load balancing, Random Structures & Algorithms2%3C159::AID-RSA3%3E3.0.CO, pp.159-188, 1998.

J. [. Aldous, . S. Fillalf03-]-a, and . Alfa, Reversible Markov Chains and Random Walks on Graphs. Unpublished. http : / / www . stat . berkeley Algorithmic analysis of the BMAP/D/k system in discrete time, In Adv. in Appl. Probab, vol.35, issue.4, pp.1131-1152, 2002.

A. D. Alistarh, J. Aspnes, and R. Gelashvili, Space-Optimal Majority in Population Protocols, 1067436338.
DOI : 10.1137/1.9781611975031.144

R. [. Alistarh, M. Gelashvili, and . Vojnovi?, Fast and Exact Majority in Population Protocols, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.47-56, 2015.
DOI : 10.1109/FOCS.2012.86

C. [. Alon, M. Avin, G. Koucký, Z. Kozma, M. R. Lotker et al., Many Random Walks Are Faster Than One, Combinatorics, Probability & Computing, 2011.

]. D. Ang80, ]. D. Angluinaae08, J. Angluin, and D. Aspnes, Local and Global Properties in Networks of Processors (Extended Abstract) Eisenstat: A simple population protocol for fast robust approximate majority, Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing. STOC '80 Distributed Computing, pp.82-93, 1980.

J. [. Angluin, D. Aspnes, E. Eisenstat, and . Ruppert, The computational power of population protocols, Distributed Computing, pp.279-304, 2007.
DOI : 10.1007/s00446-007-0040-2

D. Angluin, M. J. Fischer, and H. Jiang, Stabilizing Consensus in Mobile Networks, Proc. of Distributed Computing in Sensor Systems (DCOSS), pp.37-50, 2006.
DOI : 10.1007/11776178_3

E. [. Aspnes and . Ruppert, An Introduction to Population Protocols, In Bulletin of the EATCS, vol.93, pp.98-117, 2007.
DOI : 10.1007/978-3-540-89707-1_5

Z. [. Avin, Y. Lotker, D. Nahum, and . Peleg, Core Size and Densification in Preferential Attachment Networks, Automata, Languages, and Programming -42nd International Colloquium, pp.492-503, 2015.
DOI : 10.1007/978-3-662-47666-6_39

M. [. Avin, Z. Koucký, and . Lotker, How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs), Automata, Languages and Programming, 35th International Colloquium Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp.121-132, 2008.
DOI : 10.1016/j.adhoc.2003.08.001

. Optdoi and . Org,

A. [. Azar, A. R. Broder, E. Karlin, N. T. Upfal, and . Bailey, Balanced Allocations On Queueing Processes with Bulk Service, In SIAM J. Comput. In Journal of the Royal Statistical Society. Series B, vol.29, issue.161, pp.180-200, 1954.

R. [. Barabási and . Albert, Emergence of scaling in random networks, science, pp.509-512, 1999.

Y. [. Barlow, P. Peres, and . Sousi, Collisions of random walks, Annales de l' Institut Henri Poincare, pp.2012-922
DOI : 10.1214/12-AIHP481

]. L. Bcn+15a, A. E. Becchetti, E. Clementi, F. Natale, G. Pasquale et al., Self- Stabilizing Repeated Balls-into-Bins, Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, pp.332-339, 2015.

]. L. Bcn+14a, A. E. Becchetti, E. Clementi, F. Natale, R. Pasquale et al., Simple dynamics for plurality consensus, 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp.2014-247

L. Becchetti, A. E. Clementi, E. Natale, F. Pasquale, and L. Trevisan, Stabilizing Consensus with Many Opinions, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016.
DOI : 10.1137/1.9781611974331.ch46

URL : https://hal.archives-ouvertes.fr/hal-02002615

]. L. Bcn+15b, A. Becchetti, E. Clementi, F. Natale, R. Pasquale et al., Plurality Consensus in the Gossip Model, Proceedings of the 26th Annual ACM- SIAM Symposium on Discrete Algorithms (SODA), pp.371-390, 2015.

]. L. Bcn+14b, A. Becchetti, E. Clementi, F. Natale, R. Pasquale et al., Simple Dynamics for Plurality Consensus, Proc. SPAA, pp.247-256, 2014.

F. Bénézit, P. Thiran, and M. Vetterli, Interval consensus: From quantized gossip to voting, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.3661-3664, 2009.
DOI : 10.1109/ICASSP.2009.4960420

P. [. Bénézit, M. Thiran, and . Vetterli, The Distributed Multiple Voting Problem, IEEE Journal of Selected Topics in Signal Processing, vol.5, issue.4, pp.791-804, 2011.
DOI : 10.1109/JSTSP.2011.2114326

[. Ben-shahar, S. Dolev, A. Dolgin, and M. Segal, Direction election in flocking swarms, Proc. of the 6th Int. Workshop on Foundations of Mobile Computing (DIALM-POMC, pp.73-80, 2010.

A. [. Berenbrink, R. Clementi, P. Elsässer, F. Kling, E. Mallmann-trenn et al., Ignore or Comply?, Proceedings of the ACM Symposium on Principles of Distributed Computing , PODC '17, pp.335-344, 2017.
DOI : 10.1109/SFCS.1983.48

URL : https://hal.archives-ouvertes.fr/hal-02002544

A. [. Berenbrink, M. Czumaj, T. Englert, L. Friedetzky, and . Nagel, Multiple-Choice Balanced Allocation in (Almost) Parallel, In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science, vol.7408, pp.411-422
DOI : 10.1007/978-3-642-32512-0_35

A. [. Berenbrink, T. Czumaj, N. D. Friedetzky, and . Vvedenskaya, Infinite parallel job allocation (extended abstract), Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures , SPAA '00
DOI : 10.1145/341800.341813

B. P. Berenbrink, A. Czumaj, A. Steger, and B. , Vöcking: Balanced Allocations: The Heavily Loaded Case, ACM In SIAM Journal on Computing, vol.35, issue.6, pp.99-108, 2000.

F. [. Berenbrink, F. Ergün, E. S. Mallmann-trenn, and . Azer, Palindrome Recognition In The Streaming Model, 31st International Symposium on Theoretical Aspects of Computer Science STACS, pp.149-161, 2014.

T. [. Berenbrink, G. Friedetzky, P. Giakkoupis, and . Kling, Efficient Plurality Consensus, or: The Benefits of cleaning up from time to time, Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP). to appear, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01353690

T. [. Berenbrink, L. A. Friedetzky, and . Goldberg, The Natural Work-Stealing Algorithm is Stable, SIAM Journal on Computing, vol.32, issue.5, pp.1260-1279, 2003.
DOI : 10.1137/S0097539701399551

]. P. Bfk+16a, T. Berenbrink, P. Friedetzky, F. Kling, L. Mallmann-trenn et al., Wastell: Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. PODC'16, pp.83-92, 2016.

]. P. Bfk+16b, T. Berenbrink, P. Friedetzky, F. Kling, C. Mallmann-trenn et al., Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing, 24th Annual European Symposium on Algorithms ESA'16 Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.1-10, 2016.

P. Berenbrink, T. Friedetzky, F. Mallmann-trenn, S. Meshkinfamfard, and C. , Wastell: Threshold Load Balancing with Weighted Tasks, 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS'15, pp.550-558, 2015.

G. [. Berenbrink, A. Giakkoupis, F. Kermarrec, and . Mallmann-trenn, Bounds on the Voter Model in Dynamic Networks, 43rd International Colloquium on Automata, Languages, and Programming, ICALP'16, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01353695

K. [. Berenbrink, T. Khodamoradi, A. Sauerwald, and . Stauffer, Balls-intobins with Nearly Optimal Load Distribution, Proceedings of the Twentyfifth Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA. ACM, 2013, pp.326-335

P. Berenbrink, R. Klasing, A. Kosowski, F. Mallmann-trenn, P. Uznanskibkm14-]-p et al., Improved Analysis of Deterministic Load-Balancing Schemes Estimating the number of connected components in sublinear time, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC'15. [BDJ98] M. Berg, F. van der Duyn Schouten, and J. Jansen: Optimal Batch Provisioning to Customers Subject to a Delay-Limit. In Management Science, pp.301-310, 1998.

. A. Bcr06, T. Blum, M. Chan, S. P. Rwebangira, A. Boyd et al., A Random-Surfer Web-Graph Model Randomized gossip algorithms, Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics IEEE Transactions on Information Theory, pp.238-246, 2006.

S. [. Brahma, S. P. Macharla, S. K. Pal, and . Singh, Fair Leader Election by Randomized Voting, Proc. ICDCIT '04, pp.22-31, 2004.
DOI : 10.1007/978-3-540-30555-2_4

L. Cardelli and A. Csikász-nagy, The Cell Cycle Switch Computes Approximate Majority, Scientific reports, 2012.
DOI : 10.1098/rsob.120023

P. [. Chaintreau, E. Fraigniaud, and . Lebhar, Networks Become Navigable as Nodes Move and Forget, Automata, Languages and Programming, 35th International Colloquium, ICALP, pp.133-144, 2008.
DOI : 10.1038/30918

URL : https://hal.archives-ouvertes.fr/inria-00257962

P. [. Chebolu and . Melsted, PageRank and the Random Surfer Model, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. Society for Industrial and Applied Mathematics Soloveichik, and G. Seelig: Programmable chemical controllers made from DNA. In Nature nanotechnology, pp.1010-1018, 2008.

L. [. Chung, . E. Lucig+15-]-a, M. D. Clementi, G. Ianni, E. Gambosi et al., The Average Distance in a Random Graph with Given Expected Degrees, Theor. Comput. Sci, pp.91-113, 2003.
DOI : 10.1080/15427951.2004.10129081

V. [. Cohen-addad and F. Kanade, Mallmann-Trenn: Hierarchical Clustering Beyond the Worst-Case, 2017.

V. Cohen-addad, V. Kanade, F. Mallmann-trenn, and C. Mathieu, Hierarchical Clustering: Objective Functions and Algorithms, CoRR
DOI : 10.1137/1.9781611975031.26

B. [. Cole, F. Maggs, M. Meyer-auf-der-heide, A. W. Mitzenmacher, K. Richa et al., Randomized Protocols for Low-congestion Circuit Routing in Multistage Interconnection Networks Frieze: A general model of web graphs, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing . STOC '98CEOR13] C. Cooper, R. Elsässer, H. Ono, and T. Radzik: Coalescing Random Walks and Voting on Connected Graphs. In SIAM Journal on Discrete Mathematics, pp.378-388, 1998.

R. [. Cooper, T. Elsässer, and . Radzik, The Power of Two Choices in Distributed Voting, Proc. ICALP, pp.435-446, 2014.
DOI : 10.1007/978-3-662-43951-7_37

R. [. Cooper, T. Elsässer, N. Radzik, T. Rivera, and . Shiraga, Fast Consensus for Voting on General Expander Graphs, DISC, 2015, pp.248-262
DOI : 10.1007/978-3-662-48653-5_17

URL : https://hal.archives-ouvertes.fr/hal-01206462

A. [. Cooper, The Cover Time of Random Regular Graphs, SIAM Journal on Discrete Mathematics, vol.18, issue.4, pp.728-740, 2005.
DOI : 10.1137/S0895480103428478

C. Cooper, T. Radzik, N. Rivera, and T. Shiraga, Fast plurality consensus in regular expanders, 2016.

C. , C. Cooper, and N. Rivera, The Linear Voting Model, ICALP, pp.1-14412, 2016.

]. J. Cox89 and . Cox, Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$, The Annals of Probability, pp.1333-1366, 1989.
DOI : 10.1214/aop/1176991158

A. [. Cruise and . Ganesh, Probabilistic consensus via polling and majority rules, Queueing Systems, pp.2014-99
DOI : 10.1109/INFCOM.2013.6566843

V. [. Czumaj and . Stemann, Randomized allocation processes, Foundations of Computer Science Proceedings., 38th Annual Symposium on, pp.194-203, 1997.

]. A. Czu98 and . Czumaj, Recovery Time of Dynamic Allocation ProcessesCS10] A. Czumaj and C. Sohler: Testing Expansion in Bounded-Degree Graphs, Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA. ACM Combinatorics, Probability & Computing, pp.202-2115, 1998.

D. [. Demers, C. Greene, W. Hauser, J. Irish, S. Larson et al., Epidemic algorithms for replicated database maintenance, Proc. of the 6th Ann. ACM Symposium on Principles of Distributed Computing (PODC). ACM, pp.1-12, 1987.

]. L. Dev87, B. Devroye, L. A. Doerr, and . Goldberg, Branching processes in the analysis of the heights of trees. English Adaptive Drift Analysis, Acta Informatica Algorithmica, pp.277-298, 1987.

B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, Stabilizing consensus with the power of two choices, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pp.149-158, 2011.
DOI : 10.1145/1989493.1989516

]. F. Dow55 and . Downton, Waiting Time in Bulk Service Queues, In Journal of the Royal Statistical Society. Series B (Methodological), vol.17, issue.2, pp.256-261, 1955.

L. [. Draief and . Massoulié, Epidemics and Rumours in Complex Networks, 1st, 2010.

M. [. Draief and . Vojnovic, Convergence Speed of Binary Interval Consensus, In SIAM J. Control and Optimization, vol.50, issue.3, pp.2012-1087

D. [. Dubhashi and . Ranjan, Balls and bins: A study in negative dependence, Random Structures and Algorithms, vol.13, issue.2, pp.99-124, 1998.
DOI : 10.1002/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M

D. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms, 1st, 2009.

O. [. Efremenko and . Reingold, How Well Do Random Walks Parallelize?, pp.476-489, 2009.
DOI : 10.1007/978-3-642-03685-9_36

T. [. Elsässer, D. Friedetzky, F. Kaaser, H. Mallmann-trenn, and . Trinker, Efficient k-Party Voting with Two Choices

T. [. Elsässer and . Sauerwald, Tight bounds for the cover time of multiple random walks, Theor. Comput. Sci, pp.2623-2641, 2011.

D. [. Eschenfeldt and . Gamarnik, Supermarket Queueing System in the Heavy Traffic Regime. Short Queue Dynamics In ArXiv e-prints, 2016. arXiv: 1610. 03522 [math.PR]: Modelling disease outbreaks in realistic urban social networks, Nature, pp.180-184, 2004.

F. G. Fayolle, V. Malyshev, M. Menshikovfhk15-]-o, B. Feinerman, A. Haeupler et al., Topics in the Constructive Theory of Countable Markov Chains url: https://books.google.ca/books?id=lTJltFEnnHcC Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, Distributed Computing, 1995.

]. W. Fel68 and . Feller, An Introduction to Probability Theory and Its Applications url: http://www.amazon.ca/exec/obidos/redirect?tag= citeulike04-20%7B%5C&%7Dpath=ASIN/0471257087. [FN16] P. Fraigniaud and E. Natale: Noisy Rumor Spreading and Plurality Consensus, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. PODC '16, pp.127-136, 1968.

N. R. Franks, S. C. Pratt, E. B. Mallon, N. F. Britton, and D. J. Sumpter, Information flow, opinion polling and collective intelligence in house-hunting social insects, Philosophical Transactions of the Royal Society of London B: Biological Sciences, pp.1567-1583, 1427.
DOI : 10.1098/rstb.2002.1066

G. [. Gasieniec and . Stachowiak, Fast Space Optimal Leader Election in Population Protocols, ArXiv e-prints, 2017.
DOI : 10.1137/1.9781611975031.169

J. [. Ghaffari and . Lengler, Tight Analysis for the 3-Majority Consensus Dynamics Parter: A polylogarithmic gossip algorithm for plurality consensus, CoRR, volume abs/1705.05583 Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp.117-126, 2016.

B. Ghosh and S. Muthukrishnan, Dynamic Load Balancing by Random Matchings, Journal of Computer and System Sciences, vol.53, issue.3, pp.357-370, 1996.
DOI : 10.1006/jcss.1996.0075

URL : https://doi.org/10.1006/jcss.1996.0075

]. G. Gon81 and . Gonnet, Expected Length of the Longest Probe Sequence in Hash Code Searching, Information Processing Letters, pp.289-304, 1981.

, Hajek: Hitting-Time and Occupation-Time Bounds Implied by Drift Analysis with Applications, Advances in Applied Probability, pp.502-525, 1982.

, Hassin and D. Peleg: Distributed Probabilistic Polling and Applications to Proportionate Agreement, Information and Computation, pp.248-268, 2001.

]. M. Jac05 and . Jackson, The economics of social networks, 2005.

]. M. Jac+08 and . Jackson, Social and economic networks, 2008.

]. J. Joh13, N. L. Johnson, S. Johnson, and . Kotz, Targeted advertising and advertising avoidance Urn Models and Their Application: An Approach to Modern Discrete Probability Theory, The, pp.128-144, 1977.

F. [. Kaaser, E. Mallmann-trenn, and . Natale, On the Voting Time of the Deterministic Majority Process: Efficient solution of multiple server queues with application to the modeling of ATM concentrators, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS'16 INFOCOM. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE, pp.1-55, 1996.

R. [. Kanade, Z. Levi, F. Lotker, C. Mallmann-trenn, and . Mathieu, Distance in the Forest Fire Model How far are you from Eve? Sauerwald: On coalescence time in graphs-When is coalescing as fast as meeting?, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1602-1620, 2016.

F. [. Kanade, V. Mallmann-trenn, and . Verdugo, How large is your graph? In CoRR, 2017.

C. [. Karp, S. Schindelhauer, and B. Shenker, Vocking: Randomized rumor spreading, Proc. of the 41th Ann. IEEE Symp. on Foundations of Computer Science (FOCS). IEEE, pp.565-574, 2000.

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.482-491, 2003.
DOI : 10.1109/SFCS.2003.1238221

M. [. Kim, B. K. Chaudhry, K. Yoon, and . Kim, A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue, Applied Mathematics, vol.03, issue.12, p.2012
DOI : 10.4236/am.2012.312A297

]. J. Kle01 and . Kleinberg, Small-World Phenomena and the Dynamics of Information, Advances in Neural Information Processing Systems 14, NIPS, pp.431-438, 2001.

J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, The Web as a Graph: Measurements, Models, and Methods, English. In Computing and Combinatorics Lecture Notes in Computer Science, vol.1627, pp.1-17, 1999.
DOI : 10.1007/3-540-48686-0_1

L. [. Klenke and . Mattner, Stochastic ordering of classical discrete distributions, Adv. in Appl. Probab. volume, pp.392-410, 2010.

A. [. Kling, Cord-Landwehr, and F. Mallmann-Trenn: Slow Down and Sleep for Profit in Online Deadline Scheduling In Design and Analysis of Algorithms -First Mediterranean Conference on Algorithms, pp.234-247978, 2012.

S. [. Krapivsky, F. Redner, T. Kuhn, S. Locher, and . Schmid, Organization of growing random networks, Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.66123-66138, 2001.
DOI : 10.1016/S1389-1286(00)00083-9

P. [. Kumar, S. Raghavan, D. Rajagopalan, A. Sivakumar, E. Tomkins et al., Stochastic models for the Web graph, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.57-65, 2000.
DOI : 10.1109/SFCS.2000.892065

D. [. Lattanzi and . Sivakumar, Affiliation networks, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.427-434, 2009.
DOI : 10.1145/1536414.1536474

C. [. Lehre and . Witt, Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift, Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), pp.686-697, 2014.
DOI : 10.1007/978-3-319-13075-0_54

A. [. Lengler and . Steger, Drift Analysis and Evolutionary Algorithms Revisited, ArXiv e-prints, 2016.
DOI : 10.1007/s00453-012-9622-x

D. [. Leskovec, J. Chakrabarti, and C. Kleinberg, Faloutsos: Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication, Knowledge Discovery in Databases: PKDD 2005, pp.133-145, 2005.

J. [. Leskovec, C. Kleinberg, and . Faloutsos, Graph evolution, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, p.2, 2007.
DOI : 10.1145/1217299.1217301

D. Levin, Y. Peres, and E. Wilmer, Markov chains and mixing times, 2006.

. [. , Levin and Y. Perres: Markov Chains and Mixing Times, 2008.

]. P. Lez89 and . Lezaud, Chernoff-type bound for finite Markov chains, In Ann. Appl. Probab, vol.8, issue.3, pp.849-867, 1989.

]. N. Lyn89 and . Lynch, A Hundred Impossibility Proofs for Distributed Computing, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing. PODC '89. [LP15] R. Lyons and Y. Peres: Probability on Trees and Networks. Available at http, pp.1-28, 1989.

, Mallmann-Trenn, C. Mathieu, and V. Verdugo: Skyline Computation with Noisy Comparisons, 2015.

D. [. Marcus, N. Spielman, and . Srivastava, Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.1358-1377
DOI : 10.1109/FOCS.2015.87

I. [. Marshall, B. C. Olkin, . [. Arnold, N. Mehrabian, G. B. Wormald et al., Inequalities: Theory of Majorization and Its Applications Springer Series in Statistics It's a Small World for Random Surfers In Approximation, Randomization, and Combinatorial Optimization Spirakis: Determining Majority in Networks with Local Interactions and Very Small Local Memory, Automata, Languages, and Programming -41st International Colloquium, pp.857-871, 2011.

E. [. Mitzenmacher and . Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis Mitzenmacher: The Power of Two Choices in Randomized Load Balancing, MRS00] M. Mitzenmacher, A. W. Richa, and R. Sitaraman: The Power of Two Random Choices: A Survey of Techniques and Results. In in Handbook of Randomized Computing, pp.1094-1104, 2000.
DOI : 10.1017/CBO9780511813603

D. [. Mosk-aoyama and . Shah, Fast Distributed Algorithms for Computing Separable Functions, IEEE Transactions on Information Theory, vol.54, issue.7, pp.2997-3007, 2008.
DOI : 10.1109/TIT.2008.924648

J. [. Mossel and O. Neeman, Tamuz: Majority dynamics and aggregation of information in social networks, Autonomous Agents and Multi-Agent Systems, pp.2014-408

G. [. Mossel and . Schoenebeck, Reaching Consensus on Social Networks, Innovations in Computer Science -(ICS), pp.214-229, 2010.

R. I. Oliveira, On the coalescence time of reversible random walks, Transactions of the American Mathematical Society, vol.364, issue.4, pp.2012-2109
DOI : 10.1090/S0002-9947-2011-05523-6

]. R. Oli13 and . Oliveira, Mean field conditions for coalescing random walks, pp.3420-3461, 2013.

P. [. Pandurangan, E. Raghavan, R. Upfal, L. Shostak, and . Lamport, Using PageRank to Characterize Web Structure, Journal of the ACM, pp.1-20, 1980.
DOI : 10.1080/15427951.2006.10129114

]. D. Pel02, Peleg: Local majorities, coalitions and monopolies in graphs: a review, Theor. Comput. Sci, pp.231-257, 2002.

J. [. Pemantle and . Rosenthal, Moment conditions for a sequence with negative drift to be uniformly bounded in Lr url: http://www. sciencedirect.com/science Y. Peres and P. Sousi: Mixing Times are Hitting Times of Large Sets, Stochastic Processes and their Applications Journal of Theoretical Probability, pp.143-155, 1999.

K. [. Peres, U. Talwar, and . Wieder, The (1 + ??)-Choice Process and Weighted Balls-into-Bins, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SODA. Society for Industrial and Applied Mathematics, pp.1613-1619, 2010.
DOI : 10.1137/1.9781611973075.131

D. [. Perron, M. Vasudevan, and . Vojnovi?, Using Three States for Binary Consensus on Complete Graphs, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2527-2535, 2009.
DOI : 10.1109/INFCOM.2009.5062181

]. T. Pik13 and . Piketty, , 2013.

T. [. Pinar, S. Kolda, M. Comandur, A. Raab, and . Steger, The Block Two-level Erdos Renyi (BTER) Graph Model url: http : / / www . osti . gov / scitech / servlets/purl/1106519Balls into Bins" -A Simple and Tight Analysis, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM Proceedings. Lecture Notes in Computer Science, pp.159-170, 1998.

]. M. Rab83, Rabin: Randomized byzantine generals, Proc. of the 24th Ann. Symp. on Foundations of Computer Science (SFCS, pp.403-409, 1983.

T. [. Rinott and . Santner, An Inequality for Multivariate Normal Probabilities with Application to a Design Problem, The Annals of Statistics, pp.1228-1234, 1977.
DOI : 10.1214/aos/1176344007

H. [. Sauerwald and . Sun, Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
DOI : 10.1109/FOCS.2012.86

C. Seshadhri, A. Pinar, and T. Kolda, The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models, Proceedings of the Twelfth SIAM International Conference on Data Mining, pp.1071-1082, 2012.

S. , K. Sohraby, and J. Zhang, Spectral decomposition approach for transient analysis of multi-server discrete-time queues, INFOCOM. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, pp.395-404, 1992.

, Stemann: Parallel Balanced Allocations, Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA

S. , M. R. Subramani, and B. Rajagopalan, Knowledge-sharing and influence in online social networks via viral marketing, ACM In Communications of the ACM, vol.46, issue.12, pp.261-269, 1996.

U. [. Talwar and . Wieder, Balanced allocations, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.979-990978
DOI : 10.1145/1250790.1250829

S. [. Travers and . Milgram, The small world problem, In Phychology Today, vol.1, pp.61-67, 1967.

]. A. Vaz01 and . Vazquez, Disordered networks generated by recursive searches, EPL (Europhysics Letters), p.430, 2001.