scispace - formally typeset
Open AccessJournal ArticleDOI

Comparing brain networks of different size and connectivity density using graph theory

TLDR
A number of methods used in social sciences that build on statistics of local network structures including exponential random graph models and motif counting are added, showing that none of the here-investigated methods allows for a reliable and fully unbiased comparison, but some perform better than others.
Abstract
Graph theory is a valuable framework to study the organization of functional and anatomical connections in the brain. Its use for comparing network topologies, however, is not without difficulties. Graph measures may be influenced by the number of nodes (N) and the average degree (k) of the network. The explicit form of that influence depends on the type of network topology, which is usually unknown for experimental data. Direct comparisons of graph measures between empirical networks with different N and/or k can therefore yield spurious results. We list benefits and pitfalls of various approaches that intend to overcome these difficulties. We discuss the initial graph definition of unweighted graphs via fixed thresholds, average degrees or edge densities, and the use of weighted graphs. For instance, choosing a threshold to fix N and k does eliminate size and density effects but may lead to modifications of the network by enforcing (ignoring) non-significant (significant) connections. Opposed to fixing N and k, graph measures are often normalized via random surrogates but, in fact, this may even increase the sensitivity to differences in N and k for the commonly used clustering coefficient and small-world index. To avoid such a bias we tried to estimate the N,k-dependence for empirical networks, which can serve to correct for size effects, if successful. We also add a number of methods used in social sciences that build on statistics of local network structures including exponential random graph models and motif counting. We show that none of the here-investigated methods allows for a reliable and fully unbiased comparison, but some perform better than others.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Modern network science of neurological disorders

TL;DR: Modern network science has revealed fundamental aspects of normal brain-network organization, such as small-world and scale-free patterns, hierarchical modularity, hubs and rich clubs, to use to gain a better understanding of brain disease.
Journal ArticleDOI

GRETNA: a graph theoretical network analysis toolbox for imaging connectomics

TL;DR: It is demonstrated that human brain functional networks exhibit efficient small-world, assortative, hierarchical and modular organizations and possess highly connected hubs and that these findings are robust against different analytical strategies.
Journal ArticleDOI

Models and methods in social network analysis

TL;DR: Models and Methods in Social Network Analysis presents the most important developments in quantitative models and methods for analyzing social network data that have appeared during the 1990s.
Journal ArticleDOI

Graph analysis of the human connectome: promise, progress, and pitfalls.

TL;DR: The notion that brain connectivity can be abstracted to a graph of nodes, representing neural elements linked by edges, representing some measure of structural, functional or causal interaction between nodes, brings connectomic data into the realm of graph theory.
Journal ArticleDOI

A Brain-Wide Study of Age-Related Changes in Functional Connectivity

TL;DR: The results show that aging has a large impact on connectivity within functional networks but also on connectivity between the different functional networks in the brain, and a brain-wide analysis approach seems fundamental in understanding how age affects integration of information.
References
More filters
Journal ArticleDOI

Collective dynamics of small-world networks

TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI

Emergence of Scaling in Random Networks

TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI

Statistical mechanics of complex networks

TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
Journal ArticleDOI

Complex brain networks: graph theoretical analysis of structural and functional systems

TL;DR: This article reviews studies investigating complex brain networks in diverse experimental modalities and provides an accessible introduction to the basic principles of graph theory and highlights the technical challenges and key questions to be addressed by future developments in this rapidly moving field.
Journal ArticleDOI

Complex network measures of brain connectivity: uses and interpretations.

TL;DR: Construction of brain networks from connectivity data is discussed and the most commonly used network measures of structural and functional connectivity are described, which variously detect functional integration and segregation, quantify centrality of individual brain regions or pathways, and test resilience of networks to insult.
Related Papers (5)
Trending Questions (1)
How to compare network topologies using graph theory?

The paper does not provide a definite answer on how to compare network topologies using graph theory. It discusses the challenges and pitfalls involved in comparing networks of different sizes and connectivity densities.