Browse
Submit Data
Databases
API
Help

Dataset Information

16 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Power-Hop: A Pervasive Observation for Real Complex Networks.

ABSTRACT: Complex networks have been shown to exhibit universal properties, with one of the most consistent patterns being the scale-free degree distribution, but are there regularities obeyed by the r-hop neighborhood in real networks? We answer this question by identifying another power-law pattern that describes the relationship between the fractions of node pairs C(r) within r hops and the hop count r. This scale-free distribution is pervasive and describes a large variety of networks, ranging from social and urban to technological and biological networks. In particular, inspired by the definition of the fractal correlation dimension D2 on a point-set, we consider the hop-count r to be the underlying distance metric between two vertices of the network, and we examine the scaling of C(r) with r. We find that this relationship follows a power-law in real networks within the range 2 ≤ r ≤ d, where d is the effective diameter of the network, that is, the 90-th percentile distance. We term this relationship as power-hop and the corresponding power-law exponent as power-hop exponent h. We provide theoretical justification for this pattern under successful existing network models, while we analyze a large set of real and synthetic network datasets and we show the pervasiveness of the power-hop.

SUBMITTER: Papalexakis E

PROVIDER: S-EPMC4790966 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks.

Project description:Body Area Networks (BANs) consist of various sensors which gather patient's vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol.

| S-EPMC4714909 | biostudies-literature

Real-time observation of light-controlled transcription in living cells

Project description:Gene expression is tightly regulated in space and time. To dissect this process with high temporal resolution, we introduce an optogenetic tool termed BLInCR (Blue Light-Induced Chromatin Recruitment) that combines rapid and reversible light-dependent recruitment of effector proteins with a real-time readout for transcription. We used BLInCR to control the activity of a reporter gene cluster in the human osteosarcoma cell line U2OS by reversibly recruiting the viral transactivator VP16. RNA production was detectable ~2 minutes after VP16 recruitment and readily decreased when VP16 dissociated from the cluster in the absence of light. Quantitative assessment of the activation process revealed biphasic activation kinetics with a pronounced early phase in cells treated with the histone deacetylase inhibitor SAHA. Comparison with kinetic models for transcription activation suggests that the gene cluster undergoes a maturation process when activated. We anticipate that BLInCR will facilitate the study of transcription dynamics in living cells.

2017-11-22 | GSE103868 | GEO

Two universal physical principles shape the power-law statistics of real-world networks.

Project description:The study of complex networks has pursued an understanding of macroscopic behaviour by focusing on power-laws in microscopic observables. Here, we uncover two universal fundamental physical principles that are at the basis of complex network generation. These principles together predict the generic emergence of deviations from ideal power laws, which were previously discussed away by reference to the thermodynamic limit. Our approach proposes a paradigm shift in the physics of complex networks, toward the use of power-law deviations to infer meso-scale structure from macroscopic observations.

| S-EPMC4512011 | biostudies-other

Real-time observation of multiple-protein complex formation with single-molecule FRET.

Project description:Current single-molecule techniques do not permit the real-time observation of multiple proteins interacting closely with each other. We here report an approach enabling us to determine the single-molecule fluorescence resonance energy transfer (FRET) kinetics of multiple protein-protein interactions occurring far below the diffraction limit. We observe a strongly cooperative formation of multimeric soluble N-ethylmaleimide-sensitive factor attachment protein receptor (SNARE) complexes, which suggests that formation of the first SNARE complex triggers a cascade of SNARE complex formation.

| S-EPMC3773174 | biostudies-literature

Real-Time Observation of Target Search by the CRISPR Surveillance Complex Cascade.

Project description:CRISPR-Cas systems defend bacteria and archaea against infection by bacteriophage and other threats. The central component of these systems are surveillance complexes that use guide RNAs to bind specific regions of foreign nucleic acids, marking them for destruction. Surveillance complexes must locate targets rapidly to ensure timely immune response, but the mechanism of this search process remains unclear. Here, we used single-molecule FRET to visualize how the type I-E surveillance complex Cascade searches DNA in real time. Cascade rapidly and randomly samples DNA through nonspecific electrostatic contacts, pausing at short PAM recognition sites that may be adjacent to the target. We identify Cascade motifs that are essential for either nonspecific sampling or positioning and readout of the PAM. Our findings provide a comprehensive structural and kinetic model for the Cascade target-search mechanism, revealing how CRISPR surveillance complexes can rapidly search large amounts of genetic material en route to target recognition.

| S-EPMC5753800 | biostudies-literature

Interpreting the pervasive observation of U-shaped Site Frequency Spectra.

Project description:The standard neutral model of molecular evolution has traditionally been used as the null model for population genomics. We gathered a collection of 45 genome-wide site frequency spectra from a diverse set of species, most of which display an excess of low and high frequency variants compared to the expectation of the standard neutral model, resulting in U-shaped spectra. We show that multiple merger coalescent models often provide a better fit to these observations than the standard Kingman coalescent. Hence, in many circumstances these under-utilized models may serve as the more appropriate reference for genomic analyses. We further discuss the underlying evolutionary processes that may result in the widespread U-shape of frequency spectra.

| S-EPMC10072462 | biostudies-literature

The geometric nature of weights in real complex networks.

Project description:The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of their complex topologies, this hypothesis yields the recipe for sustainable Internet's routing protocols, sheds light on the hierarchical organization of biochemical pathways in cells, and allows for a rich characterization of the evolution of international trade. Here we present empirical evidence that this geometric interpretation also applies to the weighted organization of real complex networks. We introduce a very general and versatile model and use it to quantify the level of coupling between their topology, their weights and an underlying metric space. Our model accurately reproduces both their topology and their weights, and our results suggest that the formation of connections and the assignment of their magnitude are ruled by different processes.

| S-EPMC5253659 | biostudies-literature

Generalised power graph compression reveals dominant relationship patterns in complex networks.

Project description:We introduce a framework for the discovery of dominant relationship patterns in complex networks, by compressing the networks into power graphs with overlapping power nodes. When paired with enrichment analysis of node classification terms, the most compressible sets of edges provide a highly informative sketch of the dominant relationship patterns that define the network. In addition, this procedure also gives rise to a novel, link-based definition of overlapping node communities in which nodes are defined by their relationships with sets of other nodes, rather than through connections within the community. We show that this completely general approach can be applied to undirected, directed, and bipartite networks, yielding valuable insights into the large-scale structure of real-world networks, including social networks and food webs. Our approach therefore provides a novel way in which network architecture can be studied, defined and classified.

| S-EPMC3964517 | biostudies-other

Deciphering the global organization of clustering in real complex networks.

Project description: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.

| S-EPMC3755293 | biostudies-literature

A method for creating complex real-world networks using ESRI Shapefiles.

Project description:A classic optimization problem with many real-world applications is optimal route search in graphs or networks. Graphical networks resembling real world networks are an important requirement for these studies. Python packages NetworkX and OSMnx are probably the most popular approaches in industry for creating and analyzing real world graphical networks using ESRI Shapefiles (Geospatial Vector Data). However, creating such a network is a complex and tedious process as these packages require the input data to be in a specific format. In this study,•We outline a flexible method that can be used to easily create graphical network representations in NetworkX or OSMnx using road network topology data stored in ESRI Shapefiles.•A detailed step-by-step process is outlined to successfully transform the ESRI Shapefile data into the compatible format for graph analysis libraries like OSMnx and NetworkX.•A data cleaning strategy is suggested to reduce resource consumption without distorting the actual structure of the graph.This method will allow researchers to efficiently generate graphical networks and validate their theories by evaluating their efficiencies using real-world network data of different sizes and topologies. This method could benefit, but is not limited to, research areas such as Advanced Transportation Systems (ATS), Graph Neural Networks (GNN), Multi-Objective Genetic Algorithms, to mention a few.

| S-EPMC10587512 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data