Results 241 to 250 of about 942,096 (280)

Prodeg type Shannon graph entropies with closed forms bounds and QSPR modeling. [PDF]

Sci Rep
Alsharafi M, Zeren Y.
europepmc   +1 more source

Ramanujan expander networks for authenticated grayscale image encryption. [PDF]

PLoS One
Razzaque A, Razaq A, Alghazzawi D, Ramzan M, Khalifa HAE.   +4 more
europepmc   +1 more source

Entropy of the resting state cortex in epilepsy. [PDF]

Biomed Phys Eng Express
Kaur K, O'Brien-Cairney J, Singh G, Upadhya M, Chakraborty A, Chandra SP, Prüss H, Kornau HC, Schmitz D, Woodhall G, Rosch R, Angelova M, Seri S, Tripathi M, Wright SK, Witton C.   +15 more
europepmc   +1 more source

Molecular dynamics of deuterium plasma on TiB₂ sputtering in tokamak wall surfaces for Shannon entropy of computation. [PDF]

Sci Rep
Pahsa A.
europepmc   +1 more source

Permutation Entropy for Graph Signals [PDF]

IEEE Transactions on Signal and Information Processing Over Networks, 2022
Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (one-dimensional data). Some of these entropy metrics can be generalised to data on periodic structures such as a grid or lattice pattern (two-dimensional data) using its symmetry, thus enabling their application to images.
Chao Tan, Javier Escudero, John Stewart Fabila-Carrasco   +2 more
exaly   +6 more sources

Generalized Graph Entropies

Complexity, 2011
AbstractThis article deals with generalized entropies for graphs. These entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements (e.g., vertices) of the graph. We introduce a new class of generalized measures, develop their properties, compute the measures for selected
Matthias Dehmer, Abbe Mowshowitz
exaly   +3 more sources

Entropy and the Complexity of Graphs Revisited [PDF]

Entropy, 2012
This paper presents a taxonomy and overview of approaches to the measurement of graph and network complexity. The taxonomy distinguishes between deterministic (e.g., Kolmogorov complexity) and probabilistic approaches with a view to placing entropy-based probabilistic measurement in context.
Matthias Dehmer, Abbe Mowshowitz
exaly   +5 more sources

The Hosoya Entropy of Graphs Revisited [PDF]

Symmetry, 2019
In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish connections between H-entropy and automorphisms of graphs. In particular, we determine the H-entropy of graphs whose automorphism group has exactly two orbits, and characterize some classes of graphs with zero H-entropy.
Modjtaba Ghorbani, Matthias Dehmer, Abbe Mowshowitz   +2 more
exaly   +7 more sources

Some of the next articles are maybe not open access.

Related searches:

Graphs that Split Entropies

SIAM Journal on Discrete Mathematics, 1988
The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This concept is at the core of a new bounding technique for graph covering problems and has furnished the best known bounds for the problem of perfect hashing.
KORNER, JANOS, K. Marton
openaire   +1 more source

A History of Graph Entropy Measures

Information Sciences, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthias Dehmer, Abbe Mowshowitz
exaly   +3 more sources