An evolutionary inspection game with labour unions on small-world networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Kamal SM
PROVIDER: S-EPMC4351522 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Real networks, including biological networks, are known to have the small-world property, characterized by a small "diameter", which is defined as the average minimal path length between all pairs of nodes in a network. Because random networks also have short diameters, one may predict that the diameter of a real network should be even shorter than its random expectation, because having shorter diameters potentially increases the network efficiency such as minimizing transition times between metabolic states in the context of metabolic networks. Contrary to this expectation, we here report that the observed diameter is greater than the random expectation in every real network examined, including biological, social, technological, and linguistic networks. Simulations show that a modest enlargement of the diameter beyond its expectation allows a substantial increase of the network modularity, which is present in all real networks examined. Hence, short diameters appear to be sacrificed for high modularities, suggesting a tradeoff between network efficiency and advantages offered by modularity (e.g., multi-functionality, robustness, and/or evolvability).
| S-EPMC2682646 | biostudies-other
Project description:Networks in nature are often formed within a spatial domain in a dynamical manner, gaining links and nodes as they develop over time. Motivated by the growth and development of neuronal networks, we propose a class of spatially-based growing network models and investigate the resulting statistical network properties as a function of the dimension and topology of the space in which the networks are embedded. In particular, we consider two models in which nodes are placed one by one in random locations in space, with each such placement followed by configuration relaxation toward uniform node density, and connection of the new node with spatially nearby nodes. We find that such growth processes naturally result in networks with small-world features, including a short characteristic path length and nonzero clustering. We find no qualitative differences in these properties for two different topologies, and we suggest that results for these properties may not depend strongly on the topology of the embedding space. The results do depend strongly on dimension, and higher-dimensional spaces result in shorter path lengths but less clustering.
| S-EPMC4231322 | biostudies-other
Project description:Quantitative descriptions of network structure can provide fundamental insights into the function of interconnected complex systems. Small-world structure, diagnosed by high local clustering yet short average path length between any two nodes, promotes information flow in coupled systems, a key function that can differ across conditions or between groups. However, current techniques to quantify small-worldness are density dependent and neglect important features such as the strength of network connections, limiting their application in real-world systems. Here, we address both limitations with a novel metric called the Small-World Propensity (SWP). In its binary instantiation, the SWP provides an unbiased assessment of small-world structure in networks of varying densities. We extend this concept to the case of weighted brain networks by developing (i) a standardized procedure for generating weighted small-world networks, (ii) a weighted extension of the SWP, and (iii) a method for mapping observed brain network data onto the theoretical model. In applying these techniques to compare real-world brain networks, we uncover the surprising fact that the canonical biological small-world network, the C. elegans neuronal network, has strikingly low SWP. These metrics, models, and maps form a coherent toolbox for the assessment and comparison of architectural properties in brain networks.
| S-EPMC4766852 | biostudies-other
Project description:Small-world networks, according to Watts and Strogatz, are a class of networks that are "highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs." These characteristics result in networks with unique properties of regional specialization with efficient information transfer. Social networks are intuitive examples of this organization, in which cliques or clusters of friends being interconnected but each person is really only five or six people away from anyone else. Although this qualitative definition has prevailed in network science theory, in application, the standard quantitative application is to compare path length (a surrogate measure of distributed processing) and clustering (a surrogate measure of regional specialization) to an equivalent random network. It is demonstrated here that comparing network clustering to that of a random network can result in aberrant findings and that networks once thought to exhibit small-world properties may not. We propose a new small-world metric, ? (omega), which compares network clustering to an equivalent lattice network and path length to a random network, as Watts and Strogatz originally described. Example networks are presented that would be interpreted as small-world when clustering is compared to a random network but are not small-world according to ?. These findings have important implications in network science because small-world networks have unique topological properties, and it is critical to accurately distinguish them from networks without simultaneous high clustering and short path length.
| S-EPMC3604768 | biostudies-literature
Project description:In this article, we examine whether (and by how much) workers in Canada have been compensated for the 'novel' risks associated with COVID-19. We create a unique dataset from a system that scores occupations in the US O*NET database for COVID-19 exposure. We then combine those COVID exposure scores with Canadian occupational data contained in the Public Use Microdata File of the Labour Force Survey. This allows us to categorize Canadian occupations based on COVID-19 exposure risk. We find a long-tailed distribution of COVID-19 risk scores across occupations, with most jobs at the lower end of the risk spectrum and relatively few occupations accounting for most of the high COVID-19 exposure risk. We find that workers who are already more vulnerable in the labour market (i.e. youth, women and immigrants) are also more likely to be employed in occupations with high COVID-19 exposure risk. When we look at the relationship between high-COVID exposure risks in occupation and wages, we find negative compensating differentials both at the mean (negative 8%) and across the earnings distribution. However, when workers are covered by a union, they enjoy a sizeable hazard pay premium (11.7% on average) as compared to their non-union counterparts. Furthermore, we find that the moderating effects of unionization for workers at high risk of COVID exposure to be largest at the bottom of the earnings distribution (i.e. the 10th percentile of unionized earners receives a 12.3% risk premium for high-COVID exposure, whereas the 90th percentile receives only a 2%).
| S-EPMC8652733 | biostudies-literature
Project description:We study the spatial evolutionary public goods game (SEPGG) with voluntary or optional participation on a complete graph (CG) and on dense networks. Based on analyses of the SEPGG rate equation on finite CG, we find that SEPGG has two stable states depending on the value of multiplication factor r, illustrating how the "tragedy of the commons" and "an anomalous state without any active participants" occurs in real-life situations. When r is low (<<), the state with only loners is stable, and the state with only defectors is stable when r is high (>>). We also derive the exact scaling relation for r*. All of the results are confirmed by numerical simulation. Furthermore, we find that a cooperator-dominant state emerges when the number of participants or the mean degree, 〈k〉, decreases. We also investigate the scaling dependence of the emergence of cooperation on r and 〈k〉. These results show how "tragedy of the commons" disappears when cooperation between egoistic individuals without any additional socioeconomic punishment increases.
| S-EPMC4369736 | biostudies-other
Project description:It has been shown that both humanly constructed and natural networks are often characterized by small-world phenomenon and assortative mixing. In this paper, we propose a geometrically growing model for small-world networks. The model displays both tunable small-world phenomenon and tunable assortativity. We obtain analytical solutions of relevant topological properties such as order, size, degree distribution, degree correlation, clustering, transitivity, and diameter. It is also worth noting that the model can be viewed as a generalization for an iterative construction of Farey graphs.
| S-EPMC3919055 | biostudies-other
Project description:One of the fundamental issues in polymer physics is to reveal the relation between the structures of macromolecules and their various properties. In this report, we study the dynamical properties of a family of deterministically growing semiflexible treelike polymer networks, which are built in an iterative method. From the analysis of the corresponding dynamical matrix we derive the solution for its eigenvalues and their multiplicities, making use of a combined numerical and analytical approach. The eigenvalue spectra allow us to investigate the mechanical relaxation forms in depth for different values of the stiffness parameter. We observe that the dynamics of semiflexible networks is sensitive to the stiffness parameter. Our work paves a way to explore the structures of the highly symmetric polymers and provides a comprehensive understanding of the role of semiflexibility for the regular treelike networks which possess a small-world feature.
| S-EPMC4271264 | biostudies-other
Project description:Social or biochemical networks can often divide into two opposite alliances in response to structural conflicts between positive (friendly, activating) and negative (hostile, inhibiting) interactions. Yet, the underlying dynamics on how the opposite alliances are spontaneously formed to minimize the structural conflicts is still unclear. Here, we demonstrate that evolutionary game dynamics provides a felicitous possible tool to characterize the evolution and formation of alliances in signed networks. Indeed, an evolutionary game dynamics on signed networks is proposed such that each node can adaptively adjust its choice of alliances to maximize its own fitness, which yet leads to a minimization of the structural conflicts in the entire network. Numerical experiments show that the evolutionary game approach is universally efficient in quality and speed to find optimal solutions for all undirected or directed, unweighted or weighted signed networks. Moreover, the evolutionary game approach is inherently distributed. These characteristics thus suggest the evolutionary game dynamic approach as a feasible and effective tool for determining the structural conflicts in large-scale on-line signed networks.
| S-EPMC4768106 | biostudies-literature
Project description:The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks.
| S-EPMC4357991 | biostudies-other