Related Experiment Video
Updated: Nov 27, 2025

Using Wavelet Entropy to Demonstrate how Mindfulness Practice Increases Coordination between Irregular Cerebral and Cardiac Activities
Published on: May 10, 2017
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs
Philip Tee1,2, George Parisis2, Luc Berthouze2
1Moogsoft Inc, San Francisco, CA 94111, USA.
This study explores graph complexity measures. We found strong correlations between local vertex measures and global entropy in random graphs, suggesting simpler calculations for graph complexity.
Area of Science:
- Graph theory
- Information theory
- Network analysis
Background:
- Combinatoric entropy measures graph complexity using independent sets, but this is computationally intractable (NP-Complete) for large graphs.
- Vertex-level measures offer a computationally feasible alternative for quantifying graph complexity.
- Previous research by Dehmer et al. and Tee et al. highlighted the potential of these local measures.
Purpose of the Study:
- To investigate the fundamental equivalence between local vertex-level complexity measures and global graph entropy measures.
- To determine if computationally accessible local measures can effectively represent global graph entropy.
- To explore the correlation between these measures in a specific class of random graphs.
Main Methods:
- Utilized a greedy algorithm approximation to compute chromatic information, serving as a proxy for Körner entropy.
- Focused analysis on a narrow subset of random graphs to facilitate the investigation.
- Compared results from local vertex-level complexity calculations with global entropy estimations.
Main Results:
- Demonstrated a strong correlation between local vertex-level measures and global entropy measures for the studied subset of random graphs.
- The findings suggest that local measures can effectively approximate global graph entropy in certain contexts.
- Identified potential theoretical underpinnings for the observed strong correlation.
Conclusions:
- Local vertex-level measures show significant promise as computationally efficient proxies for global graph entropy.
- The strong correlation observed supports the utility of these simpler measures in assessing graph complexity.
- Further theoretical work is warranted to fully understand the relationship and its implications across broader graph classes.
More Related Videos
11:15Applications of EEG Neuroimaging Data: Event-related Potentials, Spectral Power, and Multiscale Entropy
Published on: June 27, 2013
11:00Experimental Investigation of Secondary Flow Structures Downstream of a Model Type IV Stent Failure in a 180° Curved Artery Test Section
Published on: July 19, 2016
Related Concept Videos
Entropy
Entropy
When an ideal gas expands isothermally, the disorder in the gas increases. From the molecular perspective, the gas molecules have more volume to move around in.
Consider an infinitesimal step in the expansion, which...
Third Law of Thermodynamics
Entropy and the Second Law of Thermodynamics
The relation between entropy and disorder can be illustrated with the example of the phase change of ice to water. In ice, the molecules are located at specific sites giving a solid state, whereas, in a liquid form, these molecules are much freer to move. The molecular arrangement has therefore become more randomized. Although the change in average...
The Second Law of Thermodynamics
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.