Indexed metadata
Phases in large combinatorial systems
Charles Radin
Source abstract
This is a status report on a companion subject to extremal combinatorics, obtained by replacing extremality properties with emergent structure, ‘phases’. We discuss phases, and phase transitions, in large graphs and large permutations, motivating and using the asymptotic formalisms of graphons for graphs and permutons for permutations. Phase structure is shown to emerge using entropy and large deviation techniques.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.