Tuning clustering in random networks with arbitrary degree distributions

We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and second the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.

Synchronization, diversity, and topology of networks of integrate and fire oscillators

We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention on the interplay between topological disorder and synchronization features of networks. First, we analyze synchronization time T in random networks, and find a scaling law which relates T to network connectivity. Then, we compare synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than a disordered network. This fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to having a nonrandom topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.

Generation of uncorrelated random scale-free networks

Uncorrelated random scale-free networks are useful null models to check the accuracy and the analytical solutions of dynamical processes defined on complex networks. We propose and analyze a model capable of generating random uncorrelated scale-free networks with no multiple and self-connections. The model is based on the classical configuration model, with an additional restriction on the maximum possible degree of the vertices. We check numerically that the proposed model indeed generates scale-free networks with no two- and three-vertex correlations, as measured by the average degree of the nearest neighbors and the clustering coefficient of the vertices of degree k, respectively.

Class of correlated random networks with hidden variables

We study a class of models of correlated random networks in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological properties of these models as a function of the distribution of hidden variables and the probability of connecting vertices. The expressions obtained are checked by means of numerical simulations in a particular example. The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure. We also present an extension of the class, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.

Networks of people in specialty production: family firms in the iron and steel Wire industries in Spain (1870-2000)

Capital intensive industries in specialized niches of production have constituted solid ground for family firms in Spain , as evidenced by the experience of the iron and steel wire industries between 1870 and 2000. The embeddedness of these firms in their local and regional environments have allowed the creation of networks that, together with favourable institutional conditions, significantly explain the dominance of family entrepreneurship in iron and steel wire manufacturing in Spain, until the end of the 20 th century. Dominance of family firms at the regional level has not been not an obstacle for innovation in wire manufacturing in Spain, which has taken place even when institutional conditions blocked innovation and traditional networking. Therefore, economic theories about the difficulties dynastic family firms may have to perform appropriately in science-based industries must be questioned

Analysis of linear networks with inconsistent initial conditions

This paper presents a new method to analyze timeinvariant linear networks allowing the existence of inconsistent initial conditions. This method is based on the use of distributions and state equations. Any time-invariant linear network can be analyzed. The network can involve any kind of pure or controlled sources. Also, the transferences of energy that occur at t=O are determined, and the concept of connection energy is introduced. The algorithms are easily implemented in a computer program.

Heterogeneous discounting in consumption-investment problems. Time consistent solutions

[cat] En aquest treball s'analitza un model estocàstic en temps continu en el que l'agent decisor descompta les utilitats instantànies i la funció final amb taxes de preferència temporal constants però diferents. En aquest context es poden modelitzar problemes en els quals, quan el temps s'acosta al moment final, la valoració de la funció final incrementa en comparació amb les utilitats instantànies. Aquest tipus d'asimetria no es pot descriure ni amb un descompte estàndard ni amb un variable. Per tal d'obtenir solucions consistents temporalment es deriva l'equació de programació dinàmica estocàstica, les solucions de la qual són equilibris Markovians. Per a aquest tipus de preferències temporals, s'estudia el model clàssic de consum i inversió (Merton, 1971) per a les funcions d'utilitat del tipus CRRA i CARA, comparant els equilibris Markovians amb les solucions inconsistents temporalment. Finalment es discuteix la introducció del temps final aleatori.

Generation of biological association networks: A novel strategy to detect new targets in cancer therapy

The aim of this work was to design a novel strategy to detect new targets for anticancer treatments. The rationale was to build Biological Association Networks from differentially expressed genes in drug-resistant cells to identify important nodes within the Networks. These nodes may represent putative targets to attack in cancer therapy, as a way to destabilize the gene network developed by the resistant cells to escape from the drug pressure. As a model we used cells resistant to methotrexate (MTX), an inhibitor of DHFR. Selected node-genes were analyzed at the transcriptional level and from a genotypic point of view. In colon cancer cells, DHFR, the AKR1 family, PKC¿, S100A4, DKK1, and CAV1 were overexpressed while E-cadherin was lost. In breast cancer cells, the UGT1A family was overexpressed, whereas EEF1A1 was overexpressed in pancreatic cells. Interference RNAs directed against these targets sensitized cells towards MTX.

Coworker networks in the labour market

This paper studies the role coworker-based networks play for individual labour marketoutcomes. I analyse how the provision of labour market relevant information by formercoworkers affects the employment probabilities and, if hired, the wages of male workerswho have previously become unemployed as the result of an establishment closure. Toidentify the causal effect of an individual worker's network on labour market outcomes, Iexploit exogenous variation in the strength of these networks that is due to the occurrenceof mass-layoffs in the establishments of former coworkers. The empirical analysis is basedon administrative data that comprise the universe of workers employed in Germany between1980 and 2001. The results suggest a strong positive effect of a higher employmentrate in a worker's network of former coworkers on his re-employment probability afterdisplacement: a 10 percentage point increase in the prevailing employment rate in thenetwork increases the re-employment probability by 7.5 percentage points. In contrast,there is no evidence of a statistically significant effect on wages.

Extrasynaptic neurotransmission in the modulation of brain function. Focus on the striatal neuronal glial networks

Extrasynaptic neurotransmission is an important short distance form of volume transmission (VT) and describes the extracellular diffusion of transmitters and modulators after synaptic spillover or extrasynaptic release in the local circuit regions binding to and activating mainly extrasynaptic neuronal and glial receptors in the neuroglial networks of the brain. Receptor-receptor interactions in G protein-coupled receptor (GPCR) heteromers play a major role, on dendritic spines and nerve terminals including glutamate synapses, in the integrative processes of the extrasynaptic signaling. Heteromeric complexes between GPCR and ion-channel receptors play a special role in the integration of the synaptic and extrasynaptic signals. Changes in extracellular concentrations of the classical synaptic neurotransmitters glutamate and GABA found with microdialysis is likely an expression of the activity of the neuron-astrocyte unit of the brain and can be used as an index of VT-mediated actions of these two neurotransmitters in the brain. Thus, the activity of neurons may be functionally linked to the activity of astrocytes, which may release glutamate and GABA to the extracellular space where extrasynaptic glutamate and GABA receptors do exist. Wiring transmission (WT) and VT are fundamental properties of all neurons of the CNS but the balance between WT and VT varies from one nerve cell population to the other. The focus is on the striatal cellular networks, and the WT and VT and their integration via receptor heteromers are described in the GABA projection neurons, the glutamate, dopamine, 5-hydroxytryptamine (5-HT) and histamine striatal afferents, the cholinergic interneurons, and different types of GABA interneurons. In addition, the role in these networks of VT signaling of the energy-dependent modulator adenosine and of endocannabinoids mainly formed in the striatal projection neurons will be underlined to understand the communication in the striatal cellular networks

Gene Ontology Function prediction in Mollicutes using Protein-Protein Association Networks

Abstract Background: Many complex systems can be represented and analysed as networks. The recent availability of large-scale datasets, has made it possible to elucidate some of the organisational principles and rules that govern their function, robustness and evolution. However, one of the main limitations in using protein-protein interactions for function prediction is the availability of interaction data, especially for Mollicutes. If we could harness predicted interactions, such as those from a Protein-Protein Association Networks (PPAN), combining several protein-protein network function-inference methods with semantic similarity calculations, the use of protein-protein interactions for functional inference in this species would become more potentially useful. Results: In this work we show that using PPAN data combined with other approximations, such as functional module detection, orthology exploitation methods and Gene Ontology (GO)-based information measures helps to predict protein function in Mycoplasma genitalium. Conclusions: To our knowledge, the proposed method is the first that combines functional module detection among species, exploiting an orthology procedure and using information theory-based GO semantic similarity in PPAN of the Mycoplasma species. The results of an evaluation show a higher recall than previously reported methods that focused on only one organism network.

Statistical mechanics of multi-edge networks

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Diffusion dynamics on multiplex networks

We study the time scales associated with diffusion processes that take place on multiplex networks, i.e., on a set of networks linked through interconnected layers. To this end, we propose the construction of a supra-Laplacian matrix, which consists of a dimensional lifting of the Laplacian matrix of each layer of the multiplex network. We use perturbative analysis to reveal analytically the structure of eigenvectors and eigenvalues of the complete network in terms of the spectral properties of the individual layers. The spectrum of the supra-Laplacian allows us to understand the physics of diffusionlike processes on top of multiplex networks.

Deciphering the global organization of clustering in real complex networks

We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.