Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

The H-index of a network node and its relation to degree and coreness.

ABSTRACT: Identifying influential nodes in dynamical processes is crucial in understanding network structure and function. Degree, H-index and coreness are widely used metrics, but previously treated as unrelated. Here we show their relation by constructing an operator , in terms of which degree, H-index and coreness are the initial, intermediate and steady states of the sequences, respectively. We obtain a family of H-indices that can be used to measure a node's importance. We also prove that the convergence to coreness can be guaranteed even under an asynchronous updating process, allowing a decentralized local method of calculating a node's coreness in large-scale evolving networks. Numerical analyses of the susceptible-infected-removed spreading dynamics on disparate real networks suggest that the H-index is a good tradeoff that in many cases can better quantify node influence than either degree or coreness.

SUBMITTER: Lu L

PROVIDER: S-EPMC4729922 | biostudies-literature | 2016 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

The H-index of a network node and its relation to degree and coreness.

Lü Linyuan L Zhou Tao T Zhang Qian-Ming QM Stanley H Eugene HE

Nature communications 20160112

Identifying influential nodes in dynamical processes is crucial in understanding network structure and function. Degree, H-index and coreness are widely used metrics, but previously treated as unrelated. Here we show their relation by constructing an operator , in terms of which degree, H-index and coreness are the initial, intermediate and steady states of the sequences, respectively. We obtain a family of H-indices that can be used to measure a node's importance. We also prove that the converg ...[more]

PMID: 26754161

Similar Datasets

Project description:Fluid intelligence is an individual's innate ability to cope with complex situations and is gradually reduced across adults aging. The realization of fluid intelligence requires the simultaneous activity of multiple brain regions and depends on the structural connection of distributed brain regions. Uncovering the structural features of brain connections associated with fluid intelligence decline will provide reference for the development of intervention and treatment programs for cognitive decline. Using structural magnetic resonance imaging data of 454 healthy participants (18-87 years) from the Cam-CAN dataset, we constructed structural similarity network for each participant and calculated the node degree. Spearman correlation analysis showed that age was positively correlated with degree centrality in the cingulate cortex, left insula and subcortical regions, while negatively correlated with that in the orbito-frontal cortex, right middle temporal and precentral regions. Partial least squares (PLS) regression showed that the first PLS components explained 32 % (second PLS component: 20 %, p perm < 0.001) of the variance in fluid intelligence. Additionally, the degree centralities of anterior insula, supplementary motor area, prefrontal, orbito-frontal and anterior cingulate cortices, which are critical nodes of the multiple-demand network (MDN), were linked to fluid intelligence. Increased degree centrality in anterior cingulate cortex and left insula partially mediated age-related decline in fluid intelligence. Collectively, these findings suggest that the structural stability of MDN might contribute to the maintenance of fluid intelligence.

| S-EPMC11409069 | biostudies-literature

Low-diameter topic-based pub/sub overlay network construction with minimum-maximum node degree.

Project description:In the construction of effective and scalable overlay networks, publish/subscribe (pub/sub) network designers prefer to keep the diameter and maximum node degree of the network low. However, existing algorithms are not capable of simultaneously decreasing the maximum node degree and the network diameter. To address this issue in an overlay network with various topics, we present herein a heuristic algorithm, called the constant-diameter minimum-maximum degree (CD-MAX), which decreases the maximum node degree and maintains the diameter of the overlay network at two as the highest. The proposed algorithm based on the greedy merge algorithm selects the node with the minimum number of neighbors. The output of the CD-MAX algorithm is enhanced by applying a refinement stage through the CD-MAX-Ref algorithm, which further improves the maximum node degrees. The numerical results of the algorithm simulation indicate that the CD-MAX and CD-MAX-Ref algorithms improve the maximum node-degree by up to 64% and run up to four times faster than similar algorithms.

| S-EPMC8157249 | biostudies-literature

Predicting node degree centrality with the node prominence profile.

Project description:Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics.

| S-EPMC4246206 | biostudies-literature

Complications 8 weeks after an obstetric second-degree perineal laceration in relation to body mass index.

Project description:Introduction and hypothesisHow body mass index (BMI) affects pelvic floor function after a second-degree perineal laceration is unknown. The hypothesis of this study is that pelvic floor dysfunction and complications after an obstetric second-degree perineal laceration are more common in women with a higher BMI 8 weeks postpartum.MethodsThis register-based cohort study includes 10,876 primiparous women with an obstetric second-degree perineal laceration between 2014 and 2021. Data were retrieved from the Swedish Perineal Laceration Registry. Outcomes in relation to maternal BMI were urinary incontinence (UI), anal incontinence (AI) and common complications attributable to the laceration. Uni- and multivariate logistic regressions were used for comparison between normal weight (BMI < 24.9, reference), overweight (25.0-29.9) and obese (≥ 30) women.ResultsMultivariate analyses showed an increased risk for UI in both overweight and obese women compared to normal-weight women 8 weeks after a second-degree perineal laceration with an adjusted odds ratio (aOR) of 1.21 (CI 1.02-1.44) and 1.27 (CI 1.13-1.58) respectively. Overweight and obese women had a decreased risk for AI (aOR 0.81, CI 0.68-0.96; aOR 0.72, CI 0.57-0.90 respectively) compared with normal-weight women. No significant differences were found in the univariate analyses over BMI strata concerning complications after perineal laceration.ConclusionsPrimiparous overweight and obese women report less AI and more UI than normal-weight women 8 weeks after a second-degree perineal laceration. No differences were found regarding complications. These findings are new and merit further study to find potential preventive factors and interventions after a second-degree perineal laceration.

| S-EPMC10810915 | biostudies-literature

The probability of edge existence due to node degree: a baseline for network-based predictions.

Project description:Important tasks in biomedical discovery such as predicting gene functions, gene-disease associations, and drug repurposing opportunities are often framed as network edge prediction. The number of edges connecting to a node, termed degree, can vary greatly across nodes in real biomedical networks, and the distribution of degrees varies between networks. If degree strongly influences edge prediction, then imbalance or bias in the distribution of degrees could lead to nonspecific or misleading predictions. We introduce a network permutation framework to quantify the effects of node degree on edge prediction. Our framework decomposes performance into the proportions attributable to degree and the network's specific connections. We discover that performance attributable to factors other than degree is often only a small portion of overall performance. Degree's predictive performance diminishes when the networks used for training and testing-despite measuring the same biological relationships-were generated using distinct techniques and hence have large differences in degree distribution. We introduce the permutation-derived edge prior as the probability that an edge exists based only on degree. The edge prior shows excellent discrimination and calibration for 20 biomedical networks (16 bipartite, 3 undirected, 1 directed), with AUROCs frequently exceeding 0.85. Researchers seeking to predict new or missing edges in biological networks should use the edge prior as a baseline to identify the fraction of performance that is nonspecific because of degree. We released our methods as an open-source Python package (https://github.com/hetio/xswap/).

| S-EPMC9881952 | biostudies-literature

The probability of edge existence due to node degree: a baseline for network-based predictions.

Project description:Important tasks in biomedical discovery such as predicting gene functions, gene-disease associations, and drug repurposing opportunities are often framed as network edge prediction. The number of edges connecting to a node, termed degree, can vary greatly across nodes in real biomedical networks, and the distribution of degrees varies between networks. If degree strongly influences edge prediction, then imbalance or bias in the distribution of degrees could lead to nonspecific or misleading predictions. We introduce a network permutation framework to quantify the effects of node degree on edge prediction. Our framework decomposes performance into the proportions attributable to degree and the network's specific connections using network permutation to generate features that depend only on degree. We discover that performance attributable to factors other than degree is often only a small portion of overall performance. Researchers seeking to predict new or missing edges in biological networks should use our permutation approach to obtain a baseline for performance that may be nonspecific because of degree. We released our methods as an open-source Python package (https://github.com/hetio/xswap/).

| S-EPMC10848215 | biostudies-literature

K-mer Content Changes with Node Degree in Promoter-Enhancer Network of Mouse ES Cells.

Project description:Maps of Hi-C contacts between promoters and enhancers can be analyzed as networks, with cis-regulatory regions as nodes and their interactions as edges. We checked if in the published promoter-enhancer network of mouse embryonic stem (ES) cells the differences in the node type (promoter or enhancer) and the node degree (number of regions interacting with a given promoter or enhancer) are reflected by sequence composition or sequence similarity of the interacting nodes. We used counts of all k-mers (k = 4) to analyze the sequence composition and the Euclidean distance between the k-mer count vectors (k-mer distance) as the measure of sequence (dis)similarity. The results we obtained with 4-mers are interpretable in terms of dinucleotides. Promoters are GC-rich as compared to enhancers, which is known. Enhancers are enriched in scaffold/matrix attachment regions (S/MARs) patterns and depleted of CpGs. Furthermore, we show that promoters are more similar to their interacting enhancers than vice-versa. Most notably, in both promoters and enhancers, the GC content and the CpG count increase with the node degree. As a consequence, enhancers of higher node degree become more similar to promoters, whereas higher degree promoters become less similar to enhancers. We confirmed the key results also for human keratinocytes.

| S-EPMC8347099 | biostudies-literature

Do network synergies facilitates the realization of M&A motivation?: From the perspective of network node degree and strength change.

Project description:The current evaluation of M&A performance lacks consideration of M&A motives. In this paper, we theoretically analyse and empirically test the effect of network synergy generated by M&A on the degree of realization of corporate M&A motives and the mechanism of its effect by constructing an equity network between a listed company and its subsidiaries within the company. The results show that the greater the variation of internal network node degree and strength, the more beneficial it is to promote the degree of realization of corporate M&A motivation; the results of further mechanism of action tests show that the variation of network node degree and strength has significant effects on economies of scale, economies of scope, and transaction costs; Furthermore, the heterogeneity test finds that the effect of variation of network node degree and strength to promote the degree of realization of corporate M&A motivation is more significant in the case of non-cash payment method and related M&A. This paper extends the study of complex networks to the field of M&A and uniquely explains the paradox of the "high failure rate" of M&A and the increasing activity of M&A activities from the perspective of network synergy, which helps to rationalize the M&A behavior of enterprises and further regulate the M&A behavior of listed companies by regulatory authorities.

| S-EPMC10118086 | biostudies-literature

The critical node detection problem in hypergraphs using weighted node degree centrality

Project description:Network analysis is an indispensable part of today’s academic field. Among the different types of networks, the more complex hypergraphs can provide an excellent challenge and new angles for analysis. This study proposes a variant of the critical node detection problem for hypergraphs using weighted node degree centrality as a form of importance metric. An analysis is done on both generated synthetic networks and real-world derived data on the topic of United States House and Senate committees, using a newly designed algorithm. The numerical results show that the combination of the critical node detection on hypergraphs with the weighted node degree centrality provides promising results and the topic is worth exploring further.

| S-EPMC10280579 | biostudies-literature

Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness.

Project description:It is often claimed that the entropy of a network's degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant component robustness to node removal by showing that the former merely sets a lower bound to the latter for randomly configured networks when no other network characteristics are specified. Furthermore, we show that, for networks of fixed expected degree that follow degree distributions of the same form, the degree distribution entropy is not indicative of robustness. By contrast, we show that the remaining degree entropy and robustness have a positive monotonic relationship and give an analytic expression for the remaining degree entropy of the log-normal distribution. We also show that degree-degree correlations are not by themselves indicative of a network's robustness for real networks. We propose an adjustment to how mutual information is measured which better encapsulates structural properties related to robustness.

| S-EPMC9497962 | 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