In information theory, the graph entropy is a measure of the information rate achievable by communicating symbols over a channel in which certain pairs...

probabilities of the symbols. Entropy estimation Entropy power inequality Fisher information Graph entropy Hamming distance History of entropy History of information...

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...

Maximum-entropy random graph models are random graph models used to study complex networks subject to the principle of maximum entropy under a set of structural...

measuring the exponential rate of volume growth of a Riemannian metric Graph entropy, a measure of the information rate achievable by communicating symbols...

undirected graphs and related entropies. Birkhäuser. p. 380. ISBN 978-0-8176-4903-6. Chung, Zhao, Fan, Wenbo (2010). "PageRank and Random Walks on Graphs". Fete...

thermodynamics, a temperature–entropy (T–s) diagram is a thermodynamic diagram used to visualize changes to temperature (T ) and specific entropy (s) during a thermodynamic...

mean Log semiring Preferred number Semi-log plot Order of magnitude Entropy Entropy (information theory) pH Richter magnitude scale "Slide Rule Sense:...

Entropy is a scientific concept, most commonly associated with states of disorder, randomness, or uncertainty. The term and the concept are used in diverse...

to normality. It is also known as negative entropy or syntropy. The concept and phrase "negative entropy" was introduced by Erwin Schrödinger in his...

is a new type of graph product, called the zig-zag product. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly)...

Jitesh; Adibi, Jafar (2005). "Discovering important nodes through graph entropy the case of Enron email database". Proceedings of the 3rd international...

In information theory, the binary entropy function, denoted H ⁡ ( p ) {\displaystyle \operatorname {H} (p)} or H b ⁡ ( p ) {\displaystyle \operatorname...

In statistics and information theory, a maximum entropy probability distribution has entropy that is at least as great as that of all other members of...

graph from an initial one by a complex change, such as: transpose graph; complement graph; line graph; graph minor; graph rewriting; power of graph;...

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...

mathematical field of graph theory, the Erdős–Rényi model refers to one of two closely related models for generating random graphs or the evolution of a...

In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability...

using a temperature–entropy diagram (T–S diagram), in which the thermodynamic state is specified by a point on a graph with entropy (S) as the horizontal...

equation is shown in the graph in Figure 1. Each curve is called an isotherm, meaning a curve at a same temperature T. Such graphs are termed indicator diagrams...

liquid, and part vapor, and by using a three-dimensional volume-entropy-internal energy graph, Gibbs was able to determine three states of equilibrium, i...

called graphs, and their properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, are calculated...

In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position...

In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...

A spatial network (sometimes also geometric graph) is a graph in which the vertices or edges are spatial elements associated with geometric objects, i...

In theoretical computer science, graph theory, and mathematics, the conductance is a parameter of a Markov chain that is closely tied to its mixing time...

transformation which converts random graphs to their edge-dual graphs (or line graphs) produces an ensemble of graphs with nearly the same degree distribution...

2007.913132 Costa, J.A.; Hero, A.O. (2004), Geodesic entropic graphs for dimension and entropy estimation in manifold learning. In Signal Processing...

network theory, the Braunstein–Ghosh–Severini entropy (BGS entropy) of a network is the von Neumann entropy of a density matrix given by a normalized Laplacian...

The Hierarchical navigable small world (HNSW) algorithm is a graph-based approximate nearest neighbor search technique used in many vector databases....