Mohammad Sharifi Kiasari

arXiv2026

Vertex misalignment and changepoint localization in network time series

Inference for time series of networks often relies on accurate vertex correspondence between network realizations at different times. In practice, such vertex alignments can be misspecified or unknown. We study the impact of errorful vertex alignment on changepoint localization for dynamic networks through two illustrative models, with the key distinction being whether changepoint information is contained in marginal or joint distributions of the time-varying latent positions. We compare localization techniques ranging from the simple network statistic of average degree to the modern procedure of Euclidean mirrors. Our results demonstrate that understanding the interplay of marginal and joint information in the observed network time series is key to robust network inference.

math.ST↗

arXiv2026

Gaussian mixture models as a proxy for interacting language models

Large language models (LLMs) are powerful tools that, in a number of settings, overlap with the results of human pattern recognition and reasoning. Retrieval-augmented generation (RAG) further allows LLMs to produce tailored output depending on the contents of their RAG databases. However, LLMs depend on complex, computationally expensive algorithms. In this paper, we introduce interacting Gaussian mixture models (GMMs) as a proxy for interacting LLMs. We construct a model of interacting GMMs, complete with an analogue to RAG updating, under which GMMs can generate, exchange, and update data and parameters. We show that this interacting system of Gaussian mixture models, which can be implemented at minimal computational cost, mimics certain aspects of experimental simulations of interacting LLMs whose iterative responses depend on feedback from other LLMs. We build a Markov chain from this system of interacting GMMs; formalize and interpret the notion of polarization for such a chain; and prove lower bounds on the probability of polarization. This provides theoretical insight into the use of interacting Gaussian mixture models as a computationally efficient proxy for interacting large language models.

cs.CL↗