SearcharxivSearch

arXiv subjects

Aravinth Kulanthaivelu

Publications and source records attributed to Aravinth Kulanthaivelu.

3 recordsLinked to original sources

Agent-based models for the evolution of morphological alternation patterns

Why is the past of English "go" the apparently unrelated "went"? Such alternations are frequent in languages. They neither aid communication nor learnability, yet they can be persistent, surviving over centuries or millennia. We present a multi-agent simulation of the emergence of morphological stem and inflection alternations. Alternate forms arise by phonological changes or, as with "go/went", from lexical alternatives associated with a subset of the population. When an agent 'hears' another agent use a novel form for a slot in the paradigm of a word (say, the past tense of go), they will with some probability adopt that form, possibly spreading its use to other slots in the paradigm that shared the same original form. Thus alternative forms can spread through the population and become entrenched as stem or inflectional marker alternants. Unlike many previous computational studies, our system allows for naturalistic lexical forms, realistic phonological rules, lexicons with hundreds or thousands of entries, and agent populations in the tens or hundreds. It supports several network topologies, diffusion patterns and agent adoption policies. One issue with such simulations is evaluation: how realistic is the resulting morphology compared to those of real languages? We introduce the AI Historical Linguist, a novel Large Language Model-driven system that models a debate between two historical linguists. We use this to compare a set of real language morphologies, disguised morphologies, and experimentally evolved morphologies. The results suggest that among the factors that favor more plausible morphologies are scale-free social networks and random Bernoulli adoption of forms. We also present three case studies modeling attested historical changes, allowing us to test what might have happened if history had been different. All code and data are released.

cs.CL

Boundary Conditions and the q-state Potts model on Random Planar Maps

We extend a recent analysis of the $q$-states Potts model on an ensemble of random planar graphs with $p\leqslant q$ allowed, equally weighted, spins on a connected boundary. In this paper we explore the $(q<4,p\leqslant q)$ parameter space of finite-sheeted resolvents and derive the associated critical exponents. By definition a value of $q$ is allowed if there is a $p=1$ solution, and we reproduce the long-known result that $q= 2(1+\cos{\frac{m}{n} π})$ with $m,n$ coprime. In addition we find that there are two distinct sequences of solutions, one of which contains $p=2$ and $p=q/2$ while the other does not. The boundary condition $p=3$ appears only for $q=3$ which also has a $p=3/2$ boundary condition; we conjecture that this new solution corresponds in the scaling limit to the 'New' boundary condition, discovered on the flat lattice by Affleck et al. We also explore Kramers-Wannier duality for $q=3$ in this context and explicitly construct the known boundary conditions; we show that the mixed boundary condition is dual to a boundary condition on dual graphs that corresponds to Affleck et al's identification of the New boundary condition on fixed lattices. On the other hand we find that the mixed boundary condition of the dual, and the corresponding New boundary condition of the original theory are not described by conventional resolvents.

math-ph

Free Variable Loop Equations for the 3-State Potts Model Coupled to 2D Gravity

We revisit the long standing problem of the geometric free variable approach to computing the generating function for disk amplitudes in the matrix model formulation of the 3-state Potts model coupled to 2D discrete gravity. This method is a mild generalisation of Schwinger Dyson (loop-)equations approach, using graphical arguments to derive a single generating equation in non-commutative variables that contain the information of all loop equations. The method of constructing the generating equation is reviewed, we explain how a larger class of constraints than previously known can be constructed and we derive a closed set of equations that determine the spectral curve for the planar graph generating function.

math-ph