[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (4)

Search Parameters:
Keywords = graph re-wiring

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
16 pages, 716 KiB  
Article
Efficient Graph Representation Learning by Non-Local Information Exchange
by Ziquan Wei, Tingting Dan, Jiaqi Ding and Guorong Wu
Electronics 2025, 14(5), 1047; https://doi.org/10.3390/electronics14051047 - 6 Mar 2025
Viewed by 145
Abstract
Graphs are an effective data structure for characterizing ubiquitous connections as well as evolving behaviors that emerge in inter-wined systems. Limited by the stereotype of node-to-node connections, learning node representations is often confined in a graph diffusion process where local information has been [...] Read more.
Graphs are an effective data structure for characterizing ubiquitous connections as well as evolving behaviors that emerge in inter-wined systems. Limited by the stereotype of node-to-node connections, learning node representations is often confined in a graph diffusion process where local information has been excessively aggregated, as the random walk of graph neural networks (GNN) explores far-reaching neighborhoods layer-by-layer. In this regard, tremendous efforts have been made to alleviate feature over-smoothing issues such that current backbones can lend themselves to be used in a deep network architecture. However, compared to designing a new GNN, less attention has been paid to underlying topology by graph re-wiring, which mitigates not only flaws of the random walk but also the over-smoothing risk incurred by reducing unnecessary diffusion in deep layers. Inspired by the notion of non-local mean techniques in the area of image processing, we propose a non-local information exchange mechanism by establishing an express connection to the distant node, instead of propagating information along the (possibly very long) original pathway node-after-node. Since the process of seeking express connections throughout a graph can be computationally expensive in real-world applications, we propose a re-wiring framework (coined the express messenger wrapper) to progressively incorporate express links in a non-local manner, which allows us to capture multi-scale features without using a very deep model; our approach is thus free of the over-smoothing challenge. We integrate our express messenger wrapper with existing GNN backbones (either using graph convolution or tokenized transformer) and achieve a new record on the Roman-empire dataset as well as in terms of SOTA performance on both homophilous and heterophilous datasets. Full article
(This article belongs to the Special Issue Artificial Intelligence in Graphics and Images)
Show Figures

Figure 1

Figure 1
<p>The relationship between the expressibility of the original and 3 underlying topologies of graphs and modern GNN performance (in node classification accuracy). Different landmarks represent different datasets. Colors denote graph re-wiring methods. Red arrow lines highlight the improvement by our re-wiring method. Red box explains ours preduces an easier graph to classify via changing the topology as nodes with same class denoted by colored oval being more separated. Note that all re-wiring methods are applied with the same baseline hyperparameter.</p>
Full article ">Figure 2
<p>Non-local information exchange mechanism (<b>right</b>), where colors of node denote the distance marked by numbers between a node to the red one, nodes with mixed color denote aggregated node feature by message-passing, solid lines are edges of graph, and dashed lines denote express connections. The technique reminiscent of non-local mean technique for image processing (<b>left</b>), which is able to capture global information by express connections that are denoted by red dashed lines reducing the over-smoothing risk in GNNs. Both ideas integrate information beyond either a spatial or topological neighbor, in order to preserve distinctive feature representations.</p>
Full article ">Figure 3
<p>(<b>left</b>): Illustration of progressive NLE for simulated graph with original adjacency matrix <math display="inline"><semantics> <mi mathvariant="bold">A</mi> </semantics></math> to re-wired topology <math display="inline"><semantics> <mrow> <mi>h</mi> <mi>o</mi> <mi>p</mi> <mo>(</mo> <mi mathvariant="bold">A</mi> <mo>,</mo> <mi>k</mi> <mo>)</mo> </mrow> </semantics></math> (<math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>⋯</mo> </mrow> </semantics></math>). (<b>right</b>): ExM sorts original graph and new graphs cascaded (C-ExM) or aggregated (A-ExM) to input to any GNN. Green arrow indicates the pipeline of an arbitrary GNN.</p>
Full article ">Figure 4
<p>Comparison of re-wiring methods between DropEdge, GDC, and our NLE. NLE can mitigate over-smoothing issues. Compared with previous graph re-wiring methods, over-smoothness is delayed after using NLE. Even though G2GNN or using skip connection almost eliminated smoothed node features, using NLE leads to a larger Dirichlet energy than the original graph topology.</p>
Full article ">Figure 5
<p>Bar plots of performance by using different layer numbers on real data.</p>
Full article ">
23 pages, 5770 KiB  
Article
ENRN: A System for Evaluating Network Resilience against Natural Disasters
by Mohammed J. F. Alenazi
Mathematics 2023, 11(20), 4250; https://doi.org/10.3390/math11204250 - 11 Oct 2023
Cited by 2 | Viewed by 1945
Abstract
The frequency and severity of natural disasters is surging, posing an urgent need for robust communication network infrastructure that is capable of withstanding these events. In this paper, we present a groundbreaking graph-theoretic system designed to evaluate and enhance network resilience in the [...] Read more.
The frequency and severity of natural disasters is surging, posing an urgent need for robust communication network infrastructure that is capable of withstanding these events. In this paper, we present a groundbreaking graph-theoretic system designed to evaluate and enhance network resilience in the face of natural disasters. Our solution harnesses the power of topological robustness metrics, integrating real-time weather data, geographic information, detailed network topology data, advanced resilience algorithms, and continuous network monitoring. The proposed scheme considers four major real-world U.S.-based network providers and evaluates their physical topologies against two major hurricanes. Our novel framework quantifies the important characteristics of network infrastructure; for instance, AT&T is identified to have fared better against Hurricane Ivan (57.98 points) than Hurricane Katrina (39.17 points). We not only provide current insights into network infrastructure resilience, but also uncover valuable findings that shed light on the performance of backbone U.S. networks during hurricanes. Furthermore, our findings provide actionable insights to enrich the overall survivability and functionality of communication networks, mitigating the adverse impacts of natural disasters on communication systems and critical services in terms of improving network resiliency via adding additional nodes and link or rewiring. Full article
(This article belongs to the Special Issue Analytical Frameworks and Methods for Cybersecurity)
Show Figures

Figure 1

Figure 1
<p>Examples of natural disasters affecting a backbone network.</p>
Full article ">Figure 2
<p>Framework of the proposed six-component system.</p>
Full article ">Figure 3
<p>Temporal display of the network states during Hurricane Katrina. (<b>a</b>) AT&amp;T; (<b>b</b>) Sprint; (<b>c</b>) Level3; (<b>d</b>) Internet2.</p>
Full article ">Figure 4
<p>Graphical display of performance metrics of four different networks during Hurricane Katrina. (<b>a</b>) Node failure; (<b>b</b>) link failure; (<b>c</b>) flow robustness; (<b>d</b>) LCC.</p>
Full article ">Figure 5
<p>Temporal display of the network states during Hurricane Ivan. (<b>a</b>) AT&amp;T; (<b>b</b>) Sprint; (<b>c</b>) Level3; (<b>d</b>) Internet2.</p>
Full article ">Figure 6
<p>Graphical display of performance metrics of four different networks during Hurricane Ivan. (<b>a</b>) Node Failure; (<b>b</b>) Link Failure; (<b>c</b>) Flow Robustness; (<b>d</b>) LCC.</p>
Full article ">
29 pages, 7786 KiB  
Article
Functional Connectivity in Developmental Dyslexia during Speed Discrimination
by Tihomir Taskov and Juliana Dushanova
Symmetry 2021, 13(5), 749; https://doi.org/10.3390/sym13050749 - 25 Apr 2021
Cited by 8 | Viewed by 3330
Abstract
A universal signature of developmental dyslexia is literacy acquisition impairments. Besides, dyslexia may be related to deficits in selective spatial attention, in the sensitivity to global visual motion, speed processing, oculomotor coordination, and integration of auditory and visual information. Whether motion-sensitive brain areas [...] Read more.
A universal signature of developmental dyslexia is literacy acquisition impairments. Besides, dyslexia may be related to deficits in selective spatial attention, in the sensitivity to global visual motion, speed processing, oculomotor coordination, and integration of auditory and visual information. Whether motion-sensitive brain areas of children with dyslexia can recognize different speeds of expanded optic flow and segregate the slow-speed from high-speed contrast of motion was a main question of the study. A combined event-related EEG experiment with optic flow visual stimulation and functional frequency-based graph approach (small-world propensity ?) were applied to research the responsiveness of areas, which are sensitive to motion, and also distinguish slow/fast -motion conditions on three groups of children: controls, untrained (pre-D) and trained dyslexics (post-D) with visual intervention programs. Lower ? at ?, ?, ?1-frequencies (low-speed contrast) for controls than other groups represent that the networks rewire, expressed at ? frequencies (both speed contrasts) in the post-D, whose network was most segregated. Functional connectivity nodes have not existed in pre-D at dorsal medial temporal area MT+/V5 (middle, superior temporal gyri), left-hemispheric middle occipital gyrus/visual V2, ventral occipitotemporal (fusiform gyrus/visual V4), ventral intraparietal (supramarginal, angular gyri), derived from ?-frequency network for both conditions. After visual training, compensatory mechanisms appeared to implicate/regain these brain areas in the left hemisphere through plasticity across extended brain networks. Specifically, for high-speed contrast, the nodes were observed in pre-D (?-frequency) and post-D (?2-frequency) relative to controls in hyperactivity of the right dorsolateral prefrontal cortex, which might account for the attentional network and oculomotor control impairments in developmental dyslexia. Full article
Show Figures

Figure 1

Figure 1
<p>The graphs of significantly different frequency networks at the low-speed condition. The nodes covered the EEG sensors. The hubs are the nodes with black color. The links are the most important links: (A, 1st graph) Hubs (strength) in the θ-network at the slow-speed condition of controls: FC3, C2, C3, Cz, CP2, CP3, TP8; (A, 2nd graph) of pre-D: C1-2, C3, C5, CP2, Oz; (A, 3rd graph) of post-D: F8, C3, T7, TP7, C6, CP3, O1; (B, 1st graph) Hubs (BC) in the θ-network of controls: Fz, F7, FT9, C3, P7, P08, O1, Oz; (B, 2nd graph) of pre-D: Fz, FT9, T7, C2, P08, Oz; (B, 3rd graph) of post-D: F8, FT10, C3, T7, P7, Oz. (C, 1st graph) Hubs (str) in the β1-network of controls: C2, C6, CP2, CP4; (C, 2nd graph) of pre-D: C3, Cz, CP2, CP4, P4, PO4; (C, 3rd graph) of post-D: Fz, C3, C6, CP1, CP3, PO3. (D, 1st graph) Hubs (Str) in the γ2-network of controls: FT9, C1-2, Cz, C3; (D, 2nd graph) of pre-D: F3, F7, FT9, C2, C3, Cz, CP2; (D, 3rd graph) of post-D: FC3, FT9, C1-2, Cz.</p>
Full article ">Figure 2
<p>The graphs of significantly different frequency networks at the high-speed condition. (A, 1st graph) Hubs (strength) in the θ-network of controls: F3, Fz, FC4, C1, Cz, CP4; (A, 2nd graph) θ-network of pre-D: AF4, FC5, FT9, C3-4, C1, Cz, Pz, P08; (A, 3rd graph) θ-network of post-D: F3, FC3, F8, TP7, C3, CP1,Pz; (B, 1st graph) Hubs (strength) in the β2-network of controls: FT10, C2, C4, CP2, P4; (B, 2nd graph) β2-network of pre-D: Fz, FC4, C6, CP1-2; (B, 3rd graph) β2-network of post-D: AF4, FC3, FC6, C5, C4, PO4. (C, 1st graph) Hubs (strength) in the γ2-network of controls: F3, FC3-4, FT9, C1, C3, Cz; (C, 2nd graph) γ2-network of pre-D: F3, FT9, C2, C3, Cz, CP2; (C, 3rd graph) γ2-network of post-D: F3, FC3, FT9-10, Cz, CP2, CP4, PO4. (D, 1st graph) Hubs (BC) in the γ2-network for controls: F7, C5, T7, FT10, PO4, Oz; (D, 2nd graph) of pre-D: FT9-10, C1-2, Cz; (D, 3rd graph) γ2-network of post-D: FT9, C2, C3, CP4.</p>
Full article ">Figure A1
<p>Electrode positions according to 10/20 (blue color) and 10/10 (white) international systems.</p>
Full article ">
22 pages, 5893 KiB  
Article
Investigation of Precise Molecular Mechanistic Action of Tobacco-Associated Carcinogen ‘NNK’ Induced Carcinogenesis: A System Biology Approach
by Anukriti, Anupam Dhasmana, Swati Uniyal, Pallavi Somvanshi, Uma Bhardwaj, Meenu Gupta, Shafiul Haque, Mohtashim Lohani, Dhruv Kumar, Janne Ruokolainen and Kavindra Kumar Kesari
Genes 2019, 10(8), 564; https://doi.org/10.3390/genes10080564 - 26 Jul 2019
Cited by 10 | Viewed by 4017
Abstract
Cancer is the second deadliest disease listed by the WHO. One of the major causes of cancer disease is tobacco and consumption possibly due to its main component, 4-(methylnitrosamino)-1-(3-pyridyl)-1-butanone (NNK). A plethora of studies have been conducted in the past aiming to decipher [...] Read more.
Cancer is the second deadliest disease listed by the WHO. One of the major causes of cancer disease is tobacco and consumption possibly due to its main component, 4-(methylnitrosamino)-1-(3-pyridyl)-1-butanone (NNK). A plethora of studies have been conducted in the past aiming to decipher the association of NNK with other diseases. However, it is strongly linked with cancer development. Despite these studies, a clear molecular mechanism and the impact of NNK on various system-level networks is not known. In the present study, system biology tools were employed to understand the key regulatory mechanisms and the perturbations that will happen in the cellular processes due to NNK. To investigate the system level influence of the carcinogen, NNK rewired protein–protein interaction network (PPIN) was generated from 544 reported proteins drawn out from 1317 articles retrieved from PubMed. The noise was removed from PPIN by the method of modulation. Gene ontology (GO) enrichment was performed on the seed proteins extracted from various modules to find the most affected pathways by the genes/proteins. For the modulation, Molecular COmplex DEtection (MCODE) was used to generate 19 modules containing 115 seed proteins. Further, scrutiny of the targeted biomolecules was done by the graph theory and molecular docking. GO enrichment analysis revealed that mostly cell cycle regulatory proteins were affected by NNK. Full article
(This article belongs to the Special Issue The Role of Genotoxicity in Infertility and Cancer Development)
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of the adopted methodology.</p>
Full article ">Figure 2
<p>STRING generated NNK rewired protein–protein interaction network with 534 nodes and 2909 edges.</p>
Full article ">Figure 3
<p>(<b>A</b>) Processes enriched by NNK rewired PPIN. (<b>B</b>) Pathways enriched by NNK rewired PPIN.</p>
Full article ">Figure 4
<p>Characteristic path length distribution: 2971.</p>
Full article ">Figure 5
<p>Node degree distribution following power law fitting y = 61,323x<sup>−0.861</sup> (R-squared 0.722).</p>
Full article ">Figure 6
<p>Average (Avg.) neighborhood connectivity distribution following power law fitting y = 19,838x<sup>0.137</sup> (R-squared 0.253). The average number of neighbors is 15,940.</p>
Full article ">Figure 7
<p>Average (Avg.) clustering coefficient following power law fitting y = 1.326 x<sup>−0.277</sup> (R-squared 0.329). Clustering coefficient distribution of 0.597.</p>
Full article ">Figure 8
<p>Network modules: red circles show the seed proteins and yellow circles are the connectors.</p>
Full article ">Figure 9
<p>Protein–protein interaction network (PPIN) of final seed proteins.</p>
Full article ">Figure 10
<p>ClueGO results of gene ontology (GO) functional enrichment of key proteins.</p>
Full article ">Figure 11
<p>Representation of the pathways enriched and the total number of genes associated with them.</p>
Full article ">Figure 12
<p>Binding interactions of the top three proteins with NNK: (<b>a</b>) CDK7 (−5.93 Kcal/Mol), (<b>b</b>) CCNA1 (−5.6 Kcal/Mol), (<b>c</b>) CDKN1B (−5.42 Kcal/Mol).</p>
Full article ">
Back to TopTop