Maximum entropy networks are more controllable than preferential attachment networks

DOI10.1016/J.PHYSLETA.2014.09.057MaRDI QIDQ486244zbMATH OpenOpenAlexFDO

Authors Lvlin Hou, Michael Small, Songyang Lao

Publication date 15 January 2015

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physleta.2014.09.057

zbMATH Keywords

controllabilitymaximum entropycomplex networkspreferential attachment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05)

Recommendations

• Controllability of the better chosen partial networks
• Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
• Benchmarking measures of network controllability on canonical graph models
• Exactly scale-free scale-free networks
• Controllability and algorithms of complex networks

Cites work

• scientific article; zbMATH DE number 3718924 (Why is no real title available?)
• A local-world node deleting evolving network model
• Collective dynamics of `small-world' networks
• Control Profiles of Complex Networks
• Emergence of Scaling in Random Networks
• Mathematical Description of Linear Dynamical Systems
• The structure and function of networks

Cited in

(3)

• Ising game: nonequilibrium steady states of resource-allocation systems
• Benchmarking measures of network controllability on canonical graph models
• An explicit analytical expression for bed-load layer thickness based on maximum entropy principle

This page was built for publication: Maximum entropy networks are more controllable than preferential attachment networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486244)