[HTML][HTML] Graph theoretic analysis of structural connectivity across the spectrum of Alzheimer's disease: The importance of graph creation methods

DJ Phillips, A McGlaughlin, D Ruth, LR Jager… - NeuroImage: Clinical, 2015 - Elsevier
Graph theory is increasingly being used to study brain connectivity across the spectrum of
Alzheimer's disease (AD), but prior findings have been inconsistent, likely reflecting …

Integrated analysis of microbe-host interactions in Crohn's disease reveals potential mechanisms of microbial proteins on host gene expression

P Sudhakar, T Andrighetti, S Verstockt, C Caenepeel… - IScience, 2022 - cell.com
Inflammatory responses of the intestinal epithelial barrier in patients with Crohn's disease
(CD), a chronic inflammatory bowel disease (IBD), are associated with gut microbial …

Algorithms and complexity results for finding graphs with extremal R andić index

RK Kincaid, SJ Kunkler, MD Lamar, DJ Phillips - Networks, 2016 - Wiley Online Library
We show that finding a subgraph realization with the minimum generalized Randić index for
a given base graph and degree sequence is solvable in polynomial time by formulating the …

Symmetry-driven network reconstruction through pseudobalanced coloring optimization

I Leifer, D Phillips, F Sorrentino… - Journal of Statistical …, 2022 - iopscience.iop.org
Symmetries found through automorphisms or graph fibrations provide important insights in
network analysis. Symmetries identify clusters of robust synchronization in the network …

An improved measuring method for the information entropy of network topology

W Li, D Hu, Y Liu - Transactions in GIS, 2018 - Wiley Online Library
The measurement of network topologies is of great significance to the multi‐scale
expression and generalization of maps. The problem encountered in existing metrics is …

Symmetry-inspired analysis of biological networks

I Leifer - 2022 - search.proquest.com
The description of a complex system like gene regulation of a cell or a brain of an animal in
terms of the dynamics of each individual element is an insurmountable task due to the …

Algorithm and Complexity for a Network Assortativity Measure

SJ Kunkler, MD LaMar, RK Kincaid… - arXiv preprint arXiv …, 2013 - arxiv.org
We show that finding a graph realization with the minimum Randi\'c index for a given degree
sequence is solvable in polynomial time by formulating the problem as a minimum weight …