arXiv subjects

Mikhail V. Tamm

Publications and source records attributed to Mikhail V. Tamm.

13 recordsLinked to original sources

arXiv2025

Threshold model of language competition including the bilingual state

We propose a threshold model of language competition which includes intermediate bilingual state. The model is based on the Minett-Wang model but through the introduction of thresholds in the language shift rates it incorporates the effects of memory and learning. The model is piecewise-linear, allowing the exact analytical treatment. We study the symmetric case where two competing languages are equivalent in terms of status and social pressure and provide a complete list of the various dynamical regimes. We also study several limiting regimes corresponding to asymmetric systems and characterize the full spectrum of possible asymptotic behaviors. Unlike the Minett-Wang model, which always predicts the extinction of one of the languages, the proposed new model exhibits a wide range of possible equilibrium scenarios, including equilibrium states of coexistence. Most commonly, in such coexistence regimes the minority language speakers are either completely monolingual or completely bilingual.

physics.soc-ph↗

arXiv2025

Did smartphones break the world as we knew it?

I overview data on several radical societal changes started circa 2015: accelerated decline in fertility rate, backsliding of democracy, rise of populist politics and arrest in generational renewal of political leadership. I conjecture that all these processes have a common underlying cause: the spread of cheap and easy access to information due to wide spread of smartphones. I speculate about possible mechanisms connecting the observed changes with this underlying information revolution and discuss relevant historical parallels.

physics.soc-ph↗

arXiv2024

Learning thresholds lead to stable language coexistence

We introduce a language competition model that is based on the Abrams-Strogatz model and incorporates the effects of memory and learning in the language shift dynamics. On a coarse grained time scale, the effects of memory and learning can be expressed as thresholds on the speakers fractions of the competing languages. In its simplest form, the resulting model is exactly solvable. Besides the consensus on one of the two languages, the model describes additional equilibrium states that are not present in the Abrams-Strogatz model: a stable dynamical coexistence of the two languages and a frozen state coinciding with the initial state. We show numerically that these results are preserved for threshold functions of a more general shape. The comparison of the model predictions with historical datasets demonstrates that while the Abrams-Strogatz model fails to describe some relevant language competition situations, the proposed model provides a good fitting.

physics.soc-ph↗

arXiv2023

Path Counting on Tree-like Graphs with a Single Entropic Trap: Critical Behavior and Finite Size Effects

It is known that maximal entropy random walks and partition functions that count long paths on graphs tend to become localized near nodes with a high degree. Here, we revisit the simplest toy model of such a localization: a regular tree of degree $p$ with one special node ("root") that has a degree different from all the others. We present an in-depth study of the path-counting problem precisely at the localization transition. We study paths that start from the root in both infinite trees and finite, locally tree-like regular random graphs (RRGs). For the infinite tree, we prove that the probability distribution function of the endpoints of the path is a step function. The position of the step moves away from the root at a constant velocity $v=(p-2)/p$. We find the width and asymptotic shape of the distribution in the vicinity of the shock. For a finite RRG, we show that a critical slowdown takes place, and the trajectory length needed to reach the equilibrium distribution is on the order of $\sqrt{N}$ instead of $\log_{p-1}N$ away from the transition. We calculate the exact values of the equilibrium distribution and relaxation length, as well as the shapes of slowly relaxing modes.

cond-mat.stat-mech↗

arXiv2022

Counting Phases and Faces Using Bayesian Thermodynamic Integration

We introduce a new approach to reconstruction of the thermodynamic functions and phase boundaries in two-parametric statistical mechanics systems. Our method is based on expressing the Fisher metric in terms of the posterior distributions over a space of external parameters and approximating the metric field by a Hessian of a convex function. We use the proposed approach to accurately reconstruct the partition functions and phase diagrams of the Ising model and the exactly solvable non-equilibrium TASEP without any a priori knowledge about microscopic rules of the models. We also demonstrate how our approach can be used to visualize the latent space of StyleGAN models and evaluate the variability of the generated images.

cond-mat.stat-mech↗

arXiv2022

From steady-state TASEP model with open boundaries to 1D Ising model at negative fugacity

We demonstrate here a series of exact mappings between particular cases of four statistical physics models: equilibrium 1-dimensional lattice gas with nearest-neighbor repulsion, $(1+1)$-dimensional combinatorial heap of pieces, random walks on half-plane and totally asymmetric simple exclusion process (TASEP) in one dimension (1D). In particular, we show that generating function of a steady state of one-dimensional TASEP with open boundaries can be interpreted as a quotient of partition functions of 1D hard-core lattice gases with one adsorbing lattice site and negative fugacity. This result is based on the combination of (i) a representation of the steady-state TASEP configurations in terms of $(1+1)$-dimensional heaps of pieces and (ii) a theorem connecting the partition function of $(1+1)$-dimensional heaps of pieces with that of a single layer of pieces, which in this case is a 1D hard-core lattice gas.

cond-mat.stat-mech↗

arXiv2017

Dynamics of polymers: classic results and recent developments

In this chapter we review concepts and theories of polymer dynamics. We think of it as an introduction to the topic for scientists specializing in other subfields of statistical mechanics and condensed matter theory, so, for the readers reference, we start with a short review of the equilibrium static properties of polymer systems. Most attention is paid to the dynamics of unentangled polymer systems, where apart from classical Rouse and Zimm models we review some recent scaling and analytical generalizations. The dynamics of systems with entanglements is also briefly reviewed. Special attention is paid to the discussion of comparatively weakly understood topological states of polymer systems and possible approaches to the description of their dynamics.

cond-mat.soft↗

arXiv2016

Anomalous diffusion in fractal globules

The fractal globule state is a popular model for describing chromatin packing in eukaryotic nuclei. Here we provide a scaling theory and dissipative particle dynamics (DPD) computer simulation for the thermal motion of monomers in the fractal globule state. Simulations starting from different entanglement-free initial states show good convergence which provides evidence supporting the existence of unique metastable fractal globule state. We show monomer motion in this state to be sub-diffusive described by $\langle X^2 (t)\rangle \sim t^{α_F}$ with $α_F$ close to 0.4. This result is in good agreement with existing experimental data on the chromatin dynamics which makes an additional argument in support of the fractal globule model of chromatin packing.

cond-mat.soft↗

arXiv2016

Towards a robust algorithm to determine topological domains from colocalization data

One of the most important tasks in understanding the complex spatial organization of the genome consists in extracting information about this spatial organization, the function and structure of chromatin topological domains from existing experimental data, in particular, from genome colocalization (Hi-C) matrices. Here we present an algorithm allowing to reveal the underlying hierarchical domain structure of a polymer conformation from analyzing the modularity of colocalization matrices. We also test this algorithm on several model polymer structures: equilibrium globules, random fractal globules and regular fractal (Peano) conformations. We define what we call a spectrum of cluster borders, and show that these spectra behave strikingly differently for equilibrium and fractal conformations, allowing us to suggest an additional criterion to identify fractal polymer conformations.

physics.bio-ph↗

arXiv2014

Topological transition in disordered planar matching: combinatorial arcs expansion

In this paper, we investigate analytically the properties of the disordered Bernoulli model of planar matching. This model is characterized by a topological phase transition, yielding complete planar matching solutions only above a critical density threshold. We develop a combinatorial procedure of arcs expansion that explicitly takes into account the contribution of short arcs, and allows to obtain an accurate analytical estimation of the critical value by reducing the global constrained problem to a set of local ones. As an application to a toy representation of the RNA secondary structures, we suggest generalized models that incorporate a one-to-one correspondence between the contact matrix and the RNA-type sequence, thus giving sense to the notion of effective non-integer alphabets.

cond-mat.stat-mech↗

arXiv2014

Overlap of two Brownian trajectories: exact results for scaling functions

We consider two random walkers starting at the same time $t=0$ from different points in space separated by a given distance $R$. We compute the average volume of the space visited by both walkers up to time $t$ as a function of $R$ and $t$ and dimensionality of space $d$. For $d<4$, this volume, after proper renormalization, is shown to be expressed through a scaling function of a single variable $R/\sqrt{t}$. We provide general integral formulas for scaling functions for arbitrary dimensionality $d<4$. In contrast, we show that no scaling function exists for higher dimensionalities $d \geq 4$

math-ph↗

arXiv2013

New phase transition in random planar diagrams and RNA-type matching

We study the planar matching problem, defined by a symmetric random matrix with independent identically distributed entries, taking values 0 and 1. We show that the existence of a perfect planar matching structure is possible only above a certain critical density, $p_{c}$, of allowed contacts (i.e. of '1'). Using a formulation of the problem in terms of Dyck paths and a matrix model of planar contact structures, we provide an analytical estimation for the value of the transition point, $p_{c}$, in the thermodynamic limit. This estimation is close to the critical value, $p_{c} \approx 0.379$, obtained in numerical simulations based on an exact dynamical programming algorithm. We characterize the corresponding critical behavior of the model and discuss the relation of the perfect-imperfect matching transition to the known molten-glass transition in the context of random RNA secondary structure's formation. In particular, we provide strong evidence supporting the conjecture that the molten-glass transition at T=0 occurs at $p_{c}$.

cond-mat.stat-mech↗

arXiv2012

Number of Common Sites Visited by N Random Walkers

We compute analytically the mean number of common sites, W_N(t), visited by N independent random walkers each of length t and all starting at the origin at t=0 in d dimensions. We show that in the (N-d) plane, there are three distinct regimes for the asymptotic large t growth of W_N(t). These three regimes are separated by two critical lines d=2 and d=d_c(N)=2N/(N-1) in the (N-d) plane. For d<2, W_N(t)\sim t^{d/2} for large t (the N dependence is only in the prefactor). For 2 d_c(N), W_N(t) approaches a constant as t\to \infty. Exactly at the critical dimensions there are logaritmic corrections: for d=2, we get W_N(t)\sim t/[\ln t]^N, while for d=d_c(N), W_N(t)\sim \ln t for large t. Our analytical predictions are verified in numerical simulations.

cond-mat.stat-mech↗