Related Experiment Video
Updated: Apr 22, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community
Binh-Minh Bui-Xuan1, Nick S Jones2
1Laboratoire d'Informatique de Paris 6 , Université Pierre et Marie Curie , Paris, France.
Abstract:
By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2 ), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as a preprocessing, this work gives support to the project of developing heuristic algorithms for detecting dense regions in networks: preprocessing of this kind can accelerate optimization tasks on networks. Our work also suggests a class of empirical conjectures for how structural features of efficient networked systems might scale with system size.
Related Concept Videos
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Methods of Medium Optimization
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Network Function of a Circuit
Graphs of Functions

