arXiv subjects

Elena Agliari

Publications and source records attributed to Elena Agliari.

At least 73 records · Page 4Linked to original sources

arXiv2014

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↗

arXiv2014

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↗

arXiv2014

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↗

arXiv2014

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↗

arXiv2014

Slow Encounters of Particle Pairs in Branched Structures

On infinite homogeneous structures, two random walkers meet with certainty if and only if the structure is recurrent, i.e., a single random walker returns to its starting point with probability 1. However, on general inhomogeneous structures this property does not hold and, although a single random walker will certainly return to its starting point, two moving particles may never meet. This striking property has been shown to hold, for instance, on infinite combs. Due to the huge variety of natural phenomena which can be modeled in terms of encounters between two (or more) particles diffusing in comb-like structures, it is fundamental to investigate if and, if so, to what extent similar effects may take place in finite structures. By means of numerical simulations we evidence that, indeed, even on finite structures, the topological inhomogeneity can qualitatively affect the two-particle problem. In particular, the mean encounter time can be polynomially larger than the time expected from the related one particle problem.

cond-mat.stat-mech↗

arXiv2014

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↗

arXiv2014

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↗

arXiv2013

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↗

arXiv2013

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↗

arXiv2013

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↗

arXiv2013

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↗

arXiv2013

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↗

arXiv2013

Parallel processing in immune networks

In this work we adopt a statistical mechanics approach to investigate basic, systemic features exhibited by adaptive immune systems. The lymphocyte network made by B-cells and T-cells is modeled by a bipartite spin-glass, where, following biological prescriptions, links connecting B-cells and T-cells are sparse. Interestingly, the dilution performed on links is shown to make the system able to orchestrate parallel strategies to fight several pathogens at the same time; this multitasking capability constitutes a remarkable, key property of immune systems as multiple antigens are always present within the host. We also define the stochastic process ruling the temporal evolution of lymphocyte activity, and show its relaxation toward an equilibrium measure allowing statistical mechanics investigations. Analytical results are compared with Monte Carlo simulations and signal-to-noise outcomes showing overall excellent agreement. Finally, within our model, a rationale for the experimentally well-evidenced correlation between lymphocytosis and autoimmunity is achieved; this sheds further light on the systemic features exhibited by immune networks.

q-bio.CB↗

arXiv2013

Immune networks: multi-tasking capabilities at medium load

Associative network models featuring multi-tasking properties have been introduced recently and studied in the low load regime, where the number $P$ of simultaneously retrievable patterns scales with the number $N$ of nodes as $P\sim \log N$. In addition to their relevance in artificial intelligence, these models are increasingly important in immunology, where stored patterns represent strategies to fight pathogens and nodes represent lymphocyte clones. They allow us to understand the crucial ability of the immune system to respond simultaneously to multiple distinct antigen invasions. Here we develop further the statistical mechanical analysis of such systems, by studying the medium load regime, $P \sim N^δ$ with $δ\in (0,1]$. We derive three main results. First, we reveal the nontrivial architecture of these networks: they exhibit a high degree of modularity and clustering, which is linked to their retrieval abilities. Second, by solving the model we demonstrate for $δ<1$ the existence of large regions in the phase diagram where the network can retrieve all stored patterns simultaneously. Finally, in the high load regime $δ=1$ we find that the system behaves as a spin glass, suggesting that finite-connectivity frameworks are required to achieve effective retrieval.

cond-mat.dis-nn↗

arXiv2012

Anergy in self-directed B lymphocytes from a statistical mechanics perspective

The ability of the adaptive immune system to discriminate between self and non-self mainly stems from the ontogenic clonal-deletion of lymphocytes expressing strong binding affinity with self-peptides. However, some self-directed lymphocytes may evade selection and still be harmless due to a mechanism called clonal anergy. As for B lymphocytes, two major explanations for anergy developed over three decades: according to "Varela theory", it stems from a proper orchestration of the whole B-repertoire, in such a way that self-reactive clones, due to intensive interactions and feed-back from other clones, display more inertia to mount a response. On the other hand, according to the `two-signal model", which has prevailed nowadays, self-reacting cells are not stimulated by helper lymphocytes and the absence of such signaling yields anergy. The first result we present, achieved through disordered statistical mechanics, shows that helper cells do not prompt the activation and proliferation of a certain sub-group of B cells, which turn out to be just those broadly interacting, hence it merges the two approaches as a whole (in particular, Varela theory is then contained into the two-signal model). As a second result, we outline a minimal topological architecture for the B-world, where highly connected clones are self-directed as a natural consequence of an ontogenetic learning; this provides a mathematical framework to Varela perspective. As a consequence of these two achievements, clonal deletion and clonal anergy can be seen as two inter-playing aspects of the same phenomenon too.

physics.bio-ph↗

arXiv2012

Multitasking associative networks

We introduce a bipartite, diluted and frustrated, network as a sparse restricted Boltzman machine and we show its thermodynamical equivalence to an associative working memory able to retrieve multiple patterns in parallel without falling into spurious states typical of classical neural networks. We focus on systems processing in parallel a finite (up to logarithmic growth in the volume) amount of patterns, mirroring the low-level storage of standard Amit-Gutfreund-Sompolinsky theory. Results obtained trough statistical mechanics, signal-to-noise technique and Monte Carlo simulations are overall in perfect agreement and carry interesting biological insights. Indeed, these associative networks pave new perspectives in the understanding of multitasking features expressed by complex systems, e.g. neural and immune networks.

cond-mat.dis-nn↗

arXiv2012

Analogue neural networks on correlated random graphs

We consider a generalization of the Hopfield model, where the entries of patterns are Gaussian and diluted. We focus on the high-storage regime and we investigate analytically the topological properties of the emergent network, as well as the thermodynamic properties of the model. We find that, by properly tuning the dilution in the pattern entries, the network can recover different topological regimes characterized by peculiar scalings of the average coordination number with respect to the system size. The structure is also shown to exhibit a large degree of cliquishness, even when very sparse. Moreover, we obtain explicitly the replica symmetric free energy and the self-consistency equations for the overlaps (order parameters of the theory), which turn out to be classical weighted sums of 'sub-overlaps' defined on all possible sub-graphs. Finally, a study of criticality is performed through a small-overlap expansion of the self-consistencies and through a whole fluctuation theory developed for their rescaled correlations: Both approaches show that the net effect of dilution in pattern entries is to rescale the critical noise level at which ergodicity breaks down.

cond-mat.dis-nn↗

arXiv2012

Can persistent Epstein-Barr virus infection induce Chronic Fatigue Syndrome as a Pavlov reflex of the immune response?

Chronic Fatigue Syndrome is a protracted illness condition (lasting even years) appearing with strong flu symptoms and systemic defiances by the immune system. Here, by means of statistical mechanics techniques, we study the most widely accepted picture for its genesis, namely a persistent acute mononucleosis infection, and we show how such infection may drive the immune system toward an out-of-equilibrium metastable state displaying chronic activation of both humoral and cellular responses (a state of full inflammation without a direct "causes-effect" reason). By exploiting a bridge with a neural scenario, we mirror killer lymphocytes $T_K$ and $B$ cells to neurons and helper lymphocytes $T_{H_1},T_{H_2}$ to synapses, hence showing that the immune system may experience the Pavlov conditional reflex phenomenon: if the exposition to a stimulus (EBV antigens) lasts for too long, strong internal correlations among $B,T_K,T_H$ may develop ultimately resulting in a persistent activation even though the stimulus itself is removed. These outcomes are corroborated by several experimental findings.

q-bio.CB↗