Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Maximum entropy networks are more controllable than preferential attachment networks

From MaRDI portal
Publication:486244
Jump to:navigation, search

DOI10.1016/j.physleta.2014.09.057zbMath1303.93038OpenAlexW2019364873MaRDI QIDQ486244

Songyang Lao, Lvlin Hou, Michael Small

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)


Related Items (2)

Ising game: nonequilibrium steady states of resource-allocation systems ⋮ An explicit analytical expression for bed-load layer thickness based on maximum entropy principle



Cites Work

  • Unnamed Item
  • The structure and function of networks
  • A local-world node deleting evolving network model
  • Control Profiles of Complex Networks
  • Emergence of Scaling in Random Networks
  • Collective dynamics of ‘small-world’ networks
  • Mathematical Description of Linear Dynamical Systems


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:486244&oldid=12367137"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 05:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki