Applied Probability in Great Britain

References

  • Akaike H. On a limiting process which asymptotically produces 1/f spectral density. Ann. Inst. Statist. Math. Tokyo (1960) 12:7–11CrossrefGoogle Scholar
  • Aldous D. Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels. IEEE Trans. Inform. Theory (1987) 33:219–223CrossrefGoogle Scholar
  • Aldous D. Deterministic and stochastic models for coalescence. Bernoulli (1999) 5:3–48CrossrefGoogle Scholar
  • Bailey N. T. J. The total size of a general stochastic epidemic. Biometrika (1953) 40:177–185CrossrefGoogle Scholar
  • Bailey N. T. J. Revised 1975. The Mathematical Theory of Epidemics (1957) (Griffin, London, U.K.) Google Scholar
  • Ball F. G. The threshold behaviour of epidemic models. J. Appl. Probab. (1983) 20:227–241CrossrefGoogle Scholar
  • Ball F. G. A unified approach to the distribution of total size and total area under the trajectory of infectives in epidemic models. Adv. Appl. Probab. (1986) 18:289–310CrossrefGoogle Scholar
  • Ball F. G. Empirical clustering of bursts of openings in Markov and semi-Markov models of single channel gating incorporating time interval omission. Adv. Appl. Probab. (1997) 29:909–946CrossrefGoogle Scholar
  • Ball F. G., Sansom M. S. P. Aggregated Markov processes incorporating time interval omission. Adv. Appl. Probab. (1988) 20:546–572CrossrefGoogle Scholar
  • Ball F. G., Milne R. K., Yeo F. G. Aggregated semi-Markov processes incorporating time interval omission. Adv. Appl. Probab. (1991) 23:772–797CrossrefGoogle Scholar
  • Bartlett M. S. Some evolutionary stochastic processes. J. Royal Statist. Soc. B (1949) 11:211–229Google Scholar
  • Bartlett M. S. The dual recurrence relation for multiplicative processes. Proc. Cambridge Phil. Soc. (1951) 47:821–825CrossrefGoogle Scholar
  • Bartlett M. S. Processus stochastiques ponctuels. Ann. Inst. Henri Poincaré (1954) 14:35–60Google Scholar
  • Bartlett M. S. Revised 1966, 1978. An Introduction to Stochastic Processes (1955) (Cambridge University Press, Cambridge, U.K.) Google Scholar
  • Bartlett M. S. Deterministic and stochastic models for recurrent epidemics. Proc. 3rd Berkeley Sympos. Math. Statist. Probab. (1956) 4:81–109Google Scholar
  • Bartlett M. S. Measles periodicity and community size. J. Royal Statist. Soc. A (1957a) 120:48–70CrossrefGoogle Scholar
  • Bartlett M. S. On theoretical models for competitive and predatory biological systems. Biometrika (1957b) 44:27–42CrossrefGoogle Scholar
  • Bartlett M. S. The critical community size for measles in the United States. J. Royal Statist. Soc. A (1960a) 123:37–44CrossrefGoogle Scholar
  • Bartlett M. S.Stochastic Population Models in Ecology and Epidemiology (1960b) (Methuen, London, U.K.) Google Scholar
  • Bartlett M. S. Equations for stochastic path integrals. Proc. Cambridge Phil. Soc. (1961) 57:568–573CrossrefGoogle Scholar
  • Bartlett M. S. Probability and statistics in the physical sciences. Bull. Inst. Internat. Statist. (Paris) (1962) 39(3):3–21Google Scholar
  • Bartlett M. S. The spectral analysis of point processes. J. Royal Statist. Soc. B (1963) 25:264–296Google Scholar
  • Bartlett M. S. The relevance of stochastic models for large-scale epidemiological phenomena. Appl. Statist. (1964) 13:2–8CrossrefGoogle Scholar
  • Bartlett M. S. The spectral analysis of line processes. Proc. 5th Berkeley Sympos. Math. Statist. (1967) 3:135–153Google Scholar
  • Bartlett M. S. Physical nearest-neighbour systems and non-linear time-series. J. Appl. Probab. (1971) 8:222–232CrossrefGoogle Scholar
  • Bartlett M. S., Bartlett M. S., Hiorns R. W. Equations and models of population change. The Mathematical Theory of the Dynamics of Biological Populations (1973) (Academic Press, London, U.K.) 5–21Google Scholar
  • Bartlett M. S., Kendall D. G. On the use of the characteristic functional in the analysis of some stochastic processes occurring in physics and biology. Proc. Cambridge Phil. Soc. (1950) 47:65–76CrossrefGoogle Scholar
  • Bather J. A. The optimal regulation of dams in continuous time. J. Soc. Indust. Appl. Math. (1963) 11:33–63CrossrefGoogle Scholar
  • Bather J. A. A continuous time inventory model. J. Appl. Probab. (1966) 3:538–549CrossrefGoogle Scholar
  • Bather J. A. Diffusion models in stochastic control theory. J. Royal Statist. Soc. A (1969) 132:335–352CrossrefGoogle Scholar
  • Bather J. A. Optimal stopping problems for Brownian motion. Adv. Appl. Probab. (1970) 2:259–286CrossrefGoogle Scholar
  • Bather J. A. Optimal decision procedures for finite Markov chains. Adv. Appl. Probab. (1973) 5:328–339521540541553CrossrefGoogle Scholar
  • Bather J. A.Decision Theory (2000) (Wiley, Chichester and New York) Google Scholar
  • Bather J. A., Chernoff H. Sequential decisions in the control of a space-ship. Proc. 5th Berkeley Sympos. Math. Statist. Probab. (1965) 3(University of California Press, Berkeley, CA) Google Scholar
  • Bather J. A., Chernoff H. Sequential decisions in the control of a spaceship (finite fuel). J. Appl. Probab. (1967) 4:584–604CrossrefGoogle Scholar
  • Besag J. E. Spatial interaction and the statistical analysis of lattice systems. J. Royal Statist. Soc. B (1974) 36:192–236Google Scholar
  • Bingham N. H. Fluctuation theory in continuous time. Adv. Appl. Probab. (1975) 7:705–766CrossrefGoogle Scholar
  • Bingham N. H., Dunham B. Estimating diffusion coefficients from count data: Einstein-Smoluchowski theory revisited. Ann. Inst. Statist. Mech. (1997) 49:667–679CrossrefGoogle Scholar
  • Broadbent S. R., Hammersley J. M. Percolation processes I. Crystals and mazes. Proc. Cambridge Phil. Soc. (1957) 53:629–641CrossrefGoogle Scholar
  • Brook D. On the distinction between the conditional and the joint probability approaches in the specification of nearest-neighbour systems. Biometrika (1964) 51:481–483CrossrefGoogle Scholar
  • Coffman E. G., Johnson D. S., Shor S., Weber R. R. Markov chains, computer proofs and average-case analysis of best-fit bin packing. Proc. 25th ACM Sympos. Theory Comp. (1993) 412–421CrossrefGoogle Scholar
  • Colquhoun D., Hawkes A. G. Relaxation and fluctuation of currents that flow through drug operated ion channels. Proc. Royal Soc. London B (1977) 199:231–262CrossrefGoogle Scholar
  • Colquhoun D., Hawkes A. G. On the stochastic properties of bursts of single ion channel openings and clusters of bursts. Phil. Trans. Royal Soc. London B (1982) 300:1–59CrossrefGoogle Scholar
  • Courcoubetis C., Weber R. R. Buffer overflow asymptotics for a switch handling many traffic sources. J. Appl. Probab. (1996) 33:886–903CrossrefGoogle Scholar
  • Courcoubetis C., Kelly F. P., Weber R. R. Measurement-based charging in communication networks. Oper. Res. (2000) 48:535–548LinkGoogle Scholar
  • Cox D. R. Some statistical methods connected with series of events. J. Royal Statist. Soc. B (1955a) 17:129–157Google Scholar
  • Cox D. R. The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. Proc. Cambridge Phil. Soc. (1955b) 51:433–441CrossrefGoogle Scholar
  • Cox D. R. A renewal problem with bulk ordering of components. J. Royal Statist. Soc. B (1959) 21:180–189Google Scholar
  • Cox D. R.Renewal Theory (1962) (Methuen, London, U.K.) Google Scholar
  • Cox D. R., David H. T., David H. A. Long-range dependence: A review. Statistics: An Appraisal (1984) (Iowa State University Press, Ames, IA) Google Scholar
  • Cox D. R., Benson F. The productivity of machines requiring attention at random intervals. J. Royal Statist. Soc. B (1951) 13:65–82Google Scholar
  • Cox D. R., Bloomfield P. A low traffic approximation for queues. J. Appl. Probab. (1972) 9:832–840CrossrefGoogle Scholar
  • Cox D. R., Isham V. Series expansions for the properties of a birth process of controlled variability. J. Appl. Probab. (1978) 15:610–616CrossrefGoogle Scholar
  • Cox D. R., Isham V.Point Processes (1981) (Chapman and Hall, London, U.K.) Google Scholar
  • Cox D. R., Smith W. L.Queues (1961) (Methuen, London, U.K.) Google Scholar
  • Daley D. J., Kendall D. G. Stochastic rumours. J. Inst. Math. Appl. (1965) 1:284–296CrossrefGoogle Scholar
  • Daniels H. E. The probability distribution of the extent of a random chain. Proc. Cambridge Phil. Soc. (1941) 37:244–251CrossrefGoogle Scholar
  • Daniels H. E. The statistical theory of the strengths of bundles of threads. Proc. Royal Soc. A (1945) 183:405–435CrossrefGoogle Scholar
  • Daniels H. E. The statistical theory of stiff chains. Proc. Royal Soc. Edin. A (1952) 63:290–311Google Scholar
  • Daniels H. E. The Poisson process with a curved absorbing boundary. Bull ISI 34th Session (1963) 994–1008Google Scholar
  • Daniels H. E. The distribution of the total size of an epidemic. Proc. 5th Berkeley Sympos. Math. Stat. Probab. (1965) 4:281–293Google Scholar
  • Daniels H. E. Kühn-Grun type approximations for polymer chain distributions. Proc. 6th Berkeley Sympos. Math. Stat. Probab. (1970) 3:281–293Google Scholar
  • Daniels H. E. An exact relation in the theory of carrier-borne epidemics. Biometrika (1972) 59:211–213CrossrefGoogle Scholar
  • Daniels H. E. The advancing wave in a spatial birth process. J. Appl. Probab. (1977) 14:689–701CrossrefGoogle Scholar
  • Daniels H. E. The saddlepoint approximation for a general birth process. J. Appl. Probab. (1982) 19:20–28CrossrefGoogle Scholar
  • Daniels H. E. The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres. Adv. Appl. Probab. (1989) 21:315–333CrossrefGoogle Scholar
  • Daniels H. E., Mollison D. A perturbation approach to nonlinear epidemic waves. Epidemic Models (1995) (Publications of the Newton Institute, Cambridge University Press, Cambridge, U.K.) 202–214Google Scholar
  • Daniels H. E. Approximating the first crossing time density for a curved boundary. Bernoulli (1996) 2:133–143CrossrefGoogle Scholar
  • Davis M. H. A.Linear Estimation and Stochastic Control (1977) (Chapman and Hall, London, U.K.) Google Scholar
  • Davis M. H. A.Lectures on Stochastic Control and Nonlinear Filtering (1984a) (Springer, Berlin, Germany) Google Scholar
  • Davis M. H. A. Piecewise-deterministic Markov processes: A general class of non-diffusion stochastic models. J. Royal Statist. Soc. B (1984b) 46:353–338Google Scholar
  • Davis M. H. A.Markov Models and Optimization (1993) (Chapman and Hall, London, U.K.) CrossrefGoogle Scholar
  • Davis M. H. A., Norman A. R. Portfolio selection with transaction costs. Math. Oper. Res. (1990) 15:676–713LinkGoogle Scholar
  • Davis M. H. A., Zariphopoulou P. European option pricing with transaction costs. SIAM J. Control Optim. (1993) 31:470–493CrossrefGoogle Scholar
  • Dempster M. A. H., Davis M. H. A., Elliott R. J. Optimal control of piecewisedeterministic Markov processes. Applied Stochastic Analysis (1991) (Gordon and Breach, New York) 303–325Google Scholar
  • Dempster M. A. H., Ye J. J. Impulse control of piecewise-deterministic Markov processes. Ann. Appl. Probab. (1995) 5:399–423CrossrefGoogle Scholar
  • Donnelly P. Partition structures, Polya urns, the Ewens sampling formula, and the ages of allelles. Theoret. Pop. Biol. (1986) 30:271–288CrossrefGoogle Scholar
  • Donnelly P. Weak convergence to a Markov chain with an entrance boundary: Ancestral processes in population genetics. Ann. Probab. (1991) 19:1102–1117CrossrefGoogle Scholar
  • Donnelly P., Grimmett G. On the asymptotic distribution of large prime factors. J. London Math. Soc. (1993) 47:395–404CrossrefGoogle Scholar
  • Donnelly P., Kurtz T. A countable representation of the Fleming-Viot measure-valued diffusion. Ann. Probab. (1996) 24:698–742CrossrefGoogle Scholar
  • Donnelly P., Kurtz T. Particle representations for measure-valued population models. Ann. Probab. (1999a) 27:166–205CrossrefGoogle Scholar
  • Donnelly P., Kurtz T. Genealogical processes for Fleming-Viot models with selection and recombination. Ann. Appl. Probab. (1999b) 9:1091–1148CrossrefGoogle Scholar
  • Donnelly P., Tavaré S. The age of alleles and a coalescent. Adv. Appl. Probab. (1986) 18:1–19CrossrefGoogle Scholar
  • Donnelly P., Tavaré S. Coalescents and genealogical structure under neutrality. Ann. Rev. Genetics (1995) 29:401–421CrossrefGoogle Scholar
  • Durbin J. The first-passage density of a continuous Gaussian process to a general boundary. J. Appl. Probab. (1985) 22:99–122CrossrefGoogle Scholar
  • Durbin J. The first-passage density of the Brownian motion process to a curved boundary. J. Appl. Probab. (1992) 29:291–304CrossrefGoogle Scholar
  • Edwards A. W. F. Estimation of the branch points of a branching diffusion process. J. Royal Statist. Soc. B (1970) 32:155–164Google Scholar
  • Fisher R. A. The wave of advance of advantageous genes. Ann. Eugen. (1937) 7:355–369CrossrefGoogle Scholar
  • Gani J. Problems in the probability theory of storage systems. J. Royal Statist. Soc. B (1957) 19:181–206Google Scholar
  • Gani J. On the general stochastic epidemic. Proc. 5th Berkeley Sympos. Math. Statist. Probab. (1967) 4:271–279Google Scholar
  • Gani J. Recent advances in storage and flooding theory. Adv. Appl. Probab. (1969) 1:90–110CrossrefGoogle Scholar
  • Gani J. Some problems in epidemic theory. J. Royal Statist. Soc. A (1978) 141:323–347CrossrefGoogle Scholar
  • Gani J. A note on threshold theorems for epidemics with bunching. Ann. Oper. Res. (1987) 207–215CrossrefGoogle Scholar
  • Gani J., Gani J. Adventures in applied probability. A Celebration of Applied Probability (1988) (Sheffield, U.K.) 3–23Applied Probability TrustCrossrefGoogle Scholar
  • Gani J., Daley D. J.Epidemic Modelling: An Introduction (1999) (Cambridge University Press, Cambridge, U.K.) Google Scholar
  • Gibbens R. J.Dynamic Routing in Circuit-Switched Networks (1988) (University of Cambridge, Cambridge, U.K.) . Ph.D. thesisGoogle Scholar
  • Gibbens R. J., Hunt P. J. Effective bandwidths for the multi-type UAS channel. Queueing Systems (1991) 9:17–28CrossrefGoogle Scholar
  • Gibbens R. J., Kelly F. P., Key P. B., Steenstrup M. Dynamic alternative routing. Routing in Communication Networks (1995) (Prentice Hall, Englewood Cliffs, NJ) 3–47Google Scholar
  • Gittins J. C. Bandit processes and dynamic allocation indices. J. Royal Statist. Soc. B (1979) 41:148–177Google Scholar
  • Gittins J. C.Multi-armed Bandit Allocation Indices (1989) (Wiley, Chichester and New York) Google Scholar
  • Gittins J. C., Jones D. M., Gani J. A dynamic allocation index for the sequential design of experiments. Progress in Statistics (1974) (North Holland, Amsterdam, The Netherlands) 241–266Google Scholar
  • Glazebrook K. D. Stochastic scheduling with order constraints. Internat. J. Syst. Sci. (1976) 7:657–666CrossrefGoogle Scholar
  • Glazebrook K. D. On randomised dynamic allocation indicies for the sequential design of experiments. J. Royal Statist. Soc. B (1980) 42:342–346Google Scholar
  • Glazebrook K. D. On a sufficient condition for superprocesses due to Whittle. J. Appl. Probab. (1982) 19:99–110CrossrefGoogle Scholar
  • Glazebrook K. D., Garbe R. Reflections on a new approach to Gittins indexation. J. Oper. Res. Soc. (1996) 47:1301–1309CrossrefGoogle Scholar
  • Glazebrook K. D., Dacre M., Niño-Mora J. The achievable region approach to the optimal control of stochastic systems. J. Royal Statist. Soc. B (1999) 61:747–791CrossrefGoogle Scholar
  • Glazebrook K. D., Gittins J. The performance of forward induction policies. Stochastic Proc. Appl. (1993) 46:301–326CrossrefGoogle Scholar
  • Good I. J. Cascade theory and the molecular weight averages of the sol fraction. Proc. Royal Soc. A (1963) 272:54–59CrossrefGoogle Scholar
  • Gordon M. Good's theory of cascade processes applied to the statistics of polymer distributions. Proc. Royal Soc. A (1962) 268:240–259CrossrefGoogle Scholar
  • Grimmett G. R. A theorem about random fields. Bull. London Math. Soc. (1973) 5:81–84CrossrefGoogle Scholar
  • Grimmett G. R. The stochastic random-cluster model, and the uniqueness of random-cluster measures. Ann. Probab. (1995) 23:1461–1510CrossrefGoogle Scholar
  • Grimmett G. R.Percolation (1989) (Springer, Berlin, Germany) . Revised 2000CrossrefGoogle Scholar
  • Grimmett G. R., Aizenman M. Strict monotonicity of critical points in percolation and ferromagnetic models. J. Stat. Phys. (1991) 63:817–835CrossrefGoogle Scholar
  • Grimmett G. R., Kesten H. First-passage percolation, network flows and electrical networks. Z. Wahrscheinlichkeitsth. verw. Geb. (1984a) 66:335–366CrossrefGoogle Scholar
  • Grimmett G. R., Kesten H. Random electrical networks on complete graphs. J. London Math. Soc. (1984b) 30:171–192CrossrefGoogle Scholar
  • Grimmett G. R., Barsky D. J., Newman C. M. Percolation in half spaces: Equality of critical probabilities and continuity of the percolation probability. Prob. Theoret. Rel. Fields (1991) 90:111–148CrossrefGoogle Scholar
  • Grimmett G. R., van den Berg J., Schinazi R. Dependent random graphs and spatial epidemics. Ann. Appl. Probab. (1998) 8:317–336CrossrefGoogle Scholar
  • Hammersley J. M. Long-chain polymers and self-avoiding walks. Sankhya A (1963) 25:29–38269272Google Scholar
  • Hammersley J. M. Harnesses. Proc. 5th Berkeley Sympos. Math. Statist. Probab. (1967) 3:89–117Google Scholar
  • Hammersley J. M., Clifford P. Markov fields on finite graphs and lattices. (1970) . Working paper, Oxford University, Oxford, U.K.Google Scholar
  • Hammersley J. M., Morton K. W. Poor man's Monte Carlo. J. Royal Statist. Soc. B (1954) 16:23–38Google Scholar
  • Hammersley J. M., Welsh D. J. A. First-passage percolation, subadditive processes, stochastic networks and generalized renewal theory. Bayes, Bernoulli, Laplace Anniversary Volume (1965) (Springer, Berlin, Germany) 61–10CrossrefGoogle Scholar
  • Hawkes A. G. Point spectra of some mutually exciting point processes. Biometrika (1971) 58:438–443CrossrefGoogle Scholar
  • Hawkes A. G., Jalali A., Colquhoun D. The distributions of the apparent open times and shut times in a single ion channel when brief events cannot be detected. Phil. Trans. Royal Soc. London A (1990) 332:511–538CrossrefGoogle Scholar
  • Jackson J. R. Jobshop-like queueing systems. Management Sci. (1963) 10:131–142LinkGoogle Scholar
  • Jackson R. R. P. Queueing systems with phase-type service. Oper. Res. Quart. (1954) 5:109–120CrossrefGoogle Scholar
  • Jacobson D. H. Optimal stochastic linear systems with exponential performance criteria and their relation to deterministic differential games. IEEE Trans. Auto. Control (1973) AC-18:124–131CrossrefGoogle Scholar
  • Jacobson V. Congestion avoidance and control. Proc. ACM SIG-COMM '88 (1988) 314–329Available at 〈 ftp://ftp.ee.lbl.gov/papers/congavoid.ps.〉CrossrefGoogle Scholar
  • Kalman R. E. A new approach to linear filtering and prediction problems. Trans. ASME D, J. Basic Engrg. (1960) 82:35–45CrossrefGoogle Scholar
  • Kelly F. P.Reversibility and Stochastic Networks (1979) (Wiley, Chichester and New York) Google Scholar
  • Kelly F. P. Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. (1985a) 18:473–505CrossrefGoogle Scholar
  • Kelly F. P. Stochastic models of computer communication systems. J. Royal Statist. Soc. B (1985b) 47:379–395Google Scholar
  • Kelly F. P. Loss networks. Ann. Appl. Probab. (1991) 1:319–378CrossrefGoogle Scholar
  • Kelly F. P., Kelly F. P., Zachary S., Ziedins I. B. Notes on effective bandwidths. Stochastic Networks: Theory and Applications (1996) (Oxford University Press, Oxford, U.K.) Google Scholar
  • Kelly F. P., Engquist B., Schmid W. Mathematical modelling of the Internet. Mathematics Unlimited—2001 and Beyond (2001) (Springer, Heidelberg, Germany) 685–702CrossrefGoogle Scholar
  • Kelly F. P., MacPhee I. The number of packets transmitted by collision detect random access schemes. Ann. Probab. (1987) 15:1557–1568CrossrefGoogle Scholar
  • Kelly F. P., Maulloo A., Tan D. Rate control in communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. (1998) 49:237–252CrossrefGoogle Scholar
  • Kendall D. G. On some modes of population growth leading to R. A. Fisher's logarithmic series distribution. Biometrika (1948a) 35:1–15CrossrefGoogle Scholar
  • Kendall D. G. On the generalized "birth-and-death" process. Ann. Math. Statist. (1948b) 19:1–15CrossrefGoogle Scholar
  • Kendall D. G. Stochastic processes and population growth. J. Royal Statist. Soc. B (1949) 11:230–264Google Scholar
  • Kendall D. G. Some problems in the theory of queues. J. Royal Statist. Soc. B (1951) 13:151–173Google Scholar
  • Kendall D. G. Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Ann. Math. Statist. (1953) 24:338–354CrossrefGoogle Scholar
  • Kendall D. G. Some problems in the theory of dams. J. Royal Statist. Soc. B (1957a) 19:212–233Google Scholar
  • Kendall D. G. La propagation d'une épidémie ou d'un bruit dans une population limitée. Publ. Inst. Statist. Univ. Paris (1957b) 6:149–160Google Scholar
  • Kendall D. G. Geometric ergodicity and theory of queues. Mathematical Methods in the Social Sciences (1960) (Stanford University Press, Stanford, CA) 176–195Google Scholar
  • Kendall D. G. Some recent work and further problems in the theory of queues. Theoret. Probab. Appl. (1964) 9:1–13CrossrefGoogle Scholar
  • Kendall D. G. Pole-seeking Brownian motion and bird navigation. J. Royal Statist. Soc. B (1974) 36:365–417Google Scholar
  • Kendall D. G., Barden D., Carne T. K., Le H.Shape and Shape Theory (1999) (Wiley, Chichester and New York) CrossrefGoogle Scholar
  • Kendall M. G., Moran P. A. P.Geometric Probability (1963) (Griffin, London, U.K.) Google Scholar
  • Kendall W. S., Saunders I. W. Epidemics in competition II: The general epidemic. J. Royal Statist. Soc. B (1983) 45:238–244Google Scholar
  • Kermack W. O., McKendrick A. G. Contributions to the mathematical theory of epidemics. Proc. Royal Soc. A (1927) . 115 700, 138 55, 141 94CrossrefGoogle Scholar
  • Key P. B. Implied cost methodology and software tools for a fully connected network with DAR and trunk reservation. British Telecom Tech. J. (1988) 6:52–65Google Scholar
  • Kingman J. F. C. A mathematical problem in population genetics. Proc. Cambridge Phil. Soc. (1961a) 57:574–582CrossrefGoogle Scholar
  • Kingman J. F. C. The single server queue in heavy traffic. Proc. Cambridge Phil. Soc. (1961b) 57:902–904CrossrefGoogle Scholar
  • Kingman J. F. C. On queues in heavy traffic. J. Royal Statist. Soc. B (1962) 24:383–392Google Scholar
  • Kingman J. F. C. The heavy traffic approximation in the theory of queues. Proc. Sympos. Congestion Theory (1965) 137–169University of North CarolinaGoogle Scholar
  • Kingman J. F. C.The Algebra of Queues (1966) (Methuen, London, U.K.) Google Scholar
  • Kingman J. F. C. The ergodic theory of subadditive stochastic processes. J. Royal Statist. Soc. B (1969a) 30:499–510Google Scholar
  • Kingman J. F. C. Markov population processes. J. Appl. Probab. (1969b) 6:1–18CrossrefGoogle Scholar
  • Kingman J. F. C.Regenerative Phenomena (1972) (Wiley, Chichester and London, U.K.) Google Scholar
  • Kingman J. F. C. Subadditive ergodic theory. Ann. Probab. (1973) 1:883–909CrossrefGoogle Scholar
  • Kingman J. F. C., Gani J. Anticipation processes. Perspectives in Probability and Statistics (1975) (Applied Probability Trust, Sheffield, U.K.) 201–215CrossrefGoogle Scholar
  • Kingman J. F. C. Subadditive processes. Springer Lecture Notes Math (1976) 539:167–223CrossrefGoogle Scholar
  • Kingman J. F. C.Mathematics of Genetic Diversity (1980) (SIAM, Philadelphia, PA) CrossrefGoogle Scholar
  • Kingman J. F. C. Queue disciplines in heavy traffic. Math. Oper. Res. (1982a) 7:262–271LinkGoogle Scholar
  • Kingman J. F. C. The coalescent. Stochastic Proc. Appl. (1982b) 13:235–248CrossrefGoogle Scholar
  • Kingman J. F. C.Poisson Processes (1993) (Oxford University Press, Oxford, U.K.) Google Scholar
  • Kingman J. F. C. Origins of the coalescent: 1974-1982. Genetics (2000) 156:1461–1463CrossrefGoogle Scholar
  • Kolmogorov A. N., Petrovsky I., Piscounov N. Étude de l'equation de le diffusion avec croissance de la quantité de matiére et son application á un probléme biologique. Bull. Univ. État Moscou, A (1937) 1(6):1–26Google Scholar
  • Lindley D. V. The theory of queues with a single server. Proc. Cambridge Phil. Soc. (1952) 48:277–289CrossrefGoogle Scholar
  • Loynes R. M. The stability of a queue with nonindependent inter-arrival and service times. Proc. Cambridge Phil. Soc. (1962a) 58:497–520CrossrefGoogle Scholar
  • Loynes R. M. Stationary waiting-time distributions for single-server queues. Ann. Math. Statist. (1962b) 33:1323–1339CrossrefGoogle Scholar
  • Loynes R. M. The stability of a system of queues in series. Proc. Cambridge Phil. Soc. (1964) 60:569–574CrossrefGoogle Scholar
  • Loynes R. M. On a property of the random walks describing simple queues and dams. J. Royal Statist. Soc. B (1965) 27:125–129Google Scholar
  • Mollison D. The rate of spatial propagation of simple epidemics. Proc. 6th Berkeley Sympos. Math. Stat. Probab. (1970) 3:579–614Google Scholar
  • Mollison D. The velocity of stochastic processes. Trans. 7th Prague Conf. Inform. Theory (1977) A:1–9Google Scholar
  • Mollison D.Epidemic Models: Their Structure and Relation to Data (1996) (Cambridge University Press, Cambridge, U.K.) Google Scholar
  • Moran P. A. P. Random associations on a lattice. Proc. Cambridge Phil. Soc. (1947) 43:321–328CrossrefGoogle Scholar
  • Moran P. A. P. The interpretation of statistical maps. J. Royal Statist. Soc. B (1948) 10:243–251Google Scholar
  • Moran P. A. P. The statistical distribution of the length of a rubber molecule. Proc. Cambridge Phil. Soc. (1948) 44:342–344CrossrefGoogle Scholar
  • Moran P. A. P. Some remarks on animal population dynamics. Biometrika (1950) 6:250–258CrossrefGoogle Scholar
  • Moran P. A. P. The logic of the mathematical theory of animal populations. J. Wildlife Management (1954) 18:60–65CrossrefGoogle Scholar
  • Moran P. A. P.The Theory of Storage (1959) (Methuen, London, U.K.) Google Scholar
  • Moran P. A. P.The Statistical Processes of Evolutionary Theory (1962) (Clarendon Press, Oxford, U.K.) Google Scholar
  • Moussouris J. Gibbs and Markov random fields with constraints. J. Statist. Phys. (1974) 10:11–33CrossrefGoogle Scholar
  • Moyal J. E. Stochastic processes and statistical physics. J. Royal Statist. Soc. B (1949) 11:150–210Google Scholar
  • Palm C. Intensitätsschwankungen im Fernsprechverkehr. Ericsson Technics (1943) 44(Stockholm, Sweden) Google Scholar
  • Preston C. J. Generalised Gibbs states and Markov random fields. Adv. App. Probab. (1973) 5:242–261CrossrefGoogle Scholar
  • Sherman S. Markov random fields and Gibbs random fields. Israeli J. Math. (1973) 14:92–103CrossrefGoogle Scholar
  • Smith R. L. A probability model for fibrous composites with local load sharing. Proc. Royal Soc. A (1980) 372:539–553CrossrefGoogle Scholar
  • Smith R. L. A note on a probability model for fibrous composites. Proc. Royal Soc. A (1982) 382:137–171CrossrefGoogle Scholar
  • Smith R. L., Taylor H. M. Models for fibrous-matrix composites with local load sharing. Oper. Res. (1984) 32:649–659LinkGoogle Scholar
  • Smith W. L. On the distribution of queueing times. Proc. Cambridge Phil. Soc. (1953) 49:449–461CrossrefGoogle Scholar
  • Smith W. L. Regenerative stochastic processes. Proc. Royal Soc. A (1955) 232:6–31CrossrefGoogle Scholar
  • Smoluchowski M. Drei Vorträge über Diffusion, Brownsche Bewegung und Koagulation von Kolloidteilchen. Phys. Z. (1916) 17:557–585Google Scholar
  • Stidham S., Weber R. R. Monotone and insensitive optimal policies for the control of queues with undiscounted costs. Oper. Res. (1989) 37:611–625LinkGoogle Scholar
  • Stockmayer W. H. Theory of molecular size distribution and gel formation in branched chain polymers. J. Chem. Phys. (1943) 11:43–5512 15–131CrossrefGoogle Scholar
  • Tsitsiklis J. N. A lemma on the MAB problem. IEEE Trans. Automatic Control (1986) 31:576–577CrossrefGoogle Scholar
  • Weber R. R. Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Probab. (1982) 19:167–182CrossrefGoogle Scholar
  • Weber R. R. The interchangeability of tandem queues with heterogeneous customers and dependent service times. J. Appl. Probab. (1992) 24:727–737CrossrefGoogle Scholar
  • Weber R. R. On the Gittins index for multiarmed bandits. Ann. Appl. Probab. (1992) 2:1024–1033CrossrefGoogle Scholar
  • Weber R. R., Weiss G. On an index policy for restless bandits. J. Appl. Probab. (1990) 27:637–648CrossrefGoogle Scholar
  • Weber R. R., Weiss G. The cafeteria process, tandem queues with dependent 0-1 service times and the bowl shape phenomenon. Oper. Res. (1994) 42:895–912LinkGoogle Scholar
  • Whittle P. On stationary processes in the plane. Biometrika (1954) 41:434–449CrossrefGoogle Scholar
  • Whittle P. The outcome of a stochastic epidemic—a note on Bailey's paper. Biometrika (1955) 42:116–122Google Scholar
  • Whittle P. Topographic correlation, power-law covariance functions, and diffusion. Biometrika (1962) 49:305–314CrossrefGoogle Scholar
  • Whittle P.Prediction and Regulation by Linear Least-square Methods (1963) (English Universities Press, London, U.K.) . Revised edition 1983, University of Minnesota PressGoogle Scholar
  • Whittle P. Nonlinear migration processes. Proc. 36th Session Internat. Statist. Inst. (1967) 642–646Google Scholar
  • Whittle P. Equilibrium distributions for an open migration process. J. Appl. Probab. (1968) 5:567–571CrossrefGoogle Scholar
  • Whittle P.Probability (1970) (Penguin, Harmondsworth, U.K. and Baltimore, MD) Google Scholar
  • Whittle P., Gani J. Reversibility and acyclicity. Perspectives in Probability and Statistics (1975) 217–224Applied Probability TrustGoogle Scholar
  • Whittle P. Multi-armed bandits and the Gittins index. J. Royal Statist. Soc. B (1980) 42:143–149Google Scholar
  • Whittle P. Arm-acquiring bandits. Ann. Probab. (1981a) 9:284–292CrossrefGoogle Scholar
  • Whittle P. Risk-sensitive linear/quadratic/Gaussian control. J. Appl. Probab. (1981b) 13:764–777CrossrefGoogle Scholar
  • Whittle P.Optimization over Time (1982) 1-2(Wiley, Chichester and New York) . 1983Google Scholar
  • Whittle P.Systems in Stochastic Equilibrium (1986) (Wiley, Chichester and New York) Google Scholar
  • Whittle P. Approximation in large-scale circuit-switched networks. Probab. Engrg. Inform. Sci. (1988a) 2:279–291CrossrefGoogle Scholar
  • Whittle P. Restless bandits; activity allocation in a changing world. J. Appl. Probab. (1988b) 25A:301–313Google Scholar
  • Whittle P.Risk-Sensitive Optimal Control (1990) (Wiley, Chichester and New York) Google Scholar
  • Whittle P. A risk-sensitive maximum principle. Systems Control Lett. (1990) 15:183–192CrossrefGoogle Scholar
  • Whittle P. A risk-sensitive maximum principle: The case of imperfect observation. IEEE Trans. Auto. Control (1991a) AC-36:793–801CrossrefGoogle Scholar
  • Whittle P. Likelihood and cost as path integrals. J. Royal Statist. Soc. B (1991b) 53:505–529Google Scholar
  • Whittle P.Probability via Expectation (1992) (Springer, New York) . (A radical revision of Probability further revised in 2000.)CrossrefGoogle Scholar
  • Whittle P. Polymer models and generalised Potts-Kasteleyn models. J. Statist. Phys. (1994) 75:1063–1092CrossrefGoogle Scholar
  • Whittle P.Optimal Control: Basics and Beyond (1996) (Wiley, Chichester, U.K.) Google Scholar
  • Yule G. U. On a method of investigating periodicities in disturbed series, with special reference to Wolfer's sunspot numbers. Phil. Trans. Royal Soc. A (1927) 226:267–298CrossrefGoogle Scholar
  • Zachary S., Kelly F. P., Zachary S., Ziedins I. The asymptotic behaviour of large loss networks. Stochastic Networks: Theory and Applications (1996) (Oxford University Press, Oxford, U.K.) 193–203Google Scholar
  • Zachary S., Ziedins I. A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning. Ann. Appl. Probab. (2002) . ForthcomingCrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.