Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0701193

Random Matrices, the Ulam Problem, Directed Polymers & Growth Models, and Sequence Matching

Satya N. Majumdar
View original source ↗Read source document ↗Export metadata ↓

Abstract

In these lecture notes I will give a pedagogical introduction to some common aspects of 4 different problems: (i) random matrices (ii) the longest increasing subsequence problem (also known as the Ulam problem) (iii) directed polymers in random medium and growth models in (1+1) dimensions and (iv) a problem on the alignment of a pair of random sequences. Each of these problems is almost entirely a sub-field by itself and here I will discuss only some specific aspects of each of them. These 4 problems have been studied almost independently for the past few decades, but only over the last few years a common thread was found to link all of them. In particular all of them share one common limiting probability distribution known as the Tracy-Widom distribution that describes the asymptotic probability distribution of the largest eigenvalue of a random matrix. I will mention here, without mathematical derivation, some of the beautiful results discovered in the past few years. Then, I will consider two specific models (a) a ballistic deposition growth model and (b) a model of sequence alignment known as the Bernoulli matching model and discuss, in some detail, how one derives exactly the Tracy-Widom law in these models. The emphasis of these lectures would be on how to map one model to another. Some open problems are discussed at the end.

Explore related subjects

cond-mat.stat-mechcond-mat.dis-nnmath-phmath.MPmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Satya N. Majumdar. 2007-01-10. Random Matrices, the Ulam Problem, Directed Polymers & Growth Models, and Sequence Matching. https://arxiv.org/abs/cond-mat/0701193

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗