Entropy Characterization of Random Network Models
نویسندگان
چکیده
منابع مشابه
Entropy Characterization of Random Network Models
This paper elaborates on the Random Network Model (RNM) as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc.) and entropy-based complexity measures, providing new insight on th...
متن کاملLocal Entropy Characterization of Correlated Random Microstructures
A rigorous connection is established between the local porosity entropy introduced by Boger et al. (Physica A 187, 55 (1992)) and the configurational entropy of Andraud et al. (Physica A 207, 208 (1994)). These entropies were introduced as morphological descriptors derived from local volume fluctuations in arbitrary correlated microstructures occuring in porous media, composites or other hetero...
متن کاملMaximum Entropy Analysis of Queueing Network Models
The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of tree expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuoustime and discrete-time Queu...
متن کاملA Characterization of the Entropy--Gibbs Transformations
Let h be a finite dimensional complex Hilbert space, b(h)+ be the set of all positive semi-definite operators on h and Phi is a (not necessarily linear) unital map of B(H) + preserving the Entropy-Gibbs transformation. Then there exists either a unitary or an anti-unitary operator U on H such that Phi(A) = UAU* for any B(H) +. Thermodynamics, a branch of physics that is concerned with the study...
متن کاملExponential-family Random Network Models
Random graphs, where the connections between nodes are considered random variables, have wide applicability in the social sciences. Exponential-family Random Graph Models (ERGM) have shown themselves to be a useful class of models for representing complex social phenomena. We generalize ERGM by also modeling nodal attributes as random variates, thus creating a random model of the full network, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2017
ISSN: 1099-4300
DOI: 10.3390/e19070321