Albert, R. and A.-L. Barabasi (2002). “Statistical Mechanics of Complex Networks,” Reviews of Modern Physics, vol. 74, pp. 47–97.

Appel, K. and W. Haken (1976). “Every Planar Map is Four Colorable,” Bulletin of the American Mathematical Society, vol. 82, pp. 711–712.

Appel, K. and W. Haken (1977). “The Solution of the Four-Color-Map Problem,” Scientific American, vol. 237, pp. 108–121.

Barabasi, A.-L. and R. Albert (1999). “Emergence of Scaling in Random Networks,” Science, vol. 286, pp. 509–512.

Barrat, A., M. Bathelemy and A. Vespignani (2008). Dynamical Processes on Complex Networks, Cambridge University Press, Cambridge, UK.

Baskett, F., K.M. Chandy, R.R. Muntz and F.G. Palacios (1975). “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” Journal of the ACM, vol. 22, pp. 248–260.

Bender, E.A. and E.R. Cranfield (1978). “The Asymptotic Number of Labeled Graphs with Given Degree Sequences,” Journal of Combinatorial Theory, Series A, vol. 24, pp. 296–307.

Besag, J. (1974). “Spatial Interaction and the Statistical Analysis of Lattice Systems,” Journal of the Royal Statistical Society, Series B, vol. 36, pp. 192–236.

Boccaletti, S., V. Latora, Y. Moreno, M. Chavez and D.-U. Hwang (2006). “Complex Networks: Structure and Dynamics,” Physics Reports, vol. 424, pp. 175–308.

Burke, P.J. (1956). “The Output of a Queueing System,” Operations Research, vol. 4, pp. 699–704.

Buzen, J.P. (1973). “Computational Algorithms for Closed Queueing Networks with Exponential Servers,” Communications of the ACM, vol. 16, pp. 527–531.

Chao, X., M. Miyazawa and M. Pinedo (1999). Queueing Networks: Customers, Signals and Product Form Solutions, John Wiley, Chichester, UK.

Costa L. Da F., F.A. Rodrigues, G. Travieso and P.R. Villas Boas (2007). “Characterization of Complex Networks: A Survey of Measurements,” Advances in Physics, vol. 56, pp. 167–242.

DeGroot, M.H. (1974). “Reaching a Consensus,” Journal of the American Statistical Association, vol. 69, pp. 118–121.

Dorogovtsev, S.N. and J.F.F. Mendes (2002). “Evolution of Networks,” Advances in Physics, vol. 51, pp. 1079–1187.

Dorogovtsev, S.N., A.V. Goltsev and J.F.F. Mendes (2008). “Critical Phenomena in Complex Networks,” Reviews of Modern Physics, vol. 80, pp. 1275–1335.

Doshi, B.T. (1986). “Queueing Systems with Vacations—A Survey,” Queueing Systems, vol. 1, pp. 29–66.

Durrett, R. (2007). Random Graph Dynamics, Cambridge University Press, Cambridge, UK.

Easley, D. and J. Kleinberg (2010). Networks Crowds and Markets: Reasoning about a Highly Connected World, Cambridge University Press, Cambridge, UK.

Erdos, P. and A. Renyi (1959). “On Random Graphs,” Publication of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61.

Erdos, P. and A. Renyi (1960). “On the Evolution of Random Graphs,” Publicationes Mathematicae Debrecen, vol. 6, pp. 209–297.

Forney, G.D. (2001). “Codes on Graphs: Normal Realizations,” IEEE Transactions on Information Theory, vol. 47, pp. 520–548.

Frank, O. and D. Strauss (1986). “Markov Graphs,” Journal of the American Statistical Association, vol. 47, pp. 832–842.

Fronczak, A., P. Fronczak and J. Holyst (2003). “Mean-field Theory for Clustering Coefficients in Barabasi-Albert Networks,” Physical Review E, Statistical, Nonlinear, and Soft Matter Physics, vol. 68, p. 046126.

Gaver, D.P. (1968). “Diffusion Approximations and Models for Certain Congestion Problems,” Journal of Applied Probability, vol. 5, pp. 607–623.

Gaver, D.P. (1971). “Analysis of Remote Terminal Backlogs under Heavy Demand Conditions,” Journal of the ACM, vol. 18, pp. 405–415.

Gelenbe, E. and G. Pujolle (1998). Introduction to Queueing Networks, 2nd ed., John Wiley, Chichester, UK.

Gelenbe, E., P. Glynn and K. Sigman (1991). “Queues with Negative Arrivals,” Journal of Applied Probability, vol. 28, pp. 245–250.

Glynn, P.W. (1990). “Diffusion Approximations,” Chapter 4 in Stochastic Models, D.P. Heyman and M.J. Sobel, editors, North-Holland, Amsterdam.

Gordon, W.J. and G.F. Newell (1967). “Closed Queueing Systems with Exponential Servers,” Operations Research, vol. 15, pp. 254–265.

Harrison, J.M. (1985). Brownian Motion and Stochastic Flow Systems, John Wiley, New York.

Hatano, Y. and M. Meshahi (2005). “Agreement over Random Networks,” IEEE Transactions on Automatic Control, vol. 50, pp. 1867–1872.

Heyman, D.P. (1975). “A Diffusion Model Approximation for the GI/G/1 Queue in Heavy Traffic,” Bell System Technical Journal, vol. 54, pp. 1637–1646.

Huang, C. and A. Darwiche (1996). “Inference in Belief Networks: A Procedural Guide,” International Journal of Approximate Reasoning, vol. 15, pp. 225–263.

Ibe, O.C. (2005). Fundamentals of Applied Probability and Random Processes, Elsevier Academic Press, Burlington, MA.

Ibe, O.C. (2009). Markov Processes for Stochastic Modeling, Elsevier Academic Press, Burlington, MA.

Ibe, O.C. and J. Keilson (1995). “Multiserver Threshold Queues with Hysteresis,” Performance Evaluation, vol. 21, pp. 185–213.

Ibe, O.C. and K.S. Trivedi (1990). “Stochastic Petri Net Models of Polling Systems,” IEEE Journal on Selected Areas in Communications, vol. 8, pp. 1646–1657.

Ibe, O.C. and K.S. Trivedi (1991). “Stochastic Petri Net Analysis of Finite-Population Vacation Queueing Systems,” Queueing Systems, vol. 8, pp. 111–128.

Ibe, O.C., K.S. Trivedi and H. Choi (1993). “Performance Evaluation of Client-Server Systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 4, pp. 1217–1229.

Jackson, M.O. (2008). Social and Economic Networks, Princeton University Press, Princeton, NJ.

Kauffman, S.A. (1969). “Metabolic Stability and Epigenesis in Randomly Constructed Genetic Nets,” Journal of Theoretical Biology, vol. 22, pp. 437-467.

Keilson, J., J. Cozzolino and H. Young (1968). “A Service System with Unfilled Requests Repeated,” Operations Research, vol. 16, pp. 1126–1137.

Kim, M. and M. Medard (2004). “Robustness in Large-Scale Random Networks,” Proceedings of the IEEE INFOCOM 2004, vol. 4, pp. 2364–2373.

Kleinrock, L. (1975). Queueing Systems Volume 1: Theory, John Wiley, New York.

Kobayashi, H. (1974). “Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions,” Journal of the ACM, vol. 21, pp. 316–328.

Lewis, T.G. (2009). Network Science: Theory and Applications, John Wiley, Hoboken, NJ.

Little, J.D.C. (1961). “A Proof for the Queueing Formula L = λW,” Operations Research, vol. 9, pp. 383–387.

Marchal, W.G. (1978). “Some Simpler Bounds on the Mean Queueing Time,” Operations Research, vol. 26, pp. 1083–1088.

Marshall, K.T. (1968). “Some Inequalities on Queueing,” Operations Research, vol. 16, pp. 651–665.

Newell, G.F. (1971). Applications of Queueing Theory, Chapman and Hall, London.

Newman, M.E.J. (2000). “Models of the Small World,” Journal of Statistical Physics, vol. 101, pp. 819–841.

Newman, M.E.J. (2002). “The Structure and Function of Complex Networks,” SIAM Review, vol. 45, pp. 167–256.

Newman, M.E.J. (2010). Networks: An Introduction, Oxford University Press, Oxford, UK.

Papadimitriou, C.H. and K. Steiglitz (1982). Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.

Posner, M. and B. Bernholtz (1968). “Closed Finite Queueing Networks with Time Lags and with Several Classes of Units,” Operations Research, vol. 16, pp. 977–985.

Reich, E. (1957). “Waiting Times When Queues Are in Tandem,” Annals of Mathematical Statistics, vol. 28, pp. 768–773.

Reiser, M. and S.S. Lavenberg (1980). “Mean Value Analysis of Closed Multichain Queueing Networks,” Journal of the ACM, vol. 27, pp. 313–322.

Saaty, T.L. (1972). “Thirteen Colorful Variations on Guthrie’s Four-Color Conjecture,” American Mathematical Monthly, vol. 79, pp. 2–43.

Tahbaz-Salehi, A. and A. Jadbabaie (2008). “A Necessary and Sufficient Condition for Consensus over Random Networks,” IEEE Transactions on Automatic Control, vol. 53, pp. 791–795.

Takagi, H. (1991). Queueing Analysis—A Foundation of Performance Analysis Volume 1: Vacation and Priority Systems, North-Holland, Amsterdam, the Netherlands.

Van Steen, M. (2010). Graph Theory and Complex Networks: An Introduction, Maarten van Steen, Amsterdam, the Netherlands.

Vega-Redondo, F. (2007). Complex Social Networks, Cambridge University Press, Cambridge, UK.

Watts, D.J. and S.H. Strogatz (1998). “Collective Dynamics of ‘Small-World’ Networks,” Nature, vol. 393, pp. 440–442.

Wiberg, N. (1996). Codes and Decoding on General Graphs, Linkoping Studies in Science and Technology, Dissertation 440, Linkoping University, Linkoping, Sweden.

Wolff, R.W. (1982). “Poisson Arrivals See Time Averages,” Operations Research, vol. 30, pp. 223–231.

Wolff, R.W. (1989). Stochastic Modeling and the Theory of Queues, Prentice Hall, Englewood Cliff, NJ.