Results 51 to 60 of about 122,412 (281)
EEG-Based Emotion Recognition Using Regularized Graph Neural Networks
, 2020 Electroencephalography (EEG) measures the neuronal activities in different brain regions via electrodes. Many existing studies on EEG-based emotion recognition do not fully exploit the topology of EEG channels.
Miao, Chunyan, Wang, Di, Zhong, Peixiang
core +1 more source
The k-adjacency operators and adjacency Jacobi matrix on distance-regular graphs
Boletín de la Sociedad Matemática Mexicana, 2023 We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so, the set of the $k$-adjacency operators is recognized as a canonical basis in a certain Hilbert space, where the ...
openaire +2 more sources
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs
IEEE Access, 2017 This paper investigates the spectra of the adjacency matrix and Laplacian matrix for an artificial complex network model-the generalized random graph. We deduce explicit expressions for the first four asymptotic spectral moments of the adjacency matrix ...
Qun Liu, Zhishan Dong, En Wang
doaj +1 more source
Spatial‐temporal slowfast graph convolutional network for skeleton‐based action recognition
IET Computer Vision, 2022 In skeleton‐based action recognition, the graph convolutional network (GCN) has achieved great success. Modelling skeleton data in a suitable spatial‐temporal way and designing the adjacency matrix are crucial aspects for GCN‐based methods to capture ...
Zheng Fang +4 more
doaj +1 more source
Predicting criticality and dynamic range in complex networks: effects of topology
, 2010 The collective dynamics of a network of coupled excitable systems in response to an external stimulus depends on the topology of the connections in the network.
Daniel B. Larremore +5 more
core +1 more source
Molecular Oncology, EarlyView.Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang +12 more
wiley +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
Journal of Hebei University of Science and Technology, 2019 In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n－4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source
Spectral radii of sparse random matrices
, 2020 We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices. In particular,
Benaych-Georges, Florent +2 more
core +3 more sources
Matchings on trees and the adjacency matrix: A determinantal viewpoint
Random Structures & Algorithms, 2023 AbstractLet be a finite tree. For any matching of , let be the set of vertices uncovered by . Let be a uniform random maximum size matching of . In this paper, we analyze the structure of . We first show that is a determinantal process. We also show that for most vertices of , the process in a small neighborhood of that vertex can be well ...
openaire +3 more sources