Course 4 Random matrices, the ulam problem, directed polymers & growth models, and sequence matching

@inproceedings{Majumdar2007Course4R,
  title={Course 4 Random matrices, the ulam problem, directed polymers & growth models, and sequence matching},
  author={S. Majumdar},
  year={2007}
}
  • S. Majumdar
  • Published 2007
  • Mathematics, Physics
  • Publisher Summary The chapter discusses the common aspects of four different problems. The following problems are: (1) random matrices; (2) the longest increasing subsequence (LIS) problem (also known as the Ulam problem after its discoverer); (3) directed polymers in random environment in (1 + 1) dimensions and related random growth models; and (4) the longest common subsequence (LCS) problem arising in matching of a pair of random sequences. They share one common limiting probability… CONTINUE READING

    Figures from this paper.

    The Kardar-Parisi-Zhang equation and universality class
    • 199
    • Open Access
    A pedestrian's view on interacting particle systems, KPZ universality, and random matrices
    • 124
    • Highly Influenced
    • Open Access
    Asymptotics of Tracy-Widom Distributions and the Total Integral of a Painlevé II Function
    • 113
    • Open Access
    Directed random polymers via nested contour integrals
    • 31
    • Open Access
    Exact Minimum Eigenvalue Distribution of an Entangled Random Pure State
    • 43
    • Open Access
    Marginally Stable Equilibria in Critical Ecosystems
    • 41
    • Open Access
    Living at the Edge: A Large Deviations Approach to the Outage MIMO Capacity
    • 39
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 200 REFERENCES
    J
    • 307,583
    • Open Access
    Basic local alignment search tool.
    • 70,568
    • Open Access
    Identification of common molecular subsequences.
    • 9,374
    • Open Access
    G
    • 154,341
    • Open Access
    Random Matrices
    • 2,828
    • Highly Influential
    • Open Access
    Dynamic scaling of growing interfaces.
    • 3,159
    • Open Access
    MATH
    • 10,635
    • Open Access