The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Control Techniques for Complex Networks
Abstract
Power grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This remarkable book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions. Core chapters assume only exposure to stochastic processes and linear algebra at undergraduate level; later chapters are for advanced graduate students and researchers/practitioners. This gradual development bridges classical theory with the state-of-the-art. The workload model at the heart of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks. Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy along with many generalizations. Other topics include methods for synthesizing hedging and safety stocks, stability theory for networks, and techniques for accelerated simulation. Examples and figures throughout make ideas concrete. Solutions to end-of-chapter exercises are available on a companion website.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The pricing of options and corporate liabilities
Black, F., & Scholes, M. (1973) · Journal of Political Economy · doi:10.1086/260062 · Cited by 29,074
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
The Complexity of Decentralized Control of Markov Decision Processes
Bernstein, D. S., Givan, R., Immerman, N., & Zilberstein, S. (2002) · Mathematics of Operations Research · doi:10.1287/moor.27.4.819.297 · Cited by 1,192
Cited by
Fast Model Predictive Control Using Online Optimization
Wang, Y., & Boyd, S. (2010) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2009.2017934 · Cited by 1,372
Natural actor–critic algorithms
Bhatnagar, S., Sutton, R. S., Ghavamzadeh, M., & Lee, M. (2009) · Automatica · doi:10.1016/j.automatica.2009.07.008 · Cited by 559
Prescriptive analytics: Literature review and research challenges
Lepenioti, K., Bousdekis, A., Apostolou, D., & Mentzas, G. (2020) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2019.04.003 · Cited by 501
“MDP is a discrete time stochastic control process which provides a mathematical framework for modeling decision making in situations where outcomes are partly random and partly under the control of a decision maker (Meyn, 2008).”
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Metadata
- Authors
- Meyn, S.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2007-12-10
- OpenAlex
- W565357261
- Cited by
- 528
- References
- 3
- FWCI
- 47.28
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Control Techniques for Complex Networks. https://app.cochat.ai/papers/10.1017/cbo9780511804410
- The paper
- Meyn, S. (2007). Control Techniques for Complex Networks. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511804410
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.