Live briefing
Everything about Network entropy
Measure of connection disorder in a network
In network science, the network entropy is a disorder measure derived from information theory to describe the level of randomness and the amount of information encoded in a graph. It is a relevant metric to quantitatively characterize real complex networks and can also be used to quantify network complexity Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Network entropyA 5-minute orientation
- Skim a recent paper: A neural network model for high entropy alloy designInfluential work since 2022
- Pick up a classic book: Cross-entropy minimization given fully-decomposable subset and aggregate constraintsThe most-reprinted book on the subject
- Read the landmark paper: Causal Network Inference by Optimal Causation EntropyCited 197 times
- Go sideways: Algebraic signal processingA closely related topic
- Go sideways: Hyperbolic geometric graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Causal Network Inference by Optimal Causation Entropy
Entropy of network ensembles
The entropy of randomized network ensembles
An Entropy-Based Network Anomaly Detection Method
Differential network entropy reveals cancer system hallmarks
An entropy approach to data collection network design
Entropy maximisation and queueing network models
Rainfall network design using kriging and entropy
🆕 Influential since 2022
A neural network model for high entropy alloy design
Engineering high-entropy alloy nanowires network for alcohol electrooxidation
Maximum Entropy Subspace Clustering Network
Identifying the critical states and dynamic network biomarkers of cancers based on network entropy
Identification of Network Topology Variations Based on Spectral Entropy
📚 Books worth reading
- 📕Cross-entropy minimization given fully-decomposable subset and aggregate constraintsJohn E. Shore · 1981
Information theoretic neural computationRyotaro Kamimura · 2002
Nonlinear Power Flow Control DesignRush D. Robinett III · 2011
Information Dynamics and Open SystemsRoman S. Ingarden · 2010- 📕Radar Waveform Design Based on Optimization TheoryGuolong Cui, Antonio De Maio · 2020
- 📕Accuracy of an information-theoretic, light-load approximation for the M/M/1 busy period probability densityJohn E Shore · 1979
- 📕Cross-entropy minimization given fully-decomposable subset and aggregate constraintsJohn E Shore · 1981
- 📕Cross-entropy minimization given fully-decomposable subset and aggregate constraintsJohn E Shore · 1981
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Algebraic signal processing Algebraic signal processing (ASP) is an emerging area of theoretical signal processing (SP). In the algebraic theory of signal processing, a set of filters…
- Hyperbolic geometric graph A hyperbolic geometric graph (HGG) or hyperbolic geometric network (HGN) is a special type of spatial network where (1) latent coordinates of nodes are…
- Maximal entropy random walk A maximal entropy random walk (MERW) is a popular type of biased random walk on a graph, in which transition probabilities are chosen accordingly to the…
- Biased random walk on a graph In network science, a biased random walk on a graph is a time path process in which an evolving variable jumps from its current state to one of various…
- Exponential family random graph models Exponential family random graph models (ERGMs) are a set of statistical models used to study the structure and patterns within networks, such as those…
- Soft configuration model In applied mathematics, the soft configuration model (SCM) is a random graph model subject to the principle of maximum entropy under constraints on the…
- Katz centrality In graph theory, the Katz centrality or alpha centrality of a node is a measure of centrality in a network. It was introduced by Leo Katz in 1953 and is…
- Configuration model In network science, the Configuration Model is a family of random graph models designed to generate networks from a given degree sequence. Unlike simpler…