Quantifying randomness in real networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Orsini C
PROVIDER: S-EPMC4667701 | biostudies-literature | 2015 Oct
REPOSITORIES: biostudies-literature
Publications
Quantifying randomness in real networks.
Orsini Chiara C Dankulov Marija M MM Colomer-de-Simón Pol P Jamakovic Almerima A Mahadevan Priya P Vahdat Amin A Bassler Kevin E KE Toroczkai Zoltán Z Boguñá Marián M Caldarelli Guido G Fortunato Santo S Krioukov Dmitri D
Nature communications 20151020
Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six rea ...[more]
Similar Datasets
Project description:Randomness has been mathematically defined and quantified in time series using algorithms such as Approximate Entropy (ApEn). Even though ApEn is independent of any model and can be used with any time series, as the markets have different statistical values, it cannot be applied directly to make comparisons between series of financial data. In this paper, we develop further the use of Approximate Entropy to quantify the existence of patterns in evolving data series, defining a measure to allow comparisons between time series and epochs using a maximum entropy approach. We apply the methodology to the stock markets as an example of its application, showing that the number of patterns changed for the six analyzed markets depending on the economic situation, in agreement with the Adaptive Markets Hypothesis.
| S-EPMC6726611 | biostudies-literature
Project description:Protein-protein interaction (PPI) networks are commonly explored for the identification of distinctive biological traits, such as pathways, modules, and functional motifs. In this respect, understanding the underlying network structure is vital to assess the significance of any discovered features. We recently demonstrated that PPI networks show degree-weighted behavior, whereby the probability of interaction between two proteins is generally proportional to the product of their numbers of interacting partners or degrees. It was surmised that degree-weighted behavior is a characteristic of randomness. We expand upon these findings by developing a random, degree-weighted, network model and show that eight PPI networks determined from single high-throughput (HT) experiments have global and local properties that are consistent with this model. The apparent random connectivity in HT PPI networks is counter-intuitive with respect to their observed degree distributions; however, we resolve this discrepancy by introducing a non-network-based model for the evolution of protein degrees or "binding affinities." This mechanism is based on duplication and random mutation, for which the degree distribution converges to a steady state that is identical to one obtained by averaging over the eight HT PPI networks. The results imply that the degrees and connectivities incorporated in HT PPI networks are characteristic of unbiased interactions between proteins that have varying individual binding affinities. These findings corroborate the observation that curated and high-confidence PPI networks are distinct from HT PPI networks and not consistent with a random connectivity. These results provide an avenue to discern indiscriminate organizations in biological networks and suggest caution in the analysis of curated and high-confidence networks.
| S-EPMC2527968 | biostudies-literature
Project description:We propose that coding and decoding in the brain are achieved through digital computation using three principles: relative ordinal coding of inputs, random connections between neurons, and belief voting. Due to randomization and despite the coarseness of the relative codes, we show that these principles are sufficient for coding and decoding sequences with error-free reconstruction. In particular, the number of neurons needed grows linearly with the size of the input repertoire growing exponentially. We illustrate our model by reconstructing sequences with repertoires on the order of a billion items. From this, we derive the Shannon equations for the capacity limit to learn and transfer information in the neural population, which is then generalized to any type of neural network. Following the maximum entropy principle of efficient coding, we show that random connections serve to decorrelate redundant information in incoming signals, creating more compact codes for neurons and therefore, conveying a larger amount of information. Henceforth, despite the unreliability of the relative codes, few neurons become necessary to discriminate the original signal without error. Finally, we discuss the significance of this digital computation model regarding neurobiological findings in the brain and more generally with artificial intelligence algorithms, with a view toward a neural information theory and the design of digital neural networks.
| S-EPMC9388095 | biostudies-literature
Project description:Random forwarding networks play a significant role in solving security and load balancing problems. As a random quantity easily obtained by both sender and receiver, the end-to-end delay of random forwarding networks can be utilized as an effective random source for cryptography-related applications. In this paper, we propose a mathematical model of Random forwarding networks and give the calculation method of end-to-end delay distribution. In exploring the upper limit of the randomness of end-to-end delay, we find that the end-to-end delay collision of different forwarding routes is the main reason for the decrease of end-to-end delay randomness. Some of these collisions can be optimized by better network deployment, while others are caused by some interesting network topology, which is unavoidable. For further analysis, we propose an algorithm to calculate the inevitable collision in random forwarding networks skillfully by using Symbol Matrix, and we give the optimal node forwarding strategy with the maximum randomness of the end-to-end delay for a given number of middle forwarding nodes and forwarding times. Finally, we introduce a specific application of generating symmetric keys by using the randomness of the end-to-end delay.
| S-EPMC9044350 | biostudies-literature
Project description:Quantifying entropy production in various active matter phases will open new avenues for probing self-organization principles in these far-from-equilibrium systems. It has been hypothesized that the dissipation of free energy by active matter systems may be optimized, leading to system trajectories with histories of large dissipation and an accompanying emergence of ordered dynamical states. This interesting idea has not been widely tested. In particular, it is not clear whether emergent states of actomyosin networks, which represent a salient example of biological active matter, self-organize following the principle of dissipation optimization. In order to start addressing this question using detailed computational modelling, we rely on the MEDYAN simulation platform, which allows simulating active matter networks from fundamental molecular principles. We have extended the capabilities of MEDYAN to allow quantification of the rates of dissipation resulting from chemical reactions and relaxation of mechanical stresses during simulation trajectories. This is done by computing precise changes in Gibbs free energy accompanying chemical reactions using a novel formula and through detailed calculations of instantaneous values of the system's mechanical energy. We validate our approach with a mean-field model that estimates the rates of dissipation from filament treadmilling. Applying this methodology to the self-organization of small disordered actomyosin networks, we find that compact and highly cross-linked networks tend to allow more efficient transduction of chemical free energy into mechanical energy. In these simple systems, we observe that spontaneous network reorganizations tend to result in a decrease in the total dissipation rate to a low steady-state value. Future studies might carefully test whether the dissipation-driven adaptation hypothesis applies in this instance, as well as in more complex cytoskeletal geometries.
| S-EPMC6501337 | biostudies-literature
Project description:No study to date investigated structural white matter (WM) connectome characteristics in patients with anorexia nervosa (AN). Previous research in AN found evidence of imbalances in global and regional connectomic brain architecture and highlighted a role of malnutrition in determining structural brain changes. The aim of our study was to explore the characteristics of the WM network architecture in a sample of patients with AN. Thirty-six patients with AN and 36 healthy women underwent magnetic resonance imaging to obtain a high-resolution three-dimensional T1-weighted anatomical image and a diffusion tensor imaging scan. Probabilistic tractography data were extracted and analyzed in their network properties through graph theory tools. In comparison to healthy women, patients with AN showed lower global network segregation (normalized clustering: p = 0.029), an imbalance between global network integration and segregation (i.e., lower small-worldness: p = 0.031), and the loss of some of the most integrative and influential hubs. Both clustering and small-worldness correlated with the lowest lifetime body mass index. A significant relationship was found between the average regional loss of cortical volume and changes in network properties of brain nodes: the more the difference in the cortical volume of brain areas, the more the increase in the centrality of corresponding nodes in the whole brain, and the decrease in clustering and efficiency of the nodes of parietal cortex. Our findings showed an unbalanced connectome wiring in AN patients, which seems to be influenced by malnutrition and loss of cortical volume. The role of this rearrangement in the maintenance and prognosis of AN and its reversibility with clinical improvement needs to be established by future studies.
| S-EPMC8024518 | biostudies-literature
Project description:Many complex networks depend upon biological entities for their preservation. Such entities, from human cognition to evolution, must first encode and then replicate those networks under marked resource constraints. Networks that survive are those that are amenable to constrained encoding-or, in other words, are compressible. But how compressible is a network? And what features make one network more compressible than another? Here, we answer these questions by modeling networks as information sources before compressing them using rate-distortion theory. Each network yields a unique rate-distortion curve, which specifies the minimal amount of information that remains at a given scale of description. A natural definition then emerges for the compressibility of a network: the amount of information that can be removed via compression, averaged across all scales. Analyzing an array of real and model networks, we demonstrate that compressibility increases with two common network properties: transitivity (or clustering) and degree heterogeneity. These results indicate that hierarchical organization-which is characterized by modular structure and heterogeneous degrees-facilitates compression in complex networks. Generally, our framework sheds light on the interplay between a network's structure and its capacity to be compressed, enabling investigations into the role of compression in shaping real-world networks.
| S-EPMC8364101 | biostudies-literature
Project description:The complexity of navigation in cities has increased with the expansion of urban areas, creating challenging transportation problems that drive many studies on the navigability of networks. However, due to the lack of individual mobility data, large-scale empirical analysis of the wayfinder's real-world navigation is rare. Here, using 225 million subway trips from three major cities in China, we quantify navigation difficulty from an information perspective. Our results reveal that (1) people conserve a small number of repeatedly used routes and (2) the navigation information in the subnetworks formed by those routes is much smaller than the theoretical value in the global network, suggesting that the decision cost for actual trips is significantly smaller than the theoretical upper limit found in previous studies. By modeling routing behaviors in growing networks, we show that while the global network becomes difficult to navigate, navigability can be improved in subnetworks. We further present a universal linear relationship between the empirical and theoretical search information, which allows the two metrics to predict each other. Our findings demonstrate how large-scale observations can quantify real-world navigation behaviors and aid in evaluating transportation planning.
| S-EPMC9896943 | biostudies-literature
Project description:Humans can easily discriminate a randomly spaced from a regularly spaced visual pattern. Here, we demonstrate that observers can adapt to pattern randomness. Following their adaption to prolonged exposure to two-dimensional patterns with varying levels of physical randomness, observers judged the randomness of the pattern. Perceived randomness decreased (increased) following adaptation to high (low) physical randomness (Experiment 1). Adaptation to 22.5°-rotated adaptor stimuli did not cause a randomness aftereffect (Experiment 2), suggesting that positional variation is unlikely to be responsible for the pattern randomness perception. Moreover, the aftereffect was not selective to contrast polarity (Experiment 3) and was not affected by spatial jitter (Experiment 4). Last, the aftereffect was not affected by adaptor configuration (Experiment 5). Our data were consistent with a model assuming filter-rectify-filter processing for orientation inputs. Thus, we infer that neural processing for orientation grouping/segregation underlies the perception of pattern randomness.
| S-EPMC3795352 | biostudies-literature
Project description:Multiplex networks (a system of multiple networks that have different types of links but share a common set of nodes) arise naturally in a wide spectrum of fields. Theoretical studies show that in such multiplex networks, correlated edge dynamics between the layers can have a profound effect on dynamical processes. However, how to extract the correlations from real-world systems is an outstanding challenge. Here we introduce the Multiplex Markov chain to quantify correlations in edge dynamics found in longitudinal data of multiplex networks. By comparing the results obtained from the multiplex perspective to a null model which assumes layers in a network are independent, we can identify real correlations as distinct from simultaneous changes that occur due to random chance. We use this approach on two different data sets: the network of trade and alliances between nation states, and the email and co-commit networks between developers of open source software. We establish the existence of "dynamical spillover" showing the correlated formation (or deletion) of edges of different types as the system evolves. The details of the dynamics over time provide insight into potential causal pathways.
| S-EPMC4602281 | biostudies-other