Results 51 to 60 of about 113,956 (308)
Deep Learning Techniques for Community Detection in Social Networks
Graph embedding is an effective yet efficient way to convert graph data into a low dimensional space. In recent years, deep learning has applied on graph embedding and shown outstanding performance.
Ling Wu+4 more
doaj +1 more source
On the Inverse of Forward Adjacency Matrix
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the conventional incidence matrix, but in a slightly different manner. This matrix has only 0, 1 or -1 as its elements.
Mukherjee, Pritam, Satish, L.
openaire +2 more sources
MET variants in the N‐lobe of the kinase domain, found in hereditary papillary renal cell carcinoma, require ligand stimulation to promote cell transformation, in contrast to other RTK variants. This suggests that HGF expression in the microenvironment is important for tumor growth in such patients. Their sensitivity to MET inhibitors opens the way for
Célia Guérin+14 more
wiley +1 more source
KAMG: A Tool for Converting Blood Ties and Affinity Ties into Adjacency Matrices
Kinship Adjacency Matrix Generator (KAMG) is a browser-based software for creating adjacency matrices using the information of kinship ties. Specifically, it is capable of converting the family trees in the format of GEDCOM files into adjacency matrices ...
Hang Xiong, Pin Xiong, Hui Xiong
doaj +1 more source
Factorization threshold models for scale-free networks generation [PDF]
Many real networks such as the World Wide Web, financial, biological, citation and social networks have a power-law degree distribution. Networks with this feature are also called scale-free.
Artikov, Akmal+3 more
core +2 more sources
Vertex colouring using the adjacency matrix [PDF]
Recently, graph theory is one of the most rapidly developing sciences. Graphs in its applications are generally used to represent discrete objects and relationships between these objects. The visual representation of a graph is to declare an object as a vertex, while the relationship between objects is expressed as an edge. One topic in graph theory is
Ika Hesti Agustin+4 more
openaire +1 more source
Adverse prognosis gene expression patterns in metastatic castration‐resistant prostate cancer
We aggregated a cohort of 1012 mCRPC tissue samples from 769 patients and investigated the association of gene expression‐based pathways with clinical outcomes. Loss of AR signaling, high proliferation, and a glycolytic phenotype were independently prognostic for poor outcomes, and an adverse transcriptional feature score incorporating these pathways ...
Marina N. Sharifi+26 more
wiley +1 more source
A new matrix representation of multidigraphs
In this article, we introduce a new matrix associated with a multidigraph, named as the complex adjacency matrix. We study the spectral properties of bipartite multidigraphs corresponding to the complex adjacency matrix.
Sasmita Barik, Gopinath Sahoo
doaj +1 more source
Contribution of directedness in graph spectra
In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
On the convergence of the Fitness-Complexity Algorithm [PDF]
We investigate the convergence properties of an algorithm which has been recently proposed to measure the competitiveness of countries and the quality of their exported products. These quantities are called respectively Fitness F and Complexity Q.
Pietronero, Luciano+2 more
core +1 more source