Project Euclid

References

• Aldous, D. J. (1992). Asymptotics in the random assignment problem. Probab. Theory Related Fields 93 507–534.
• Aldous, D. J. (1992). Greedy search on the binary tree with random edge-weights. Combin. Probab. Comput. 1 281–293.
  Zentralblatt MATH: 0803.68025
  Digital Object Identifier: doi:10.1017/S096354830000033X
  
• Aldous, D. J. (1998). A Metropolis-type optimization algorithm on the infinite tree. Algorithmica 22 388–412.
  Zentralblatt MATH: 0936.68118
  Digital Object Identifier: doi:10.1007/PL00009231
  
• Aldous, D. J. (1998). On the critical value for percolation of minimum-weight trees in the mean-field distance model. Combin. Probab. Comput. 7 1–10.
  Zentralblatt MATH: 0899.60007
  Digital Object Identifier: doi:10.1017/S0963548397003155
  
• Aldous, D. J. (2000). The percolation process on a tree where infinite clusters are frozen. Math. Proc. Cambridge Philos. Soc. 128 465–477.
  Zentralblatt MATH: 0961.60096
  Digital Object Identifier: doi:10.1017/S0305004199004326
  
• Aldous, D. J. (2001). The $\zeta(2)$ limit in the random assignment problem. Random Structures Algorithms 18 381–418.
• Aldous, D. J. (2004). Cost-volume relationship for flows through a disordered network. Unpublished manuscript.
  Zentralblatt MATH: 1231.90112
  Digital Object Identifier: doi:10.1287/moor.1080.0327
  
• Aldous, D. J. (2005). Percolation-like scaling exponents for minimal paths and trees in the stochastic mean-field model. Proc. Roy. Soc. London Ser. A Math. Phys. Eng. Sci. To appear.
  Zentralblatt MATH: 1145.82325
  Digital Object Identifier: doi:10.1098/rspa.2004.1388
  
• Aldous, D. J. and Krebs, W. B. (1990). The birth-and-assassination process. Statist. Probab. Lett. 10 427–430.
  Zentralblatt MATH: 0712.60090
  Digital Object Identifier: doi:10.1016/0167-7152(90)90024-2
  
• Aldous, D. J. and Percus, A. G. (2003). Scaling and universality in continuous length combinatorial optimization. Proc. Natl. Acad. Sci. U.S.A. 100 11211–11215.
  Zentralblatt MATH: 1063.90041
  Digital Object Identifier: doi:10.1073/pnas.1635191100
  
• Aldous, D. J. and Steele, J. M. (2003). The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures, Encyclopaedia of Mathematical Sciences 110 (H. Kesten, ed.) 1–72. Springer, New York.\goodbreak
  Zentralblatt MATH: 1037.60008
  
• Asmussen, S. (1987). Applied Probability and Queues. Wiley, New York.
  Zentralblatt MATH: 0624.60098
  
• Athreya, K. B. (1985). Discounted branching random walks. Adv. in Appl. Probab. 17 53–66.
  Zentralblatt MATH: 0561.60089
  Digital Object Identifier: doi:10.2307/1427052
  
• Bachmann, M. (2000). Limit theorems for the minimal position in a branching random walk with independent logconcave displacements. Adv. in Appl. Probab. 32 159–176.
  Zentralblatt MATH: 0973.60098
  Digital Object Identifier: doi:10.1239/aap/1013540028
  Project Euclid: euclid.aap/1013540028
  
• Bandyopadhyay, A. (2002). Bivariate uniqueness in the logistic fixed point equation. Technical Report 629, Dept. Statistics, Univ. California, Berkeley.
• Bandyopadhyay, A. (2004). Bivariate uniqueness and endogeny for recursive distributional equations: Two examples. Preprint.
• Barlow, M. T., Pemantle, R. and Perkins, E. (1997). Diffusion-limited aggregation on a tree. Probab. Theory Related Fields 107 1–60.
• Bertoin, J. (2003). The asymptotic behaviour of fragmentation processes. J. European Math. Soc. 5 395–416.
  Zentralblatt MATH: 1042.60042
  Digital Object Identifier: doi:10.1007/s10097-003-0055-3
  
• Biggins, J. D. (1977). Chernoff's theorem in the branching random walk. J. Appl. Probab. 14 630–636.
  Zentralblatt MATH: 0373.60090
  Digital Object Identifier: doi:10.2307/3213469
  
• Biggins, J. D. (1977). Martingale convergence in the branching random walk. J. Appl. Probab. 14 25–37.
  Zentralblatt MATH: 0356.60053
  Digital Object Identifier: doi:10.1017/S0021900200104644
  
• Biggins, J. D. (1998). Lindley-type equations in the branching random walk. Stochastic Process. Appl. 75 105–133.
  Zentralblatt MATH: 0933.60087
  Digital Object Identifier: doi:10.1016/S0304-4149(98)00016-7
  
• Caliebe, A. and R ösler, U. (2003). Fixed points with finite variance of a smoothing transformation. Stochastic Process. Appl. 107 105–129.
  Zentralblatt MATH: 1075.60503
  Digital Object Identifier: doi:10.1016/S0304-4149(03)00075-9
  
• Chauvin, B., Krein, T., Marckert, J.-F. and Rouault, A. (2004). Martingales and profiles of binary search trees. Available at http://fermat.math.uvsq.fr/~marckert.
  URL: Link to item
  
• Dekking, F. M. and Host, B. (1991). Limit distributions for minima displacements of branching random walks. Probab. Theory Related Fields 90 403–426.
  Mathematical Reviews (MathSciNet): MR1133373
  Digital Object Identifier: doi:10.1007/BF01193752
  
• Devroye, L. (2001). On the probabilistic worst-case time of find. Algorithmica 31 291–303.
• Devroye, L. and Neininger, R. (2002). Density approximation and exact simulation of random variables that are solutions of fixed-point equations. Adv. in Appl. Probab. 34 441–468.
  Zentralblatt MATH: 1010.65002
  Digital Object Identifier: doi:10.1239/aap/1025131226
  Project Euclid: euclid.aap/1025131226
  
• Diaconis, P. and Freedman, D. (1999). Iterated random functions. SIAM Review 41 45–76.
  Zentralblatt MATH: 0926.60056
  Digital Object Identifier: doi:10.1137/S0036144598338446
  
• Durrett, R. and Liggett, T. M. (1983). Fixed points of the smoothing transformation. Z. Wahrsch. Verw. Gebiete 64 275–301.
  Zentralblatt MATH: 0506.60097
  Digital Object Identifier: doi:10.1007/BF00532962
  
• Durrett, R. and Limic, V. (2002). A surprising Poisson process arising from a species competition model. Stochastic Process. Appl. 102 301–309.
  Zentralblatt MATH: 1075.60582
  Digital Object Identifier: doi:10.1016/S0304-4149(02)00209-0
  
• Elias, P. (1972). The efficient construction of an unbiased random source. Ann. Math. Statist. 43 865–870.
  Zentralblatt MATH: 0245.65003
  Digital Object Identifier: doi:10.1214/aoms/1177692552
  Project Euclid: euclid.aoms/1177692552
  
• Fill, J. A. and Janson, S. (2000). A characterization of the set of fixed points of the quicksort transformation. Electron. Comm. Probab. 5 77–84.
  Zentralblatt MATH: 0943.68192
  Digital Object Identifier: doi:10.1214/ECP.v5-1021
  
• Frieze, A. M. (1985). On the value of a random minimum spanning tree problem. Discrete Appl. Math. 10 47–56.
• Gamarnik, D., Nowicki, T. and Swirscsz, G. (2003). Maximum weight independent sets and matchings in sparse random graphs: Exact results using the local weak convergence method. arXiv:math.PR/0309441.
• Georgii, H.-O. (1988). Gibbs Measures and Phase Transitions. de Gruyter, Berlin.
• Grimmett, G. R. (1999). Percolation, 2nd ed. Springer, Berlin.
  Zentralblatt MATH: 0926.60004
  
• Hammersley, J. M. (1974). Postulates for subadditive processes. Ann. Probab. 2 652–680.
  Zentralblatt MATH: 0303.60044
  Digital Object Identifier: doi:10.1214/aop/1176996611
  Project Euclid: euclid.aop/1176996611
  
• Harris, S. C. (1999). Travelling-waves for the FKPP equation via probabilistic arguments. Proc. Roy. Soc. Edinburgh Sect. A 129 503–517.\goodbreak
  Zentralblatt MATH: 0946.35040
  Digital Object Identifier: doi:10.1017/S030821050002148X
  
• Iksanov, A. M. (2004). Elementary fixed points of the BRW smoothing transforms with infinite number of summands. Stochastic Process. Appl. 114 27–50.
  Zentralblatt MATH: 1081.60017
  Digital Object Identifier: doi:10.1016/j.spa.2004.06.002
  
• Iksanov, A. M. and Jurek, Z. J. (2002). On fixed points of Poisson shot noise transforms. J. Appl. Probab. 34 798–825.
  Zentralblatt MATH: 1030.60011
  Digital Object Identifier: doi:10.1017/S0001867800011927
  Project Euclid: euclid.aap/1037990954
  
• Iksanov, A. M. and Kim, C.-S. (2004). On a Pitman–Yor problem. Statist. Probab. Lett. 68 61–72.
  Zentralblatt MATH: 1063.60014
  Digital Object Identifier: doi:10.1016/j.spl.2004.01.015
  
• Jagers, P. and Rösler, U. (2004). Stochastic fixed points for the maximum. In Mathematics and Computer Science III (M. Drmota, P. Flajolet, D. Gardy and B. Gittenberger, eds.) 325–338. Birkhäuser, Basel.
• Jordan, J. (2003). Renormalization of random hierarchical systems. Ph.D. thesis, Univ. Sheffield, U.K. Available at www.shef.ac.uk/jhj/thesis.pdf.
• Kagan, A. M., Linnik, Yu. V. and Rao, C. R. (1973). Characterization Problems in Mathematical Statistics. Wiley, New York.
  Zentralblatt MATH: 0271.62002
  
• Karpelevich, F. I., Kelbert, M. Ya. and Suhov, Yu. M. (1994). Higher-order Lindley equations. Stochastic Process. Appl. 53 65–96.
  Zentralblatt MATH: 0840.60084
  Digital Object Identifier: doi:10.1016/0304-4149(94)90058-2
  
• Khamsi, M. A. and Kirk, W. A. (2001). An Introduction to Metric Spaces and Fixed Point Theory. Wiley, New York.
  Zentralblatt MATH: 1318.47001
  
• Kolmogorov, A., Petrovsky, I. and Piscounov, N. (1937). Etude de l'équation de la diffusion avec croissance de la quantité de matière et son application à un problème biologique. Moscow Univ. Math. Bull. 1 1–25.
• Liggett, T. M. (1985). Interacting Particle Systems. Springer, Berlin.
  Zentralblatt MATH: 0559.60078
  
• Linusson, S. and Wästlund, J. (2004). A proof of Parisi's conjecture on the random assignment problem. Probab. Theory Related Fields 128 419–440.
• Liu, Q. (1998). Fixed points of a generalized smoothing transformation and applications to the branching random walk. Adv. in Appl. Probab. 30 85–112.
  Zentralblatt MATH: 0909.60075
  Digital Object Identifier: doi:10.1017/S0001867800008090
  Project Euclid: euclid.aap/1035227993
  
• Liu, Q. (2001). Asymptotic properties and absolute continuity of laws stable by random weighted mean. Stochastic Process. Appl. 95 83–107.
• Mézard, M. and Parisi, G. (1985). Replicas and optimization. J. Physique Lett. 46 L771–L778.
• Mézard, M. and Parisi, G. (1986). A replica analysis of the travelling salesman problem. J. Physique 47 1285–1296.
• Mézard, M. and Parisi, G. (1987). On the solution of the random link matching problem. J. Physique 48 1451–1459.
• Mézard, M. and Parisi, G. (2003). The cavity method at zero temperature. J. Statist. Phys. 111 1–34.
• Nair, C., Prabhakar, B. and Sharma, M. (2003). A proof of Parisi's conjecture for the finite random assignment problem. Unpublished manuscript.
• Propp, J. and Wilson, D. (1998). Coupling from the past: A user's guide. In Microsurveys in Discrete Probability. DIMACS Ser. Discrete Math. Theoret. Comp. Sci. (D. Aldous and J. Propp, eds.) 41 181–192.
  Zentralblatt MATH: 0916.65147
  
• Rachev, S. T. (1991). Probability Metrics and the Theory of Stochastic Models. Wiley, New York.
  Zentralblatt MATH: 0744.60004
  
• Rachev, S. T. and Rüschendorf, L. (1998). Mass Transportation Problems 2: Applications. Springer, New York.
• R ösler, U. (1992). A fixed point theorem for distributions. Stochastic Process. Appl. 42 195–214.
• R ösler, U. and Rüschendorf, L. (2001). The contraction method for recursive algorithms. Algorithmica 29 3–33.
• Steele, J. M. (1997). Probability Theory and Combinatorial Optimization. SIAM, Philadelphia, PA.
  Zentralblatt MATH: 0916.90233
  
• Talagrand, M. (2003). An assignment problem at high temperature. Ann. Probab. 31 818–848.
• Uchaikin, V. V. and Zolotarev, V. M. (1999). Chance and Stability. VSP, Utrecht.
  Zentralblatt MATH: 0944.60006