, Arrival rate 0

]. E. Abbe, G. Bandeira, and . Hall, Exact Recovery in the Stochastic Block Model, Number of tasks in the system Random Greedy Backpressure Bibliography, pp.471-487, 2016.
DOI : 10.1109/TIT.2015.2490670

E. Abbe and C. Sandon, Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic bp, and the informationcomputation gap, 2016.

L. Adamic and N. Glance, The political blogosphere and the 2004 U.S. election, Proceedings of the 3rd international workshop on Link discovery , LinkKDD '05, pp.36-43, 2005.
DOI : 10.1145/1134271.1134277

W. Aiello, F. Chung, and L. Lu, A Random Graph Model for Power Law Graphs, Experimental Mathematics, vol.2, issue.1, pp.53-66, 2001.
DOI : 10.1017/CBO9780511721335.010

M. Alresaini, M. Sathiamoorthy, B. Krishnamachari, and M. J. Neely, Backpressure with Adaptive Redundancy (BWAR), 2012 Proceedings IEEE INFOCOM, pp.2300-2308, 2012.
DOI : 10.1109/INFCOM.2012.6195617

A. Anandkumar, D. Foster, D. Hsu, S. Kakade, and Y. Liu, A Spectral Algorithm for Latent Dirichlet Allocation, Advances in Neural Information Processing Systems, 2012.
DOI : 10.1016/j.jcss.2003.11.008

A. Anandkumar, R. Ge, D. Hsu, S. Kakade, and M. Telgarsky, Tensor decompositions for learning latent variable models, Journal of Machine Learning Research, vol.15, issue.1, pp.2773-2832, 2014.
DOI : 10.21236/ADA604494

S. Asmussen, Applied probability and queues, 2003.

B. Ball, B. Karrer, and M. Newman, Efficient and principled method for detecting communities in networks, Physical Review E, vol.3, issue.3, p.36103, 2011.
DOI : 10.1145/1232722.1232727

Y. Bengio, R. Ducharme, P. Vincent, and C. Janvin, Neural Probabilistic Language Models, Journal of Machine Learning Research, vol.3, pp.1137-1155, 2003.
DOI : 10.1007/3-540-33486-6_6
URL : https://hal.archives-ouvertes.fr/hal-01434258

S. Bernstein, The Theory of Probabilities, 1946.

K. Bimpikis, G. Mihalis, and . Markakis, Learning and Hierarchies in Service Systems, Management Science, 2015.
DOI : 10.1287/mnsc.2017.2976

D. Blei, M. Ng, and . Jordan, Latent dirichlet allocation, Journal of Machine Learning Research, vol.3, pp.903-1022, 2003.

V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

B. Bollobás, S. Janson, and O. Riordan, The phase transition in inhomogeneous random graphs. Random Struct, Algorithms, vol.31, issue.1, pp.3-122, 2007.

I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo, Handbook of Combinatorial Optimization, 1999.

C. Bordenave, M. Lelarge, and L. Massoulié, Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015.
DOI : 10.1109/FOCS.2015.86
URL : https://hal.archives-ouvertes.fr/hal-01226796

P. Brémaud, Markov chains: Gibbs fields, Monte Carlo simulation, and queues, 2013.
DOI : 10.1007/978-1-4757-3124-8

L. X. Bui, R. Srikant, and A. Stolyar, A Novel Architecture for Reduction of Delay and Queueing Structure Complexity in the Back-Pressure Algorithm, IEEE/ACM Transactions on Networking, vol.19, issue.6, pp.1597-1609, 2011.
DOI : 10.1109/TNET.2011.2126593

T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior, Combinatorica, vol.36, issue.2, pp.171-191, 1987.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

K. Chaudhuri, F. Chung, and A. Tsiatas, Spectral clustering of graphs with general degrees in the extended planted partition model, pp.35-36, 2012.

Y. Chen and A. Krause, Near-optimal batch mode active learning and adaptive submodular optimization, ICML'13, pp.160-168, 2013.

F. Chung, L. Lu, and V. Vu, The Spectra of Random Graphs with Given Expected Degrees, Internet Mathematics, vol.1, issue.3, pp.257-275, 2003.
DOI : 10.1080/15427951.2004.10129089
URL : http://www.internetmathematicsjournal.com/article/1386.pdf

F. Chung and M. Radcliffe, On the spectra of general random graphs, Electr. J. Comb, vol.18, issue.1, 2011.

F. Chung, L. Lu, and V. Vu, The Spectra of Random Graphs with Given Expected Degrees, Internet Mathematics, vol.1, issue.3, pp.257-275, 2003.
DOI : 10.1080/15427951.2004.10129089

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.23, issue.6, 2004.
DOI : 10.1140/epjb/e2004-00125-x
URL : http://arxiv.org/abs/cond-mat/0408187

A. Coja-oghlan and A. Lanka, Finding Planted Partitions in Random Graphs with General Degree Distributions, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.1682-1714, 2009.
DOI : 10.1137/070699354
URL : http://wrap.warwick.ac.uk/43264/1/WRAP_Coja-Oghlan_fppac.pdf

A. Coja-oghlan and A. Lanka, Partitioning Random Graphs with General Degree Distributions, SIAM Journal on Discrete Mathematics, vol.273, pp.127-141, 2008.
DOI : 10.1007/978-0-387-09680-3_9
URL : https://link.springer.com/content/pdf/10.1007%2F978-0-387-09680-3_9.pdf

Y. Cui, E. M. Yeh, and R. Liu, Enhancing the delay performance of dynamic backpressure algorithms, IEEE/ACM Transactions on Networking, 2015.

J. G. Dai, On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models, The Annals of Applied Probability, vol.5, issue.1, pp.49-77, 1995.
DOI : 10.1214/aoap/1177004828

M. Daltayanni, P. De-alfaro, and . Papadimitriou, WorkerRank, Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, WSDM '15, 2015.
DOI : 10.1093/bioinformatics/btm158

A. Dasgupta, J. E. Hopcroft, and F. Mcsherry, Spectral Analysis of Random Graphs with Skewed Degree Distributions, 45th Annual IEEE Symposium on Foundations of Computer Science, pp.602-610, 2004.
DOI : 10.1109/FOCS.2004.61

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.33, issue.6, pp.66106-153, 2011.
DOI : 10.1103/PhysRevE.78.046110
URL : https://hal.archives-ouvertes.fr/hal-00661643

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Inference and Phase Transitions in the Detection of Modules in Sparse Networks, Physical Review Letters, vol.33, issue.6, p.65701, 2011.
DOI : 10.1007/s10955-006-9162-3

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.33, issue.6, p.66106, 2011.
DOI : 10.1103/PhysRevE.78.046110
URL : https://hal.archives-ouvertes.fr/hal-00661643

L. Devroye, L. Györfi, and G. L. Lugosi, A Probabilistic Theory of Pattern Recognition, Applications of Mathematics, vol.31, 1997.
DOI : 10.1007/978-1-4612-0711-5

W. E. Donath and A. J. Hoffman, Lower Bounds for the Partitioning of Graphs, IBM Journal of Research and Development, vol.17, issue.5, pp.420-425, 1973.
DOI : 10.1147/rd.175.0420

M. E. Dyer and A. M. Frieze, The solution of some random NP-hard problems in polynomial expected time, Journal of Algorithms, vol.10, issue.4, pp.451-489, 1989.
DOI : 10.1016/0196-6774(89)90001-1

P. Erd?-os and A. Rényi, On random graphs. I. Publ, Math. Debrecen, vol.6, pp.290-297, 1959.

W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, Broadcasting on trees and the Ising model, The Annals of Applied Probability, vol.10, issue.2, pp.410-433, 2000.
DOI : 10.1214/aoap/1019487349

U. Feige and E. Ofek, Random Struct, Algorithms, vol.27, issue.2, pp.251-275, 2005.

M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, vol.23, issue.2, pp.298-305, 1973.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002

K. Fujii and H. Kashima, Budgeted stream-based active learning via adaptive submodular maximization, NIPS'16, pp.514-522, 2016.

Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica, vol.67, issue.3, pp.233-241, 1981.
DOI : 10.1007/BF02579329

C. Gao, Y. Lu, and D. Zhou, Exact exponent in optimal rates for crowdsourcing, ICML'16, pp.603-611, 2016.

L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocation and Cross-Layer Control in Wireless Networks, Foundations and Trends?? in Networking, vol.1, issue.1, pp.1-144, 2006.
DOI : 10.1561/1300000001

D. Golovin, A. Krause, and D. Ray, Near-optimal bayesian active learning with noisy observations, NIPS'10, pp.766-774, 2010.

L. Gulikers, M. Lelarge, and L. Massoulié, An impossibility result for reconstruction in a degree-corrected planted-partition model, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01258194

L. Gulikers, M. Lelarge, and L. Massoulié, Non-backtracking spectrum of degree-corrected stochastic blockmodels, ITCS, vol.2017, 2017.

L. Gulikers, M. Lelarge, and L. Massoulié, Abstract, Advances in Applied Probability, vol.49, issue.03, 2017.
DOI : 10.1214/14-AOS1274

M. B. Hastings, Community detection as an inference problem, Physical Review E, vol.33, issue.3, 2006.
DOI : 10.1080/00018739400101505
URL : http://arxiv.org/pdf/cond-mat/0604429

S. Hata and H. Nakao, Localization of Laplacian eigenvectors on random networks, Scientific Reports, vol.89, issue.8, 0154.
DOI : 10.1103/PhysRevE.89.020801

C. Ho and J. W. Vaughan, Online task assignment in crowdsourcing markets, AAAI'12, pp.45-51, 2012.

P. Hoff, A. Raftery, and M. Handcock, Latent Space Approaches to Social Network Analysis, Journal of the American Statistical Association, vol.97, issue.460, pp.1090-1098, 2001.
DOI : 10.1198/016214502388618906
URL : http://www.dtic.mil/dtic/tr/fulltext/u2/a458734.pdf

P. Holland, K. Laskey, and S. Leinhardt, Stochastic blockmodels: First steps, Social Networks, vol.5, issue.2, pp.109-137, 1983.
DOI : 10.1016/0378-8733(83)90021-7

R. Horn and C. Johnson, Matrix Analysis, 1985.

M. Horton, H. Stark, and T. Terras, What are zeta functions of graphs and what are they good for? Contemporary Mathematics, Quantum Graphs and Their Applications, pp.173-190, 2006.

K. I. Hashimoto, Zeta Functions of Finite Graphs and Representations of p-Adic Groups, Automorphic Forms and Geometry of Arithmetic Varieties, pp.211-280, 1989.
DOI : 10.1016/B978-0-12-330580-0.50015-X

Y. Iba, The Nishimori line and Bayesian statistics, Journal of Physics A: Mathematical and General, vol.32, issue.21, p.3875, 1999.
DOI : 10.1088/0305-4470/32/21/302
URL : http://arxiv.org/pdf/cond-mat/9809190v1.pdf

S. Javdani, Y. Chen, A. Karbasi, A. Krause, D. Bagnell et al., Near optimal bayesian active learning for decision making, AISTATS'14, pp.430-438, 2014.

M. Jerrum and G. B. Sorkin, The Metropolis algorithm for graph bisection, Discrete Applied Mathematics, vol.82, issue.1-3, pp.155-175, 1998.
DOI : 10.1016/S0166-218X(97)00133-9
URL : https://doi.org/10.1016/s0166-218x(97)00133-9

B. Ji, C. Joo, and N. B. Shroff, Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks, IEEE/ACM Transactions on Networking, vol.21, issue.5, pp.1539-1552, 2013.
DOI : 10.1109/TNET.2012.2227790
URL : http://arxiv.org/pdf/1011.5674.pdf

J. Jin, Fast community detection by SCORE, The Annals of Statistics, vol.43, issue.1, pp.57-89
DOI : 10.1214/14-AOS1265SUPP
URL : http://arxiv.org/pdf/1211.5803

R. Johari, V. Kamble, and Y. Kanoria, Know your customer: Multi-armed bandits with capacity constraints. abs/1603, p.4549, 2016.

R. Johnson and T. Zhang, Effective Use of Word Order for Text Categorization with Convolutional Neural Networks, Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp.103-112, 2015.
DOI : 10.3115/v1/N15-1011

R. David, S. Karger, D. Oh, and . Shah, Budget-optimal task allocation for reliable crowdsourcing systems, Operations Research, vol.62, issue.1, pp.1-24, 2014.

B. Karrer and M. Newman, Stochastic blockmodels and community structure in networks, Physical Review E, vol.33, issue.1, p.16107, 2011.
DOI : 10.1088/1742-5468/2006/11/P11010

H. Kesten and B. P. Stigum, Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes, The Annals of Mathematical Statistics, vol.37, issue.6, pp.1463-1481
DOI : 10.1214/aoms/1177699139
URL : https://doi.org/10.1214/aoms/1177699139

H. Kesten and B. P. Stigum, A Limit Theorem for Multidimensional Galton-Watson Processes, The Annals of Mathematical Statistics, vol.37, issue.5, pp.1211-1223
DOI : 10.1214/aoms/1177699266

F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly et al., Spectral redemption in clustering sparse networks, Proceedings of the National Academy of Sciences, pp.20935-20940, 2013.
DOI : 10.1103/PhysRevE.84.036103
URL : https://hal.archives-ouvertes.fr/cea-01223434

A. Kumar, Discrete event stochastic processes: Lecture notes for an engineering curriculum, 2014.

R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the web for emerging cyber-communities. Computer Networks, 1999.

C. Le and R. Vershynin, Concentration and regularization of random graphs. arXiv preprint, 2015.

J. Lei and A. Rinaldo, Consistency of spectral clustering in stochastic block models. arXiv preprint arXiv:1312, 2013.

G. Linden, B. Smith, and J. York, Amazon.com recommendations: item-to-item collaborative filtering, IEEE Internet Computing, vol.7, issue.1, pp.76-80, 2003.
DOI : 10.1109/MIC.2003.1167344

S. Lloyd, Least squares quantization in PCM, IEEE Transactions on Information Theory, vol.28, issue.2, 1982.
DOI : 10.1109/TIT.1982.1056489

A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, vol.4, issue.3, pp.261-277, 1988.
DOI : 10.1007/978-3-642-61856-7

F. Luccio and M. Sami, Ieee transactions on circuit theory, Experiment. Math, vol.16, 1969.

D. Lusseau, K. Schneider, O. Boisseau, P. Haase, E. Slooten et al., The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology, vol.54, issue.4, pp.396-405, 2003.
DOI : 10.1007/s00265-003-0651-y

R. Lyons, Random Walks and Percolation on Trees, The Annals of Probability, vol.18, issue.3, pp.931-958, 1990.
DOI : 10.1214/aop/1176990730
URL : https://doi.org/10.1214/aop/1176990730

. Siva-theja-maguluri, R. Sai-kiran-burle, and . Srikant, Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch, ACM SIGMETRICS Performance Evaluation Review, vol.44, issue.1, pp.13-24, 2016.
DOI : 10.1109/9.182479

L. Massoulié, Structural properties of proportional fairness: Stability and insensitivity, The Annals of Applied Probability, vol.17, issue.3, pp.809-839, 2007.
DOI : 10.1214/105051606000000907

L. Massoulié, Community detection thresholds and the weak Ramanujan property, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.694-703, 2014.
DOI : 10.1017/S0963548309990514

F. Mcsherry, Spectral partitioning of random graphs, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.529-537, 2001.
DOI : 10.1109/SFCS.2001.959929

A. Mehta and D. Panigrahi, Online Matching with Stochastic Rewards, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.728-737, 2012.
DOI : 10.1109/FOCS.2012.65
URL : http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/pubs/archive/40363.pdf

A. Mehta, B. Waggoner, and M. Zadimoghaddam, Online Stochastic Matching with Unequal Probabilities, pp.1388-1404

M. Mihail and C. Papadimitriou, On the Eigenvalue Power Law, Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, RANDOM '02, pp.254-262, 2002.
DOI : 10.1007/3-540-45726-7_20

C. Moore, The computer science and physics of community detection: Landscapes , phase transitions, and hardness. arXiv preprint, 2017.

E. Mossel, J. Neeman, and A. Sly, Reconstruction and estimation in the planted partition model. Probability Theory and Related Fields, pp.3-4431, 2014.

E. Mossel, J. Neeman, and A. Sly, Consistency thresholds for the planted bisection model, Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, STOC '15, pp.69-75, 2015.

E. Mossel, J. Neeman, and A. Sly, A proof of the block model threshold conjecture, Combinatorica, vol.22, 2017.
DOI : 10.1214/11-AAP789

E. Mossel and Y. Peres, Information flow on trees. The Annals of Applied Probability, pp.817-844, 2003.

R. Murty, Ramanujan graphs, J. Ramanujan Math. Soc, vol.18, issue.1, pp.1-20, 2003.

M. Mzard, G. Parisi, and M. Virasoro, SK Model: The Replica Solution without Replicas, Europhysics Letters (EPL), vol.1, issue.2, p.77, 1986.
DOI : 10.1209/0295-5075/1/2/006

R. Nadakuditi and M. Newman, Graph Spectra and the Detectability of Community Structure in Networks, Physical Review Letters, vol.108, issue.18, p.188701, 2012.
DOI : 10.1103/PhysRevE.78.046110

M. J. Neely, E. Modiano, and C. E. Rohrs, Dynamic power allocation and routing for time varying wireless networks, Proc. IEEE INFOCOM, 2003.

L. George, . Nemhauser, A. Laurence, and . Wolsey, Integer and combinatorial optimization, 1988.

M. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.65, issue.2, p.26113, 2004.
DOI : 10.1103/PhysRevE.68.065103

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.33, issue.6, 2004.
DOI : 10.1098/rsbl.2003.0057

M. E. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences, 2006.
DOI : 10.1073/pnas.021544898

A. Podosinnikova, F. Bach, and S. Lacoste-julien, Rethinking lda: Moment matching for discrete ica, Advances in Neural Information Processing Systems 28, pp.514-522, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01225271

M. Porter, Readings in information retrieval, pp.313-316, 1997.

T. Qin and K. Rohe, Regularized spectral clustering under the degree-corrected stochastic blockmodel, Advances in Neural Information Processing Systems, pp.3120-3128, 2013.

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks, Proceedings of the National Academy of Sciences, p.2658, 2004.
DOI : 10.1080/0022250X.2001.9990249

P. Robert, Stochastic networks and queues, stochastic modelling and applied probability series, 2003.

K. Rohe, S. Chatterjee, and B. Yu, Spectral clustering and the highdimensional stochastic blockmodel. The Annals of Statistics, pp.1878-1915, 2011.

A. Nikolaevich, R. Alexander, and L. Stolyar, Ergodicity of stochastic processes describing the operation of open queueing networks, Problemy Peredachi Informatsii, vol.28, issue.3, pp.3-26, 1992.

B. Nihar, D. Shah, Y. Zhou, and . Peres, Approval voting and incentives in crowdsourcing, ICML'15, pp.10-19, 2015.

V. Shah, L. Gulikers, L. Massoulié, and M. Vojnovi´cvojnovi´c, Adaptive matching for expert systems with uncertain task types, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017.
DOI : 10.1109/ALLERTON.2017.8262814
URL : https://hal.archives-ouvertes.fr/hal-01622739

V. Shah, G. De-veciana, and G. Kesidis, A Stable Approach for Routing Queries in Unstructured P2P Networks, IEEE/ACM Transactions on Networking, vol.24, issue.5, pp.3136-3147, 2016.
DOI : 10.1109/TNET.2015.2509967

L. Tassiulas and A. Ephremides, Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE Transactions on Automatic Control, vol.37, issue.12, pp.1936-1948, 1992.
DOI : 10.1109/9.182479

D. Tomozei and L. Massoulié, Stochastic Systems, pp.1-43, 2014.

R. L. Tweedie, Criteria for classifying general Markov chains, Advances in Applied Probability, vol.53, issue.04, pp.737-771, 1976.
DOI : 10.1016/0304-4149(75)90033-2

U. Luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1017/CBO9780511810633

K. Wakita and T. Tsurumi, Finding community structure in mega-scale social networks, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.1275-1276, 2007.
DOI : 10.1145/1242572.1242805

E. P. Wigner, Characteristic vectors of bordered matrices with infinite dimensions, The Annals of Mathematics, pp.548-564, 1955.

E. P. Wigner, On the Distribution of the Roots of Certain Symmetric Matrices, The Annals of Mathematics, vol.67, issue.2, pp.325-327, 1958.
DOI : 10.2307/1970008

J. Yang, J. Mcauley, and J. Leskovec, Community Detection in Networks with Node Attributes, 2013 IEEE 13th International Conference on Data Mining, pp.1151-1156, 2013.
DOI : 10.1109/ICDM.2013.167

J. Heng-qing-ye, X. Ou, and . Yuan, Stability of data networks: Stationary and bursty models, Operations Research, vol.53, issue.1, pp.107-125, 2005.

L. Ying, S. Shakkottai, A. Reddy, and S. Liu, On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks, IEEE/ACM Transactions on Networking, vol.19, issue.3, pp.841-854, 2011.
DOI : 10.1109/TNET.2010.2094204

W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, issue.4, pp.452-473, 1977.
DOI : 10.1086/jar.33.4.3629752

P. Zhang, F. Krzakala, J. Reichardt, and L. Zdeborova, Comparative study for inference of hidden classes in stochastic block models, Journal of Statistical Mechanics: Theory and Experiment, vol.2012, issue.12, 2012.
DOI : 10.1088/1742-5468/2012/12/P12021

X. Zhang, J. Zhao, and Y. Lecun, Character-level convolutional networks for text classification, Advances in Neural Information Processing Systems, pp.649-657, 2015.

Y. Zhang, X. Chen, D. Zhou, and M. I. Jordan, Spectral methods meet em: A provably optimal algorithm for crowdsourcing, J. Mach. Learn. Res, vol.17, issue.1, pp.3537-3580, 2016.