Searcharxiv⌕ Search

arXiv subjects

Adriano Barra

Publications and source records attributed to Adriano Barra.

At least 73 records · Page 4Linked to original sources

Notes on stochastic (bio)-logic gates: the role of allosteric cooperativity

Recent experimental breakthroughs have finally allowed to implement in-vitro reaction kinetics (the so called {\em enzyme based logic}) which code for two-inputs logic gates and mimic the stochastic AND (and NAND) as well as the stochastic OR (and NOR). This accomplishment, together with the already-known single-input gates (performing as YES and NOT), provides a logic base and paves the way to the development of powerful biotechnological devices. The investigation of this field would enormously benefit from a self-consistent, predictive, theoretical framework. Here we formulate a complete statistical mechanical description of the Monod-Wyman-Changeaux allosteric model for both single and double ligand systems, with the purpose of exploring their practical capabilities to express logical operators and/or perform logical operations. Mixing statistical mechanics with logics, and quantitatively our findings with the available biochemical data, we successfully revise the concept of cooperativity (and anti-cooperativity) for allosteric systems, with particular emphasis on its computational capabilities, the related ranges and scaling of the involved parameters and its differences with classical cooperativity (and anti-cooperativity).

cond-mat.dis-nn↗

Hierarchical neural networks perform both serial and parallel processing

In this work we study a Hebbian neural network, where neurons are arranged according to a hierarchical architecture such that their couplings scale with their reciprocal distance. As a full statistical mechanics solution is not yet available, after a streamlined introduction to the state of the art via that route, the problem is consistently approached through signal- to-noise technique and extensive numerical simulations. Focusing on the low-storage regime, where the amount of stored patterns grows at most logarithmical with the system size, we prove that these non-mean-field Hopfield-like networks display a richer phase diagram than their classical counterparts. In particular, these networks are able to perform serial processing (i.e. retrieve one pattern at a time through a complete rearrangement of the whole ensemble of neurons) as well as parallel processing (i.e. retrieve several patterns simultaneously, delegating the management of diff erent patterns to diverse communities that build network). The tune between the two regimes is given by the rate of the coupling decay and by the level of noise affecting the system. The price to pay for those remarkable capabilities lies in a network's capacity smaller than the mean field counterpart, thus yielding a new budget principle: the wider the multitasking capabilities, the lower the network load and viceversa. This may have important implications in our understanding of biological complexity.

cond-mat.dis-nn↗

A walk in the statistical mechanical formulation of neural networks

Neural networks are nowadays both powerful operational tools (e.g., for pattern recognition, data mining, error correction codes) and complex theoretical models on the focus of scientific investigation. As for the research branch, neural networks are handled and studied by psychologists, neurobiologists, engineers, mathematicians and theoretical physicists. In particular, in theoretical physics, the key instrument for the quantitative analysis of neural networks is statistical mechanics. From this perspective, here, we first review attractor networks: starting from ferromagnets and spin-glass models, we discuss the underlying philosophy and we recover the strand paved by Hopfield, Amit-Gutfreund-Sompolinky. One step forward, we highlight the structural equivalence between Hopfield networks (modeling retrieval) and Boltzmann machines (modeling learning), hence realizing a deep bridge linking two inseparable aspects of biological and robotic spontaneous cognition. As a sideline, in this walk we derive two alternative (with respect to the original Hebb proposal) ways to recover the Hebbian paradigm, stemming from ferromagnets and from spin-glasses, respectively. Further, as these notes are thought of for an Engineering audience, we highlight also the mappings between ferromagnets and operational amplifiers and between antiferromagnets and flip-flops (as neural networks -built by op-amp and flip-flops- are particular spin-glasses and the latter are indeed combinations of ferromagnets and antiferromagnets), hoping that such a bridge plays as a concrete prescription to capture the beauty of robotics from the statistical mechanical perspective.

cond-mat.dis-nn↗

Meta-stable states in the hierarchical Dyson model drive parallel processing in the hierarchical Hopfield network

In this paper we introduce and investigate the statistical mechanics of hierarchical neural networks: First, we approach these systems à la Mattis, by thinking at the Dyson model as a single-pattern hierarchical neural network and we discuss the stability of different retrievable states as predicted by the related self-consistencies obtained from a mean-field bound and from a bound that bypasses the mean-field limitation. The latter is worked out by properly reabsorbing fluctuations of the magnetization related to higher levels of the hierarchy into effective fields for the lower levels. Remarkably, mixing Amit's ansatz technique (to select candidate retrievable states) with the interpolation procedure (to solve for the free energy of these states) we prove that (due to gauge symmetry) the Dyson model accomplishes both serial and parallel processing. One step forward, we extend this scenario toward multiple stored patterns by implementing the Hebb prescription for learning within the couplings. This results in an Hopfield-like networks constrained on a hierarchical topology, for which, restricting to the low storage regime (where the number of patterns grows at most logarithmical with the amount of neurons), we prove the existence of the thermodynamic limit for the free energy and we give an explicit expression of its mean field bound and of the related improved bound

cond-mat.dis-nn↗

From Dyson to Hopfield: Processing on hierarchical networks

We consider statistical-mechanical models for spin systems built on hierarchical structures, which provide a simple example of non-mean-field framework. We show that the coupling decay with spin distance can give rise to peculiar features and phase diagrams much richer that their mean-field counterpart. In particular, we consider the Dyson model, mimicking ferromagnetism in lattices, and we prove the existence of a number of meta-stabilities, beyond the ordered state, which get stable in the thermodynamic limit. Such a feature is retained when the hierarchical structure is coupled with the Hebb rule for learning, hence mimicking the modular architecture of neurons, and gives rise to an associative network able to perform both as a serial processor as well as a parallel processor, depending crucially on the external stimuli and on the rate of interaction decay with distance; however, those emergent multitasking features reduce the network capacity with respect to the mean-field counterpart. The analysis is accomplished through statistical mechanics, graph theory, signal-to-noise technique and numerical simulations in full consistency. Our results shed light on the biological complexity shown by real networks, and suggest future directions for understanding more realistic models.

cond-mat.dis-nn↗

A stochastic approach for quantifying immigrant integration: the Spanish test case

We apply stochastic process theory to the analysis of immigrant integration. Using a unique and detailed data set from Spain, we study the relationship between local immigrant density and two social and two economic immigration quantifiers for the period 1999-2010. As opposed to the classic time-series approach, by letting immigrant density play the role of "time", and the quantifier the role of "space" it become possible to analyze the behavior of the quantifiers by means of continuous time random walks. Two classes of results are obtained. First we show that social integration quantifiers evolve following pure diffusion law, while the evolution of economic quantifiers exhibit ballistic dynamics. Second we make predictions of best and worst case scenarios taking into account large local fluctuations. Our stochastic process approach to integration lends itself to interesting forecasting scenarios which, in the hands of policy makers, have the potential to improve political responses to integration problems. For instance, estimating the standard first-passage time and maximum-span walk reveals local differences in integration performance for different immigration scenarios. Thus, by recognizing the importance of local fluctuations around national means, this research constitutes an important tool to assess the impact of immigration phenomena on municipal budgets and to set up solid multi-ethnic plans at the municipal level as immigration pressure build.

physics.soc-ph↗

Extensive load in multitasking associative networks

We use belief-propagation techniques to study the equilibrium behavior of a bipartite spin-glass, with interactions between two sets of $N$ and $P = αN$ spins. Each spin has a finite degree, i.e.\ number of interaction partners in the opposite set; an equivalent view is then of a system of $N$ neurons storing $P$ diluted patterns. We show that in a large part of the parameter space of noise, dilution and storage load, delimited by a critical surface, the network behaves as an extensive parallel processor, retrieving all $P$ patterns {\it in parallel} without falling into spurious states due to pattern cross-talk and typical of the structural glassiness built into the network. Our approach allows us to consider effects beyond those studied in replica theory so far, including pattern asymmetry and heterogeneous dilution. Parallel extensive retrieval is more robust for homogeneous degree distributions, and is not disrupted by biases in the distributions of the spin-glass links.

cond-mat.dis-nn↗

Multi-species mean-field spin-glasses. Rigorous results

We study a multi-species spin glass system where the density of each species is kept fixed at increasing volumes. The model reduces to the Sherrington-Kirkpatrick one for the single species case. The existence of the thermodynamic limit is proved for all densities values under a convexity condition on the interaction. The thermodynamic properties of the model are investigated and the annealed, the replica symmetric and the replica symmetry breaking bounds are proved using Guerra's scheme. The annealed approximation is proved to be exact under a high temperature condition. We show that the replica symmetric solution has negative entropy at low temperatures. We study the properties of a suitably defined replica symmetry breaking solution and we optimise it within a ziggurat ansatz. The generalized order parameter is described by a Parisi-like partial differential equation.

math-ph↗

Free-energy bounds for hierarchical spin models

In this paper we study two non-mean-field spin models built on a hierarchical lattice: The hierarchical Edward-Anderson model (HEA) of a spin glass, and Dyson's hierarchical model (DHM) of a ferromagnet. For the HEA, we prove the existence of the thermodynamic limit of the free energy and the replica-symmetry-breaking (RSB) free-energy bounds previously derived for the Sherrington-Kirkpatrick model of a spin glass. These RSB mean-field bounds are exact only if the order-parameter fluctuations (OPF) vanish: Given that such fluctuations are not negligible in non-mean-field models, we develop a novel strategy to tackle part of OPF in hierarchical models. The method is based on absorbing part of OPF of a block of spins into an effective Hamiltonian of the underlying spin blocks. We illustrate this method for DHM and show that, compared to the mean-field bound for the free energy, it provides a tighter non-mean-field bound, with a critical temperature closer to the exact one. To extend this method to the HEA model, a suitable generalization of Griffith's correlation inequalities for Ising ferromagnets is needed: Since correlation inequalities for spin glasses are still an open topic, we leave the extension of this method to hierarchical spin glasses as a future perspective.

math-ph↗

An analysis of a large dataset on immigrant integration in Spain. The Statistical Mechanics perspective on Social Action

How does immigrant integration in a country change with immigration density? Guided by a statistical mechanics perspective we propose a novel approach to this problem. The analysis focuses on classical integration quantifiers such as the percentage of jobs (temporary and permanent) given to immigrants, mixed marriages, and newborns with parents of mixed origin. We find that the average values of different quantifi?ers may exhibit either linear or non-linear growth on immigrant density and we suggest that social action, a concept identified by Max Weber, causes the observed non- linearity. Using the statistical mechanics notion of interaction to quantitatively emulate social action, a unified mathematical model for integration is proposed and it is shown to explain both growth behaviors observed. The linear theory instead, ignoring the possibility of interaction effects would underestimate the quantifiers up to 30% when immigrant densities are low, and overestimate them as much when densities are high. The capacity to quantitatively isolate different types of integration mechanisms makes our framework a suitable tool in the quest for more efficient integration policies.

physics.soc-ph↗

Cancer-driven dynamics of immune cells in a microfluidic environment

Scope of the present work is to frame into a rigorous, quantitative scaffold - stemmed from stochastic process theory - two sets of experiments designed to infer the spontaneous organization of leukocytes against cancer cells, namely mice splenocytes vs. B16 mouse tumor cells, and embedded in an "ad hoc" microfluidic environment developed on a LabOnChip technology. In the former, splenocytes from knocked out (KO) mice engineered to silence the transcription factor IRF-8, crucial for the development and function of several immune populations, were used. In this case lymphocytes and cancer cells exhibited a poor reciprocal exchange, resulting in the inability of coordinating or mounting an effective immune response against melanoma. In the second class of tests, wild type (WT) splenocytes were able to interact with and to coordinate a response against the tumor cells through physical interaction. The environment where cells moved was built of by two different chambers, containing respectively melanoma cells and splenocytes, connected by capillary migration channels allowing leucocytes to migrate from their chamber toward the melanoma one. We collected and analyzed data on the motility of the cells and found that the first ensemble of IRF-8 KO cells performed pure uncorrelated random walks, while WT splenocytes were able to make singular drifted random walks, that, averaged over the ensemble of cells, collapsed on a straight ballistic motion for the system as a whole. At a finer level of investigation, we found that IRF-8 KO splenocytes moved rather uniformly since their step lengths were exponentially distributed, while WT counterpart displayed a qualitatively broader motion as their step lengths along the direction of the melanoma were log-normally distributed.

q-bio.CB↗

Collective behaviours: from biochemical kinetics to electronic circuits

In this work we aim to highlight a close analogy between cooperative behaviors in chemical kinetics and cybernetics; this is realized by using a common language for their description, that is mean-field statistical mechanics. First, we perform a one-to-one mapping between paradigmatic behaviors in chemical kinetics (i.e., non-cooperative, cooperative, ultra-sensitive, anti-cooperative) and in mean-field statistical mechanics (i.e., paramagnetic, high and low temperature ferromagnetic, anti-ferromagnetic). Interestingly, the statistical mechanics approach allows a unified, broad theory for all scenarios and, in particular, Michaelis-Menten, Hill and Adair equations are consistently recovered. This framework is then tested against experimental biological data with an overall excellent agreement. One step forward, we consistently read the whole mapping from a cybernetic perspective, highlighting deep structural analogies between the above-mentioned kinetics and fundamental bricks in electronics (i.e. operational amplifiers, flashes, flip-flops), so to build a clear bridge linking biochemical kinetics and cybernetics.

cond-mat.stat-mech↗

Mean field bipartite spin models treated with mechanical techniques

Inspired by a continuously increasing interest in modeling and framing complex systems in a thermody- namic rationale, in this paper we continue our investigation in adapting well known techniques (originally stemmed in fields of physics and mathematics far from the present) for solving for the free energy of mean field spin models in a statistical mechanics scenario. Focusing on the test cases of bipartite spin systems embedded with all the possible interactions (self and reciprocal), we show that both the fully interacting bipartite ferromagnet as well as the spin glass counterpart, at least at the replica symmetric level, can be solved via the fundamental theorem of calculus, trough an analogy with the Hamilton-Jacobi theory and lastly with a mapping to a Fourier diffusion problem. All these technologies are shown symmetrically for ferromagnets and spin-glasses in full details and contribute as powerful tools in the investigation of complex systems.

cond-mat.dis-nn↗

Ferromagnetic models for cooperative behavior: Revisiting Universality in complex phenomena

Ferromagnetic models are harmonic oscillators in statistical mechanics. Beyond their original scope in tackling phase transition and symmetry breaking in theoretical physics, they are nowadays experiencing a renewal applicative interest as they capture the main features of disparate complex phenomena, whose quantitative investigation in the past were forbidden due to data lacking. After a streamlined introduction to these models, suitably embedded on random graphs, aim of the present paper is to show their importance in a plethora of widespread research fields, so to highlight the unifying framework reached by using statistical mechanics as a tool for their investigation. Specifically we will deal with examples stemmed from sociology, chemistry, cybernetics (electronics) and biology (immunology).

cond-mat.stat-mech↗

Immune networks: multi-tasking capabilities near saturation

Pattern-diluted associative networks were introduced recently as models for the immune system, with nodes representing T-lymphocytes and stored patterns representing signalling protocols between T- and B-lymphocytes. It was shown earlier that in the regime of extreme pattern dilution, a system with $N_T$ T-lymphocytes can manage a number $N_B!=!\order(N_T^δ)$ of B-lymphocytes simultaneously, with $δ!<!1$. Here we study this model in the extensive load regime $N_B!=!αN_T$, with also a high degree of pattern dilution, in agreement with immunological findings. We use graph theory and statistical mechanical analysis based on replica methods to show that in the finite-connectivity regime, where each T-lymphocyte interacts with a finite number of B-lymphocytes as $N_T\to\infty$, the T-lymphocytes can coordinate effective immune responses to an extensive number of distinct antigen invasions in parallel. As $α$ increases, the system eventually undergoes a second order transition to a phase with clonal cross-talk interference, where the system's performance degrades gracefully. Mathematically, the model is equivalent to a spin system on a finitely connected graph with many short loops, so one would expect the available analytical methods, which all assume locally tree-like graphs, to fail. Yet it turns out to be solvable. Our results are supported by numerical simulations.

cond-mat.dis-nn↗

Application of a stochastic modeling to evaluate tuberculosis onset in patients treated with tumor necrosis factor inhibitors

In this manuscript we apply stochastic modeling to investigate the risk of reactivation of latent mycobacterial infections in patients undergoing treatment with tumor necrosis factor inhibitors. First, we review the perspective proposed by one of the authors in a previous work and which consists in predicting the occurrence of reactivation of latent tuberculosis infection or newly acquired tuberculosis during treatment; this is based on variational procedures on a simple set of parameters (e.g. rate of reactivation of a latent infection). Then, we develop a full analytical study of this approach through a Markov chain analysis and we find an exact solution for the temporal evolution of the number of cases of tuberculosis infection (re)activation. The analytical solution is compared with Monte Carlo simulations and with experimental data, showing overall excellent agreement. The generality of this theoretical framework allows to investigate also the case of non-tuberculous mycobacteria infections; in particular, we show that reactivation in that context plays a minor role. This may suggest that, while the screening for tuberculous is necessary prior to initiating biologics, when considering non-tuberculous mycobacteria only a watchful monitoring during the treatment is recommended. The framework outlined in this paper is quite general and could be extremely promising in further researches on drug-related adverse events.

physics.med-ph↗

Multitasking network with fast noise

We consider the multitasking associative network in the low-storage limit and we study its phase diagram with respect to the noise level $T$ and the degree $d$ of dilution in pattern entries. We find that the system is characterized by a rich variety of stable states, among which pure states, parallel retrieval states, hierarchically organized states and symmetric mixtures (remarkably, both even and odd), whose complexity increases as the number of patterns $P$ grows. The analysis is performed both analytically and numerically: Exploiting techniques based on partial differential equations, allows us to get the self-consistencies for the order parameters. Such self-consistence equations are then solved and the solutions are further checked through stability theory to catalog their organizations into the phase diagram, which is completely outlined at the end. This is a further step toward the understanding of spontaneous parallel processing in associative networks.

cond-mat.dis-nn↗

Mean field spin glasses treated with PDE techniques

Following an original idea of F. Guerra, in this notes we analyze the Sherrington-Kirkpatrick model from different perspectives, all sharing the underlying approach which consists in linking the resolution of the statistical mechanics of the model (e.g. solving for the free energy) to well-known partial differential equation (PDE) problems (in suitable spaces). The plan is then to solve the related PDE using techniques involved in their native field and lastly bringing back the solution in the proper statistical mechanics framework. Within this strand, after a streamlined test-case on the Curie-Weiss model to highlight the methods more than the physics behind, we solve the SK both at the replica symmetric and at the 1-RSB level, obtaining the correct expression for the free energy via an analogy to a Fourier equation and for the self-consistencies with an analogy to a Burger equation, whose shock wave develops exactly at critical noise level (triggering the phase transition). Our approach, beyond acting as a new alternative method (with respect to the standard routes) for tackling the complexity of spin glasses, links symmetries in PDE theory with constraints in statistical mechanics and, as a novel result from the theoretical physics perspective, we obtain a new class of polynomial identities (namely of Aizenman-Contucci type but merged within the Guerra's broken replica measures), whose interest lies in understanding, via the recent Panchenko breakthroughs, how to force the overlap organization to the ultrametric tree predicted by Parisi.

cond-mat.dis-nn↗