See this document in CiteSeerX!

The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence (2002)  (Make Corrections)  (2 citations)
David Aldous, J. Michael Steele



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~aldous/me101.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~aldous/bibliog (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Introduction This survey describes a general approach to a class of problems that arise in combinatorial probability and combinatorial optimization. Formally, the method is part of weak convergence theory, but in concrete problems the method has a flavor of its own. A characteristic element of the method is that it often calls for one to introduce a new, infinite, probabilistic object whose local properties inform us about the limiting properties of a sequence of finite problems. The name... (Update)

Context of citations to this paper:   More

...of it in the last few decades have proven that, it has enormous richness in its structure. For a careful survey and other related works see [8, 3]. Our interest in this problem is from another perspective. In 2001 Aldous [4] showed that E[A n ] #(2) 4) confirming the...

Cited by:   More
On the Average Case Behavior of the.. - Grundel.. (2004)   (Correct)
Bivariate Uniqueness in the Logistic Recursive Distributional.. - Bandyopadhyay (2002)   (Correct)

Active bibliography (related documents):   More   All
0.8:   The ζ(2) Limit in the Random Assignment Problem - Aldous (2000)   (Correct)
0.8:   Constructive Bounds and Exact Expectations for the Random.. - Coppersmith, Sorkin (1998)   (Correct)
0.6:   A central limit theorem with applications to percolation.. - Penrose (2001)   (Correct)

Similar documents based on text:   More   All
0.3:   Brownian Excursions, Critical Random Graphs and the.. - Aldous (1996)   (Correct)
0.3:   Hammersley's Interacting Particle Process and Longest.. - Aldous, Diaconis (1995)   (Correct)
0.3:   Inhomogeneous Continuum Random Trees and the Entrance.. - Aldous, Pitman (1998)   (Correct)

Related documents from co-citation:   More   All
2:   Asymptotics in the random assignment problem (context) - Aldous - 1992

BibTeX entry:   (Update)

David Aldous and J. Michael Steel. The Objective Method : Probabilistic Combinatoria Optimization and Local Weak Convergence. (in preparation), 2002. http://citeseer.ist.psu.edu/aldous02objective.html   More

@misc{ aldous02objective,
  author = "D. Aldous and J. Steel",
  title = "The Objective Method : Probabilistic Combinatoria Optimization and Local
    Weak Convergence",
  text = "David Aldous and J. Michael Steel. The Objective Method : Probabilistic
    Combinatoria Optimization and Local Weak Convergence. (in preparation),
    2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/aldous02objective.html" }
Citations (may not include all citations):
366   Markov Chains and Stochastic Stability - Meyn, Tweedie - 1993
283   Random Graphs (context) - Bollobas - 1985
91   Concentration of measure and isoperimetric inequalities in p.. - Talagrand - 1995
79   The Theory of Branching Processes (context) - Harris - 1989
61   The shortest path through many points (context) - Beardwood, Halton et al. - 1959
36   Kontaktprobleme der Konformen Abbildung (context) - Koebe - 1936
27   Branch and bound methods (context) - Balas, Toth - 1985
25   Probabilistic analysis of heuristics (context) - Karp, Steele - 1985
24   A patching algorithm for the non-symmetric traveling salesma.. (context) - Karp - 1979
22   Analysis of algorithms and data structures (context) - Vitter, Flajolet - 1990
21   Coupling from the past: a user's guide - Propp, Wilson - 1998
20   Mean-field critical behaviour for percolation in high dimens.. (context) - Hara, Slade - 1990
16   An upper bound on the expected cost of an optimal assignment (context) - Karp - 1987
16   Asymptotic fringe distributions for general families of rand.. (context) - Aldous - 1991
15   the value of a random minimum spanning tree problem (context) - Frieze - 1985
14   Asymptotics in the random assignment problem (context) - Aldous - 1992
14   Annals of Discrete Mathematics (context) - Lovasz, Plummer - 1986
14   Mean-field behaviour and the lace expansion (context) - Hara, Slade - 1994
13   Subadditive Euclidean functionals and non-linear growth in g.. (context) - Steele - 1981
12   A random tree model associated with random graphs (context) - Aldous - 1990
11   the solution of the random link matching problem (context) - Mezard, Parisi - 1987
10   Society for Industrial and Applied Mathematics (context) - Steele - 1997
10   Probability Theory of Classical Euclidean Optimization Probl.. (context) - Yukich - 1998
9   On linear programs with random costs (context) - Dyer, Frieze et al. - 1986
9   limit in the random assignment problem (context) - Aldous - 2001
8   Random labelled trees and their branching networks (context) - Grimmett - 1980
8   Branching processes and their application in the analysis of.. (context) - Devroye - 1998
7   Percolation and minimal spanning forest in infinite graphs (context) - Alexander - 1995
7   Asymptotics of Euclidean Minimal Spanning Trees on Random Sa.. (context) - Aldous, Steele - 1992
6   The central limit theorem for weighted minimal spanning tree.. (context) - Kesten, Lee - 1996
5   On nearest-neighbor graphs - Eppstein, Paterson et al. - 1997
4   The central limit theorem for Euclidean minimal spanning tre.. (context) - Lee - 1999
4   The central limit theorem for Euclidean minimal spanning tre.. (context) - Lee - 1997
4   The minimum spanning tree constant in geometric probability .. (context) - Avram, Bertsimas - 1992
3   Exact expectations and distributions for the random assigmne.. (context) - Alm, Sorkin - 2002
3   The probabilistic relationship between the assignment proble.. - Frieze, Sorkin - 2001
3   the number of leaves of a Euclidean minimal spanning tree (context) - Steele, Shepp et al. - 1987
3   the independence number of random cubic graphs - Frieze, Suen - 1994
3   On approximation methods for the assignment problem (context) - Kurtzberg - 1962
2   Weak laws of large numbers geometric probability (context) - Penrose, Yukich - 2002
1   the expected value of a random assigmnent problem (context) - Walkup - 1979
1   On random minimum lenght spanning trees (context) - Frieze, McDiarmid - 1989
1   Linear Phase Transition in Random Linear Constraint Satisfac.. (context) - Gamarnik
1   A Survey of Max-type Recursive Distributional Equations (context) - Aldous, Bandyopadhyay - 2002
1   Recurrence of distributional limits of finite planar graphs (context) - Benjamini, Schramm - 2001
1   Statistical mechanics perspective on the phase transition in.. - Hartmann, Weigt - 2001
1   Percolation and minimal spanning trees - Bezuidenhout, Grimmett et al. - 1998
1   and Schramm (context) - Angel - 2002
1   The proportion of triangles in a PoissonVoronoi tessellation.. - Hayen, Quine - 2000
1   The expected size of a random sphere of influence graph (context) - Furedi - 1995
1   the variance of the random sphere of influence graph (context) - Hitczenko, Janson et al. - 1999
1   Probabilistic analysis of a greedy heuristic for Euclidean m.. (context) - Avis, Davis et al. - 1988
1   the fraction of random points with specified nearest neighbo.. (context) - Henze - 1987
1   Optimal triangulation of random samples in the plane (context) - Steele - 1982
1   and Su (context) - Lee - 2001
1   Steinhaus' geometric location problem for random samples in .. (context) - Hochbaum, Steele - 1982
1   The asymptotic essential uniqueness property for minimal spa.. (context) - Aldous, Steele - 2002
1   Oxford Universtity Press (context) - Matousek, Nestril - 1998
1   Wiley Interscience Publishers (context) - Janson, Luczak - 2000
1   A conjecture on radom bipartite matching (context) - Parisi - 1998
1   limit for the lenths of minimal spanning trees (context) - Steele - 1987

Documents on the same site (http://www.stat.berkeley.edu/~aldous/bibliog.html):   More
The Percolation Process on a Tree Where Infinite Clusters are.. - Aldous (1999)   (Correct)
The Entrance Boundary of the Multiplicative Coalescent - Aldous, Limic (1998)   (Correct)
Hammersley's Interacting Particle Process and Longest.. - Aldous, Diaconis (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC