Results 11 to 20 of about 942,096 (280)
The Hosoya Entropy of a Graph [PDF]
Entropy, 2015 This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity based on a decomposition of the vertices linked to partial Hosoya polynomials.
Abbe Mowshowitz, Matthias Dehmer
doaj +6 more sources
Graph properties, graph limits, and entropy [PDF]
Journal of Graph Theory, 2017 AbstractWe study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the coloring number, which by well‐known results describes the rate of growth. We study also random graphs and their entropies.
Hatami, H. +2 more
openaire +7 more sources
Dispersion entropy for graph signals [PDF]
Chaos, Solitons & Fractals, 2023 We present a novel method, called Dispersion Entropy for Graph Signals, DEG, as a powerful tool for analysing the irregularity of signals defined on graphs. DEG generalises the classical dispersion entropy concept for univariate time series, enabling its application in diverse domains such as image processing, time series analysis, and network analysis.
John Stewart Fabila-Carrasco +2 more
openaire +3 more sources
Entropy of microcanonical finite-graph ensembles [PDF]
Journal of Physics: Complexity, 2023 The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences.
Tatsuro Kawamoto
doaj +2 more sources
Trajectories entropy in dynamical graphs with memory [PDF]
Frontiers in Robotics and AI, 2016 In this paper we investigate the application of non-local graph entropy to evolving and dynamical graphs. The measure is based upon the notion of Markov diffusion on a graph, and relies on the entropy applied to trajectories originating at a specific ...
Francesco eCaravelli
doaj +3 more sources
Graph Coloring and Conditional Graph Entropy [PDF]
2006 Fortieth Asilomar Conference on Signals, Systems and Computers, 2006 We consider the remote computation of a function of two sources where one is receiver side information. Specifically, given side information Y , we wish to compute f(X, Y) based on information transmitted by X over a noise-less channel. The goal is to characterize the minimal rate at which X must transmit information to enable the computation of the ...
Doshi, Vishal +3 more
openaire +3 more sources
On minimum entropy graph colorings [PDF]
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004 This paper presents the study of the properties of graph colorings that minimize the quantity of color information with respect to a given probability distribution on the vertices. The minimum entropy of any coloring is the chromatic entropy. Applications of the chromatic entropy are found in coding with side information and digital image partition ...
Cardinal, Jean +2 more
openaire +2 more sources
Study on Graph Data Augmentation Based on Graph Entropy Theory [PDF]
Jisuanji kexueGraph data augmentation,as a technique aiming to enhance the performance of graph neural networks,involves transforming and expanding the graph structure and node features to increase the diversity and quantity of training data.The integrity of ...
FU Kun, CUI Jingyuan, DANG Xing, CHENG Xiao, YING Shicong, LI Jianwei
doaj +2 more sources
"Graph Entropy, Network Coding and Guessing games" [PDF]
, 2007 We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the number
RIIS, SM
core +4 more sources
Walk entropies in graphs [PDF]
Linear Algebra and its Applications, 2014 16 pages, 5 ...
Estrada, Ernesto +2 more
openaire +5 more sources