


default search action
Towards an Information Theory of Complex Networks 2011
- Matthias Dehmer, Frank Emmert-Streib, Alexander Mehler:

Towards an Information Theory of Complex Networks - Statistical Methods and Applications. Birkhäuser 2011, ISBN 978-0-8176-4903-6 - Abbe Mowshowitz:

Entropy of Digraphs and Infinite Networks. 1-16 - Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:

An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. 17-46 - Terence H. Chan, Raymond W. Yeung:

Probabilistic Inference Using Function Factorization and Divergence Minimization. 47-74 - Richard Berkovits, Lukas Jahnke, Jan W. Kantelhardt:

Wave Localization on Complex Networks. 75-96 - Elena V. Konstantinova

:
Information-Theoretic Methods in Chemical Graph Theory. 97-126 - Prabhat K. Sahu, Shyi-Long Lee:

On the Development and Application of Net-Sign Graph Theory. 127-151 - Robert E. Ulanowicz:

The Central Role of Information Theory in Ecology. 153-167 - Linda J. Moniz, James D. Nichols, Jonathan M. Nichols, Evan G. Cooch, Louis M. Pecora:

Inferences About Coupling from Ecological Surveillance Monitoring: Approaches Based on Nonlinear Dynamics and Information Theory. 169-198 - Cristian R. Munteanu, Julián Dorado, Alejandro Pazos Sierra

, Francisco J. Prado-Prado, L. G. Pérez-Montoto, Santiago Vilar, Florencio M. Ubeira, Angeles Sánchez-Gonzaléz, Maykel Cruz-Monteagudo
, Sonia Arrasate
, Nuria Sotomayor
, Esther Lete
, Aliuska Duardo-Sánchez
, Antonio Díaz-López, Grace Patlewicz
, Humberto González Díaz
:
Markov Entropy Centrality: Chemical, Biological, Crime, and Legislative Networks. 199-258 - Alexander Mehler:

Social Ontologies as Generalized Nearly Acyclic Directed Graphs: A Quantitative Graph Model of Social Tagging. 259-319 - Olga Abramov, Tatiana Lokot:

Typology by Means of Language Networks: Applying Information Theoretic Measures to Morphological Derivation Networks. 321-346 - Edward B. Allen:

Information Theory-Based Measurement of Software. 347-364 - Philippe Blanchard, Dimitri Volchenkov:

Fair and Biased Random Walks on Undirected Graphs and Related Entropies. 365-395

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














