The trees and the forest: Characterization of complex brain networks with minimum spanning trees.

In recent years there has been a shift in focus from the study of local, mostly task-related activation to the exploration of the organization and fun...
941KB Sizes 3 Downloads 5 Views

Recommend Documents

Not seeing the forest for the trees: size of the minimum spanning trees (MSTs) forest and branch significance in MST-based phylogenetic analysis.
Trees, including minimum spanning trees (MSTs), are commonly used in phylogenetic studies. But, for the research community, it may be unclear that the presented tree is just a hypothesis, chosen from among many possible alternatives. In this scenario

Degree sums and dense spanning trees.
Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices t

On the number of spanning trees of graphs.
We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), first Zagreb index (M 1), and Randić index (R -1).

Q&A: The brain under a mesoscope: the forest and the trees.
Neurons relevant to a particular behavior are often widely dispersed across the brain. To record activity in groups of individual neurons that might be distributed across large distances, neuroscientists and optical engineers have been developing a n

An efficient distributed algorithm for constructing spanning trees in wireless sensor networks.
Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as th