rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Discrete Probability and Algorithms
  name:
    name part: Aldous, D. J. (David J.)
    role:
      role term: creator
  name:
    name part: Diaconis, Persi.
  name:
    name part: Spencer, Joel.
  name:
    name part: Steele, J. Michael.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: nyu
    date issued: 1995
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (xvii, 158 pages)
  abstract: Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.
  table of contents: Foreword -- Preface -- On simulating a Markov chain stationary distribution when transition probabilities are unknown -- A note on network reliability -- Rectangular arrays with fixed margins -- Three examples of Monte-Carlo Markov chains: at the interface between statistical computing, computer science, and statistical mechanics -- The move-to-front rule for self-organizing lists with Markov dependent requests -- The asymptotic lower bound on the diagonal Ramsey numbers: A closer look -- Random walks and undirected graph connectivity: A survey -- Sidon sets with small gaps -- Variations on the monotone subsequence theme of Erdos and Szekeres -- Randomised approximation schemes for Tutte-Grothendieck invariants -- Quasi-additive Euclidean functionals.
  note: edited by David Aldous, Persi Diaconis, Joel Spencer, J. Michael Steele.
  note: Electronic resource.
  subject:
    topic: Mathematics
  subject:
    topic: Combinatorial analysis
  subject:
    topic: Distribution (Probability theory)
  subject:
    topic: Statistics
  subject:
    topic: Combinatorial analysis
  subject:
    topic: Distribution (Probability theory)
  subject:
    topic: Mathematics
  subject:
    topic: Statistics
  classification: QA164-167.2
  classification: 511.6
  related item:
    title info:
      title: IMA volumes in mathematics and its applications ; 72
  identifier: 9781461208013 (electronic bk.)
  identifier: 1461208017 (electronic bk.)
  identifier: 9781461269052
  identifier: 1461269059
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 121227
    record change date: 20260422171951.4
    record identifier: in00003573978
    language of cataloging:
      language term: eng