Searcharxiv⌕ Search

arXiv subjects

Marco Cosentino Lagomarsino

Publications and source records attributed to Marco Cosentino Lagomarsino.

At least 19 recordsLinked to original sources

Alternative routes to universal diversity scaling in component systems: from proteomes to large language models

Remarkably common statistical laws characterize the diversity scaling and its fluctuations across a wide range of complex "component systems". These regularities are often interpreted as signatures of an underlying innovation mechanism driving the growth of component diversity, but the basic ingredients necessary for their emergence remain poorly understood. In particular, from language and technological artifacts to genomes and gene expression patterns, the number of distinct components grows sublinearly with system size, while its variance scales approximately as the square of its mean. This behavior is consistent across diverse systems, raising the question of whether general constraints or emergent principles underlying diversity and innovation define the architectures of realizations with different numbers of components. To address this question, we derive analytical conditions for the joint emergence of these two diversity laws within a broad class of growth models, showing that they require a specific asymptotic dependence of the innovation probability on diversity and system size. We then demonstrate that the same macroscopic laws arise in a different class of models with latent heterogeneity, where quadratic fluctuation scaling always emerges asymptotically as a consequence of general statistical principles, essentially the law of total variance, without explicitly assuming an innovation mechanism or any specific rule for system assembly. We compare these predictions with empirical data from language, genomes, LEGO constructions, and texts generated by large language models. Our results show that empirical diversity scaling laws strongly constrain generative models but do not uniquely identify the mechanisms generating diversity, revealing a close correspondence between innovation-driven growth models and latent-variable descriptions.

cond-mat.stat-mech↗

Essential Role of Extrinsic Noise in Models of E. coli Division Control

Our understanding of cell division control in bacteria still relies largely on interpreting correlations between phenomenological variables, with limited connection to the underlying molecular mechanisms. Here, we analytically solve a stochastic threshold-accumulation model in which a size-dependent divisor protein triggers division upon reaching a noisy, autocorrelated threshold, quantifying within a unified framework the combined effects of intrinsic and extrinsic noise and key mechanistic parameters such as protein reset and threshold memory. We show that incorporating these elements yields behavior far richer than the commonly assumed adder, spanning a continuum of division strategies from timer to sizer while modulating size fluctuations in a nontrivial fashion. Comparison with single-cell E. coli data shows that extrinsic noise and additional mechanistic ingredients are required to account for the observed size fluctuations. The adder emerges when threshold correlations balance protein reset, generalizing the hypothesis that full reset is necessary to maintain adder control. Our results establish a unified analytical framework linking stochastic molecular processes to emergent division laws, to be used in more complex bacterial cell-cycle models.

q-bio.CB↗

The Hands-On Growth Laws Theory Cookbook

This tutorial covers the emerging field of coarse-grained cellular growth modeling, and aims to bridge the gap between theoretical foundations and practical application. By adopting an original "cookbook" approach, it is designed to offer a hands-on guide for constructing and analyzing different key aspects of cellular growth, focusing on available results for bacteria and beyond. The tutorial is structured as a series of step-by-step "recipes", and covers essential concepts, recent literature, and key challenges. It aims to empower a broad audience, from students to seasoned researchers, to replicate, extend, and innovate in this scientific area. Specifically, each section provides detailed, bare-bone models to start working in each area, from basic steady-state growth to variable environments and focusing on different key layers relevant to biosynthesis, transcription, translation, nutrient sensing and protein degradation, links between cell cycle and growth, ending with ecological insights.

q-bio.OT↗

Remote teaching data-driven physical modeling through a COVID-19 open ended data challenge

Physics can be seen as a conceptual approach to scientific problems, a method for discovery, but teaching this aspect of our discipline can be a challenge. We report on a first-time remote teaching experience for a computational physics third-year physics laboratory class taught in the first part of the 2020 COVID-19 pandemic (March-May 2020). To convey a ``physics of data" approach to data analysis and data-driven physical modeling we used interdisciplinary data sources, with an openended ``COVID-19 data challenge" project as the core of the course. COVID-19 epidemiological data provided an ideal setting for motivating the students to deal with complex problems, where there is no unique or preconceived solution. Our results indicate that such problems yield qualitatively different improvements compared to close-ended projects, as well as point to critical aspects in using these problems as a teaching strategy. By breaking the students' expectations of unidirectionality, remote teaching provided unexpected opportunities to promote active work and active learning.

physics.ed-ph↗

Counting the learnable functions of structured data

Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be linearly realized. Regrettably, it has proved hard to extend the same approach to more advanced problems than the classification of points. In particular, an emerging necessity is to find methods to deal with structured data, and specifically with non-pointlike patterns. A prominent case is that of invariant recognition, whereby identification of a stimulus is insensitive to irrelevant transformations on the inputs (such as rotations or changes in perspective in an image). An object is therefore represented by an extended perceptual manifold, consisting of inputs that are classified similarly. Here, we develop a function counting theory for structured data of this kind, by extending Cover's combinatorial technique, and we derive analytical expressions for the average number of dichotomies of generically correlated sets of patterns. As an application, we obtain a closed formula for the capacity of a binary classifier trained to distinguish general polytopes of any dimension. These results may help extend our theoretical understanding of generalization, feature extraction, and invariant object recognition by neural networks.

cond-mat.dis-nn↗

Generalization from correlated sets of patterns in the perceptron

Generalization is a central aspect of learning theory. Here, we propose a framework that explores an auxiliary task-dependent notion of generalization, and attempts to quantitatively answer the following question: given two sets of patterns with a given degree of dissimilarity, how easily will a network be able to "unify" their interpretation? This is quantified by the volume of the configurations of synaptic weights that classify the two sets in a similar manner. To show the applicability of our idea in a concrete setting, we compute this quantity for the perceptron, a simple binary classifier, using the classical statistical physics approach in the replica-symmetric ansatz. In this case, we show how an analytical expression measures the "distance-based capacity", the maximum load of patterns sustainable by the network, at fixed dissimilarity between patterns and fixed allowed number of errors. This curve indicates that generalization is possible at any distance, but with decreasing capacity. We propose that a distance-based definition of generalization may be useful in numerical experiments with real-world neural networks, and to explore computationally sub-dominant sets of synaptic solutions.

cond-mat.dis-nn↗

A network model of conviction-driven social segregation

In order to measure, predict, and prevent social segregation, it is necessary to understand the factors that cause it. While in most available descriptions space plays an essential role, one outstanding question is whether and how this phenomenon is possible in a well-mixed social network. We define and solve a simple model of segregation on networks based on discrete convictions. In our model, space does not play a role, and individuals never change their conviction, but they may choose to connect socially to other individuals based on two criteria: sharing the same conviction, and individual popularity (regardless of conviction). The trade-off between these two moves defines a parameter, analogous to the "tolerance" parameter in classical models of spatial segregation. We show numerically and analytically that this parameter determines a true phase transition (somewhat reminiscent of phase separation in a binary mixture) between a well-mixed and a segregated state. Additionally, minority convictions segregate faster and inter-specific aversion alone may lead to a segregation threshold with similar properties. Together, our results highlight the general principle that a segregation transition is possible in absence of spatial degrees of freedom, provided that conviction-based rewiring occurs on the same time scale of popularity rewirings.

physics.soc-ph↗

Statistics of shared components in complex component systems

Many complex systems are modular. Such systems can be represented as "component systems", i.e., sets of elementary components, such as LEGO bricks in LEGO sets. The bricks found in a LEGO set reflect a target architecture, which can be built following a set-specific list of instructions. In other component systems, instead, the underlying functional design and constraints are not obvious a priori, and their detection is often a challenge of both scientific and practical importance, requiring a clear understanding of component statistics. Importantly, some quantitative invariants appear to be common to many component systems, most notably a common broad distribution of component abundances, which often resembles the well-known Zipf's law. Such "laws" affect in a general and non-trivial way the component statistics, potentially hindering the identification of system-specific functional constraints or generative processes. Here, we specifically focus on the statistics of shared components, i.e., the distribution of the number of components shared by different system-realizations, such as the common bricks found in different LEGO sets. To account for the effects of component heterogeneity, we consider a simple null model, which builds system-realizations by random draws from a universe of possible components. Under general assumptions on abundance heterogeneity, we provide analytical estimates of component occurrence, which quantify exhaustively the statistics of shared components. Surprisingly, this simple null model can positively explain important features of empirical component-occurrence distributions obtained from data on bacterial genomes, LEGO sets, and book chapters. Specific architectural features and functional constraints can be detected from occurrence patterns as deviations from these null predictions, as we show for the illustrative case of the "core" genome in bacteria.

q-bio.GN↗

Spontaneous domain formation in disordered copolymers as a mechanism for chromosome structuring

Motivated by the problem of domain formation in chromosomes, we studied a co--polymer model where only a subset of the monomers feel attractive interactions. These monomers are displaced randomly from a regularly-spaced pattern, thus introducing some quenched disorder in the system. Previous work has shown that in the case of regularly-spaced interacting monomers this chain can fold into structures characterized by multiple distinct domains of consecutive segments. In each domain, attractive interactions are balanced by the entropy cost of forming loops. We show by advanced replica-exchange simulations that adding disorder in the position of the interacting monomers further stabilizes these domains. The model suggests that the partitioning of the chain into well-defined domains of consecutive monomers is a spontaneous property of heteropolymers. In the case of chromosomes, evolution could have acted on the spacing of interacting monomers to modulate in a simple way the underlying domains for functional reasons.

q-bio.BM↗

Zipf and Heaps laws from dependency structures in component systems

Complex natural and technological systems can be considered, on a coarse-grained level, as assemblies of elementary components: for example, genomes as sets of genes, or texts as sets of words. On one hand, the joint occurrence of components emerges from architectural and specific constraints in such systems. On the other hand, general regularities may unify different systems, such as the broadly studied Zipf and Heaps laws, respectively concerning the distribution of component frequencies and their number as a function of system size. Dependency structures (i.e., directed networks encoding the dependency relations between the components in a system) were proposed recently as a possible organizing principles underlying some of the regularities observed. However, the consequences of this assumption were explored only in binary component systems, where solely the presence or absence of components is considered, and multiple copies of the same component are not allowed. Here, we consider a simple model that generates, from a given ensemble of dependency structures, a statistical ensemble of sets of components, allowing for components to appear with any multiplicity. Our model is a minimal extension that is memoryless, and therefore accessible to analytical calculations. A mean-field analytical approach (analogous to the "Zipfian ensemble" in the linguistics literature) captures the relevant laws describing the component statistics as we show by comparison with numerical computations. In particular, we recover a power-law Zipf rank plot, with a set of core components, and a Heaps law displaying three consecutive regimes (linear, sub-linear and saturating) that we characterize quantitatively.

physics.soc-ph↗

Intermittent transport of bacterial chromosomal loci

The short-time dynamics of bacterial chromosomal loci is a mixture of subdiffusive and active motion, in the form of rapid relocations with near-ballistic dynamics. While previous work has shown that such rapid motions are ubiquitous, we still have little grasp on their physical nature, and no positive model is available that describes them. Here, we propose a minimal theoretical model for loci movements as a fractional Brownian motion subject to a constant but intermittent driving force, and compare simulations and analytical calculations to data from high-resolution dynamic tracking in E. coli. This analysis yields the characteristic time scales for intermittency. Finally, we discuss the possible shortcomings of this model, and show that an increase in the effective local noise felt by the chromosome associates to the active relocations.

cond-mat.soft↗

Current quantization and fractal hierarchy in a driven repulsive lattice gas

Driven lattice gases are widely regarded as the paradigm of collective phenomena out of equilibrium. While such models are usually studied with nearest-neighbor interactions, many empirical driven systems are dominated by slowly decaying interactions such as dipole-dipole and Van der Waals forces. Motivated by this gap, we study the non-equilibrium stationary state of a driven lattice gas with slow-decayed repulsive interactions at zero temperature. By numerical and analytical calculations of the particle current as a function of the density and of the driving field, we identify (i) an abrupt breakdown transition between insulating and conducting states, (ii) current quantization into discrete phases where a finite current flows with infinite differential resistivity, and (iii) a fractal hierarchy of excitations, related to the Farey sequences of number theory. We argue that the origin of these effects is the competition between scales, which also causes the counterintuitive phenomenon that crystalline states can melt by increasing the density.

cond-mat.stat-mech↗

Cell-to-cell variability and robustness in S-phase duration from genome replication kinetics

Genome replication, a key process for a cell, relies on stochastic initiation by replication origins, causing a variability of replication timing from cell to cell. While stochastic models of eukaryotic replication are widely available, the link between the key parameters and overall replication timing has not been addressed systematically.We use a combined analytical and computational approach to calculate how positions and strength of many origins lead to a given cell-to-cell variability of total duration of the replication of a large region, a chromosome or the entire genome.Specifically, the total replication timing can be framed as an extreme-value problem, since it is due to the last region that replicates in each cell. Our calculations identify two regimes based on the spread between characteristic completion times of all inter-origin regions of a genome. For widely different completion times, timing is set by the single specific region that is typically the last to replicate in all cells. Conversely, when the completion time of all regions are comparable,an extreme-value estimate shows that the cell-to-cell variability of genome replication timing has universal properties. Comparison with available data shows that the replication program of three yeast species falls in this extreme-value regime.

q-bio.GN↗

Family-specific scaling laws in bacterial genomes

Among several quantitative invariants found in evolutionary genomics, one of the most striking is the scaling of the overall abundance of proteins, or protein domains, sharing a specific functional annotation across genomes of given size. The size of these functional categories change, on average, as power-laws in the total number of protein-coding genes. Here, we show that such regularities are not restricted to the overall behavior of high-level functional categories, but also exist systematically at the level of single evolutionary families of protein domains. Specifically, the number of proteins within each family follows family-specific scaling laws with genome size. Functionally similar sets of families tend to follow similar scaling laws, but this is not always the case. To understand this systematically, we provide a comprehensive classification of families based on their scaling properties. Additionally, we develop a quantitative score for the heterogeneity of the scaling of families belonging to a given category or predefined group. Under the common reasonable assumption that selection is driven solely or mainly by biological function, these findings point to fine-tuned and interdependent functional roles of specific protein domains, beyond our current functional annotations. This analysis provides a deeper view on the links between evolutionary expansion of protein families and the functional constraints shaping the gene repertoire of bacterial genomes.

q-bio.GN↗

Stochastic timing in gene expression for simple regulatory strategies

Timing is essential for many cellular processes, from cellular responses to external stimuli to the cell cycle and circadian clocks. Many of these processes are based on gene expression. For example, an activated gene may be required to reach in a precise time a threshold level of expression that triggers a specific downstream process. However, gene expression is subject to stochastic fluctuations, naturally inducing an uncertainty in this threshold-crossing time with potential consequences on biological functions and phenotypes. Here, we consider such "timing fluctuations", and we ask how they can be controlled. Our analytical estimates and simulations show that, for an induced gene, timing variability is minimal if the threshold level of expression is approximately half of the steady-state level. Timing fuctuations can be reduced by increasing the transcription rate, while they are insensitive to the translation rate. In presence of self-regulatory strategies, we show that self-repression reduces timing noise for threshold levels that have to be reached quickly, while selfactivation is optimal at long times. These results lay a framework for understanding stochasticity of endogenous systems such as the cell cycle, as well as for the design of synthetic trigger circuits.

q-bio.MN↗

Relevant parameters in models of cell division control

A recent burst of dynamic single-cell growth-division data makes it possible to characterize the stochastic dynamics of cell division control in bacteria. Different modeling frameworks were used to infer specific mechanisms from such data, but the links between frameworks are poorly explored, with relevant consequences for how well any particular mechanism can be supported by the data. Here, we describe a simple and generic framework in which two common formalisms can be used interchangeably: (i) a continuous-time division process described by a hazard function and (ii) a discrete-time equation describing cell size across generations (where the unit of time is a cell cycle). In our framework, this second process is a discrete-time Langevin equation with a simple physical analogue. By perturbative expansion around the mean initial size (or inter-division time), we show explicitly how this framework describes a wide range of division control mechanisms, including combinations of time and size control, as well as the constant added size mechanism recently found to capture several aspects of the cell division behavior of different bacteria. As we show by analytical estimates and numerical simulation, the available data are characterized with great precision by the first-order approximation of this expansion. Hence, a single dimensionless parameter defines the strength and the action of the division control. However, this parameter may emerge from several mechanisms, which are distinguished only by higher-order terms in our perturbative expansion. An analytical estimate of the sample size needed to distinguish between second-order effects shows that this is larger than what is available in the current datasets. These results provide a unified framework for future studies and clarify the relevant parameters at play in the control of cell division.

q-bio.CB↗

Individuality and universality in the growth-division laws of single E. coli cells

The mean size of exponentially dividing E. coli cells cultured in different nutrient conditions is known to depend on the mean growth rate only. However, the joint fluctuations relating cell size, doubling time and individual growth rate are only starting to be characterized. Recent studies in bacteria (i) revealed the near constancy of the size extension in a single cell cycle (adder mechanism), and (ii) reported a universal trend where the spread in both size and doubling times is a linear function of the population means of these variables. Here, we combine experiments and theory and use scaling concepts to elucidate the constraints posed by the second observation on the division control mechanism and on the joint fluctuations of sizes and doubling times. We found that scaling relations based on the means both collapse size and doubling-time distributions across different conditions, and explain how the shape of their joint fluctuations deviates from the means. Our data on these joint fluctuations highlight the importance of cell individuality: single cells do not follow the dependence observed for the means between size and either growth rate or inverse doubling time. Our calculations show that these results emerge from a broad class of division control mechanisms (including the adder mechanism as a particular case) requiring a certain scaling form of the so-called "division hazard rate function", which defines the probability rate of dividing as a function of measurable parameters. This gives a rationale for the universal body-size distributions observed in microbial ecosystems across many microbial species, presumably dividing with multiple mechanisms. Additionally, our experiments show a crossover between fast and slow growth in the relation between individual-cell growth rate and division time, which can be understood in terms of different regimes of genome replication control.

q-bio.CB↗

Dicke simulators with emergent collective quantum computational abilities

Using an approach inspired from Spin Glasses, we show that the multimode disordered Dicke model is equivalent to a quantum Hopfield network. We propose variational ground states for the system at zero temperature, which we conjecture to be exact in the thermodynamic limit. These ground states contain the information on the disordered qubit-photon couplings. These results lead to two intriguing physical implications. First, once the qubit-photon couplings can be engineered, it should be possible to build scalable pattern-storing systems whose dynamics is governed by quantum laws. Second, we argue with an example how such Dicke quantum simulators might be used as a solver of "hard" combinatorial optimization problems.

cond-mat.dis-nn↗