Information mobility in complex networks

The concept of information mobility in complex networks is introduced on the basis of a stochastic process taking place in the network. The transition matrix for this process represents the probability that the information arising at a given node is transferred to a target one. We use the fractional powers of this transition matrix to investigate the stochastic process at fractional time intervals. The mobility coefficient is then introduced on the basis of the trace of these fractional powers of the stochastic matrix. The fractional time at which a network diffuses 50% of the information contained in its nodes (1/ k50 ) is also introduced. We then show that the scale-free random networks display better spread of information than the non scale-free ones. We study 38 real-world networks and analyze their performance in spreading information from their nodes. We find that some real-world networks perform even better than the scale-free networks with the same average degree and we point out some of the structural parameters that make this possible

Resistance distance, information centrality, node vulnerability and vibrations in complex networks

We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement. We first prove various relations among them. Then we focus on the node displacement, showing its usefulness as an index of node vulnerability.We argue that the node displacement has a better resolution as a measure of node vulnerability than the degree and the information centrality

Mapping Patent Classifications: Portfolio and Statistical Analysis, and the Comparison of Strengths and Weaknesses

The Cooperative Patent Classifications (CPC) jointly developed by the European and US Patent Offices provide a new basis for mapping and portfolio analysis. This update provides an occasion for rethinking the parameter choices. The new maps are significantly different from previous ones, although this may not always be obvious on visual inspection. Since these maps are statistical constructs based on index terms, their quality--as different from utility--can only be controlled discursively. We provide nested maps online and a routine for portfolio overlays and further statistical analysis. We add a new tool for "difference maps" which is illustrated by comparing the portfolios of patents granted to Novartis and MSD in 2016.Comment: Scientometrics 112(3) (2017) 1573-1591; http://link.springer.com/article/10.1007/s11192-017-2449-

Sociological and Communication-Theoretical Perspectives on the Commercialization of the Sciences

Both self-organization and organization are important for the further development of the sciences: the two dynamics condition and enable each other. Commercial and public considerations can interact and "interpenetrate" in historical organization; different codes of communication are then "recombined." However, self-organization in the symbolically generalized codes of communication can be expected to operate at the global level. The Triple Helix model allows for both a neo-institutional appreciation in terms of historical networks of university-industry-government relations and a neo-evolutionary interpretation in terms of three functions: (i) novelty production, (i) wealth generation, and (iii) political control. Using this model, one can appreciate both subdynamics. The mutual information in three dimensions enables us to measure the trade-off between organization and self-organization as a possible synergy. The question of optimization between commercial and public interests in the different sciences can thus be made empirical.Comment: Science & Education (forthcoming

Exploring the “Middle Earth” of network spectra via a Gaussian matrix function

We study a Gaussian matrix function of the adjacency matrix of artificial and real-world networks. We motivate the use of this function on the basis of a dynamical process modeled by the time-dependent Schrodinger equation with a squared Hamiltonian. In particular, we study the Gaussian Estrada index - an index characterizing the importance of eigenvalues close to zero. This index accounts for the information contained in the eigenvalues close to zero in the spectra of networks. Such method is a generalization of the so-called "Folded Spectrum Method" used in quantum molecular sciences. Here we obtain bounds for this index in simple graphs, proving that it reaches its maximum for star graphs followed by complete bipartite graphs. We also obtain formulas for the Estrada Gaussian index of Erdos-Renyi random graphs as well as for the Barabasi-Albert graphs. We also show that in real-world networks this index is related to the existence of important structural patters, such as complete bipartite subgraphs (bicliques). Such bicliques appear naturally in many real-world networks as a consequence of the evolutionary processes giving rise to them. In general, the Gaussian matrix function of the adjacency matrix of networks characterizes important structural information not described in previously used matrix functions of graphs

The Functional Consequences of Mutualistic Network Architecture

The architecture and properties of many complex networks play a significant role in the functioning of the systems they describe. Recently, complex network theory has been applied to ecological entities, like food webs or mutualistic plant-animal interactions. Unfortunately, we still lack an accurate view of the relationship between the architecture and functioning of ecological networks. In this study we explore this link by building individual-based pollination networks from eight Erysimum mediohispanicum (Brassicaceae) populations. In these individual-based networks, each individual plant in a population was considered a node, and was connected by means of undirected links to conspecifics sharing pollinators. The architecture of these unipartite networks was described by means of nestedness, connectivity and transitivity. Network functioning was estimated by quantifying the performance of the population described by each network as the number of per-capita juvenile plants produced per population. We found a consistent relationship between the topology of the networks and their functioning, since variation across populations in the average per-capita production of juvenile plants was positively and significantly related with network nestedness, connectivity and clustering. Subtle changes in the composition of diverse pollinator assemblages can drive major consequences for plant population performance and local persistence through modifications in the structure of the inter-plant pollination networks

The pairwise disconnectivity index as a new metric for the topological analysis of regulatory networks

<p>Abstract</p> <p>Background</p> <p>Currently, there is a gap between purely theoretical studies of the topology of large bioregulatory networks and the practical traditions and interests of experimentalists. While the theoretical approaches emphasize the global characterization of regulatory systems, the practical approaches focus on the role of distinct molecules and genes in regulation. To bridge the gap between these opposite approaches, one needs to combine 'general' with 'particular' properties and translate abstract topological features of large systems into testable functional characteristics of individual components. Here, we propose a new topological parameter – the pairwise disconnectivity index of a network's element – that is capable of such bridging.</p> <p>Results</p> <p>The pairwise disconnectivity index quantifies how crucial an individual element is for sustaining the communication ability between connected pairs of vertices in a network that is displayed as a directed graph. Such an element might be a vertex (i.e., molecules, genes), an edge (i.e., reactions, interactions), as well as a group of vertices and/or edges. The index can be viewed as a measure of topological redundancy of regulatory paths which connect different parts of a given network and as a measure of sensitivity (robustness) of this network to the presence (absence) of each individual element. Accordingly, we introduce the notion of a path-degree of a vertex in terms of its corresponding incoming, outgoing and mediated paths, respectively. The pairwise disconnectivity index has been applied to the analysis of several regulatory networks from various organisms. The importance of an individual vertex or edge for the coherence of the network is determined by the particular position of the given element in the whole network.</p> <p>Conclusion</p> <p>Our approach enables to evaluate the effect of removing each element (i.e., vertex, edge, or their combinations) from a network. The greatest potential value of this approach is its ability to systematically analyze the role of every element, as well as groups of elements, in a regulatory network.</p

The Discursive Legitimation of Political Regimes: A Network Perspective

In this working paper, we treat legitimacy and legitimation as interactive, discursive and relational concepts: Legitimacy is socially constructed in the public spheres of (democratic) political regimes, that is, in discursive exchanges of political elites and citizens about the acceptability of these regimes. Legitimacy claims and assessments establish a link between regimes and their institutions on the one hand, and normative benchmarks on the other. Hence they may be examined with the help of discourse network analysis - a novel application of network analysis whose rationale and potential are illustrated on the basis of a corpus of legitimation statements gleaned from German and US quality newspapers. Our method enables us to discover and visualize the structures of legitimation discourses - prominent speaker types, privileged legitimation criteria and discourse coalitions - and to offer some conjectures on the link between discourses and the institutional arrangements of the German and US polities.Dieses Arbeitspapier behandelt Legitimität und Legitimation als interaktive, diskursive und relationale Konzepte: Legitimität wird in den Öffentlichkeiten (demokratischer) politischer Regimes, also in einem diskursiven Austausch von politischen Eliten und Bürgern über die Akzeptabilität politischer Herrschaft, sozial konstruiert. In Legitimitätsbehauptungen und -bewertungen wird eine Verbindung zwischen Regimes und ihren Institutionen auf der einen und normativen Kriterien auf der anderen Seite hergestellt. Diese können mit Hilfe der Diskursnetzwerkanalyse untersucht werden; Logik und Potential dieser neuen Anwendung der Netzwerkanalyse werden auf der Basis eines Korpus von Legitimationsstatements aus deutschen und US-amerikanischen Qualitätszeitungen illustriert. Unsere Methode erlaubt es, die Strukturen von Legitimationsdiskursen - etwa prominente Sprechertypen, privilegierte Legitimationskriterien und Diskurskoalitionen - aufzudecken und zu visualisieren; daraus lassen sich schließlich auch Erkenntnisse über die Verbindung zwischen Diskursen und politischen Institutionenarrangements in Deutschland und den USA ableiten