Skip to main content
100%

Gist 55ada79d9d2de1b08a4437b81a540f9f

✓ Published0🌍 Public
Aakeshavan
Last edited Sep 6, 2017
Created on Sep 6, 2017

A force-directed graph visualization displays a network of brain connectivity nodes, where each node represents a region labeled with hierarchical identifiers and edges are weighted by correlation values. The graph uses a circular layout with curved links connecting nodes, with edge thickness and color mapping to the numerical weights, which include both positive and negative correlations. The visualization, titled "DMN connectogram," is designed to show the default mode network connectivity patterns, with nodes positioned around a circle and linked by curved bezier edges that encode connection strength. Node sizes vary based on their degree of connectivity, and the layout emphasizes the modular structure of the network through spatial grouping. The negative weights (e.g., -1.46, -2.46) suggest inhibitory or anticorrelated connections, while positive weights indicate excitatory links, providing a comprehensive view of the network's functional architecture.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 5075781b66de8d9e3eb0d804ce180a58

This visualization displays a brain connectivity network as a node-link diagram, where each node represents a cortical region labeled with Desikan-Killiany atlas terminology (e.g., lh-bankssts, rh-precentral) and sized by its import count. Edges connect regions based on structural connections, with the layout revealing clusters of functionally related brain areas. The visualization uses a hierarchical naming convention to organize regions by hemisphere and lobe, with connection strengths implied by the size values shown in the JSON data. The interactive graph allows exploration of the brain's structural connectivity patterns across 68 cortical regions.

Aakeshavan
83% match
Loading thumbnail…

Gist f64d40bf6e1e0e370d9b2ad12e696c45

A force-directed graph visualizes module dependencies from brain imaging data, where each node represents a cortical region and links show import relationships. The network is computed using a force layout, with node size encoding degree (module size) and colors distinguishing different anatomical lobes. Hovering highlights connections, and the graph can be explored interactively to reveal the hierarchical structure of brain connectivity.

Aakeshavan
83% match
Loading thumbnail…

Gist c7d658714f20f14abd2bcabc44577b36

This visualization is a force-directed graph showing the modular structure of brain connectivity data from a diffusion-weighted imaging (DWI) session. The JSON file describes nodes (brain regions) and their directed connections, encoded using hierarchical identifiers that group regions into modules. Node size represents degree (number of connections), and the network layout arranges nodes spatially to reveal clusters of densely interconnected regions. The graph emphasizes the modular organization of brain connectivity, with module membership visually separable by the hierarchical naming pattern and connection density.

Aakeshavan
82% match
Loading thumbnail…

Gist d41ea27d12bc9ff61b37319170e10898

This example visualizes hierarchical clustering of a brain connectivity graph using a force-directed layout. It loads a Desikan parcellation graph from a GraphML file, computes linkage clusters with scipy’s `linkage` and `fcluster`, and encodes cluster memberships at six levels into node names. The interactive rendering, embedded via an iframe from CodePen, uses d3.forceSimulation to display the nodes and their connections, with node sizes reflecting connection counts and names combining cluster labels and anatomical region names.

Aakeshavan
76% match
Loading thumbnail…

Gist 496aa2e3537e41062537

This visualization displays a force-directed network graph of 200 nodes and their weighted connections, rendered as an SVG. Node positions are computed using d3.layout.force with a short link distance of 10 and a link strength of 2, creating a tightly clustered layout. Each node is represented by a circle colored with the d3 category20 palette, and links are drawn as thin gray lines. The dataset contains numeric node identifiers and weighted edges, suggesting a relationship or similarity graph, with data loaded from JSON and rendered using D3 v3.

Aaht
76% match
Loading thumbnail…

Gist 5ba4f4c088bc7690ffc7cc7417736203

The visualization displays resting-state fMRI data across seven brain networks, showing how functional connectivity patterns are organized in the brain. It uses a force-directed layout to position nodes representing brain regions, with edges indicating connectivity strength between them. The code relies on numpy and scipy for data processing, while the rendering pipeline employs matplotlib for generating the network plot, with pylab enabling interactive plotting in a Jupyter notebook environment.

Aakeshavan
75% match
Loading thumbnail…

Gist 1e296721b61bae725016

This visualization displays functional connectivity between brain regions as a circular node-link diagram, with edges colored by PLS regression coefficients relating resting-state fMRI correlations to disability scores (EDSS) in multiple sclerosis patients. The code converts correlation values to z-scores via Fisher transform, then applies PLSRegression to extract predictive components. Using MNE-Python’s `circular_layout` and `plot_connectivity_circle`, it arranges region names around a ring, styles nodes with seaborn color palettes, and encodes edge weights through a custom colormap with a colorbar. The underlying data is loaded from a CSV of freesurfer parcellations and connectivity metrics.

Aakeshavan
74% match
Loading thumbnail…

13.6 Network data

This network visualization shows the structure of a small graph with 25 nodes, using a force-directed layout to reveal the connections between them. The nodes are arranged spatially based on their relationships, with edges drawn as straight lines between connected vertices. The visualization is built from data stored in multiple formats: a GraphML file containing Zachary’s classic karate club network (with nodes labeled as "Mr. Hi" or "Officer" to represent two factions), plus adjacency and edge-list files describing a smaller network. The layout algorithm places highly connected nodes near each other, making clusters and hub nodes visually apparent. Node positions suggest communities, while edge density and path lengths communicate the structure of the social relationships encoded in the data.

Aandyreagan
73% match