This page has only limited features, please log in for full access.

Dr. Chen Mo
University of Maryland, Baltimore

Basic Info

Basic Info is private.

Research Keywords & Expertise

0 Biostatistics
0 Clinical Trial Analysis
0 High Throughput Data Analysis
0 Genomic Data Analysis
0 Imaging Data Analysis

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

Doctor of Public Health in Biostatistics, postdoctoral fellow at University of Maryland, Baltimore.

Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 23 August 2020 in Entropy
Reads 0
Downloads 0

We propose a new metric to characterize the complexity of weighted complex networks. Weighted complex networks represent a highly organized interactive process, for example, co-varying returns between stocks (financial networks) and coordination between brain regions (brain connectivity networks). Although network entropy methods have been developed for binary networks, the measurement of non-randomness and complexity for large weighted networks remains challenging. We develop a new analytical framework to measure the complexity of a weighted network via graph embedding and point pattern analysis techniques in order to address this unmet need. We first perform graph embedding to project all nodes of the weighted adjacency matrix to a low dimensional vector space. Next, we analyze the point distribution pattern in the projected space, and measure its deviation from the complete spatial randomness. We evaluate our method via extensive simulation studies and find that our method can sensitively detect the difference of complexity and is robust to noise. Last, we apply the approach to a functional magnetic resonance imaging study and compare the complexity metrics of functional brain connectivity networks from 124 patients with schizophrenia and 103 healthy controls. The results show that the brain circuitry is more organized in healthy controls than schizophrenic patients for male subjects while the difference is minimal in female subjects. These findings are well aligned with the established sex difference in schizophrenia.

ACS Style

Shuo Chen; Zhen Zhang; Chen Mo; Qiong Wu; Peter Kochunov; L. Elliot Hong. Characterizing the Complexity of Weighted Networks via Graph Embedding and Point Pattern Analysis. Entropy 2020, 22, 925 .

AMA Style

Shuo Chen, Zhen Zhang, Chen Mo, Qiong Wu, Peter Kochunov, L. Elliot Hong. Characterizing the Complexity of Weighted Networks via Graph Embedding and Point Pattern Analysis. Entropy. 2020; 22 (9):925.

Chicago/Turabian Style

Shuo Chen; Zhen Zhang; Chen Mo; Qiong Wu; Peter Kochunov; L. Elliot Hong. 2020. "Characterizing the Complexity of Weighted Networks via Graph Embedding and Point Pattern Analysis." Entropy 22, no. 9: 925.