Systems Thinking & Cybernetics¶
← Back to Domain-Specific Abstractions by Origin Domain
63 domain-specific abstractions whose origin domain is Systems Thinking & Cybernetics. They span 56 subdomains — sort by that column to group them, or click any subdomain to filter to it.
| Abstraction | Subdomain | Description |
|---|---|---|
| Backstepping | A recursive nonlinear-control design method for strict-feedback systems that constructs a stabilizing controller and Lyapunov function stage by stage. | |
| Bak–Sneppen model | An extremal coevolution model that repeatedly replaces the least-fit species and its neighbors, self-organizing toward a critical fitness threshold and avalanche dynamics. | |
| Betweenness centrality | A network centrality measure equal to the fraction or count of shortest paths between other vertices that pass through a given vertex or edge. | |
| Biased random walk on a graph | A graph random walk whose transition probabilities favor neighbors according to weights, attributes or a state-dependent bias rather than choosing uniformly. | |
| Block diagram | A high-level system representation that depicts principal functions or components as blocks connected by lines showing declared relationships or flows. | |
| Boolean network | A discrete dynamical system of Boolean variables whose values update according to assigned Boolean functions of other network nodes. | |
| Causal loop diagram | Map hypothesized causal influence among changing variables with signed arrows and closed reinforcing or balancing loops, providing a qualitative feedback model whose links require narrative, boundary, and evidence. | |
| Closed-loop transfer function | Collapse a linear feedback interconnection into the net input-to-output map—typically G(s)/(1+G(s)H(s)) for negative feedback—whose denominator exposes stability, sensitivity, and loop-gain effects. | |
| Combinatorial explosion | The superpolynomial—often exponential or factorial—growth of candidate configurations as problem dimensions increase, making exhaustive representation or search rapidly infeasible. | |
| Community structure | A network organization in which nodes form groups with denser or more probable internal ties than ties between groups. | |
| Control-Theoretic Orbit | The set of states reachable from an initial state by finite concatenations of admissible flows generated by a family of control vector fields, allowing positive and negative flow times when declared. | |
| Controlled Invariant Subspace | A controlled invariant subspace is a linear-system state subspace whose trajectories can be kept inside it by suitable control input, equivalently one satisfying AV ⊆ V + im B or made invariant by some static state feedback. | |
| Copying Mechanism | Grow a network by sampling an existing prototype node and giving a new node some of the prototype's neighbors, optionally mixed with random links, deletions, or other mutations, so local imitation can generate global degree heterogeneity and clustering. | |
| Data-flow diagram | A structured-analysis diagram representing how data moves among external entities, processes and stores within a system. | |
| Dead-beat control | A discrete-time control design that drives a controllable system's state or output exactly to its target in the minimum finite number of sampling steps. | |
| Decentralised system | A system in which components use local information and interaction to coordinate behavior without one controlling center. | |
| Defuzzification | The mapping of an aggregated fuzzy output set or membership distribution to a single crisp value or discrete action. | |
| Feedback linearization | A nonlinear-control technique that uses state or output transformations and a compensating input law to cancel modeled nonlinearities and expose linear closed-loop dynamics. | |
| Fitness model (network theory) | A growing-network model in which each node’s intrinsic fitness multiplies or otherwise modulates preferential attachment to determine link acquisition. | |
| Flatness (systems theory) | A nonlinear-system property in which all states and inputs can be parameterized by a flat output and finitely many of its derivatives, without integrating differential equations. | |
| Full state feedback | A control design that feeds a measured or estimated state vector through a gain matrix to place a controllable linear system’s closed-loop poles. | |
| Gain Scheduling | A control method that selects controller coefficients from a designed map of current operating conditions. | |
| Grey Relational Analysis | A grey-system method that converts pointwise deviations from a reference sequence into grey relational coefficients and an aggregated grade for comparing or ranking alternatives. | |
| H-infinity loop-shaping | A robust-control design that first frequency-shapes a plant and then optimizes a stabilizing controller against normalized coprime-factor uncertainty. | |
| Hamiltonian (control theory) | The function combining instantaneous objective and state dynamics through costate variables in optimal control, whose pointwise optimization is required by Pontryagin's maximum principle. | |
| Hautus lemma | A rank-test lemma characterizing controllability, observability, stabilizability, and detectability of linear time-invariant state-space systems at eigenvalues. | |
| Inertia wheel pendulum | An underactuated control-system model consisting of a pendulum with a motor-driven reaction wheel whose internal torque regulates the pendulum angle. | |
| Information Fluctuation Complexity | The Bates–Shepard information-theoretic measurement family that treats structured complexity as dispersion in state surprisal or in the surprisal changes carried by observed transitions. | |
| Kalman–Yakubovich–Popov lemma | A theorem equating a frequency-domain positivity condition for a linear system with existence of a state-space quadratic certificate. | |
| Kronecker graph | A recursively generated graph whose adjacency matrix is formed by repeated Kronecker products of a small initiator matrix, producing large self-similar network structure from few parameters. | |
| Local World Evolving Network Models | Evolving-network models in which a new node samples a limited local candidate set and attaches preferentially or otherwise within that partial view. | |
| Louvain method | A greedy multilevel network algorithm that alternates local modularity-improving node moves with aggregation of discovered communities. | |
| Lyapunov redesign | A nonlinear-control method that augments a nominal stabilizing feedback law using a known Lyapunov function to preserve stability under matched uncertainty. | |
| Metapattern | A recurring organization among patterns themselves—a higher-order pattern that connects, transforms or generates patterns across instances or domains. | |
| Metzler matrix | A real matrix whose off-diagonal entries are all nonnegative, serving as the continuous-time generator form for positive linear systems. | |
| Modularity (networks) | A network-quality measure comparing the observed density of within-community edges with the density expected under a declared null model. | |
| Morphological analysis (problem-solving) | A method for enumerating and testing combinations of discrete dimensions in a complex nonquantified problem space. | |
| Moving horizon estimation | A constrained state-estimation method that repeatedly optimizes model fit over a finite recent measurement window and summarizes earlier data in an arrival cost. | |
| Multidimensional system | A mathematical system whose signals or states evolve over two or more independent variables, such as spatial coordinates as well as time. | |
| Network Entropy | In network science, network entropy is a family of information-theoretic measures that quantify disorder, uncertainty, or structural information in a graph under an explicitly chosen graph representation and probability model. | |
| Optimal control | The selection of a time-dependent control policy for a dynamical system that minimizes or maximizes an objective while satisfying dynamics and constraints. | |
| Pace layers | A framework for complex systems composed of interacting layers that change at different characteristic rates, with fast layers innovating and slow layers stabilizing and constraining. | |
| Pattern formation | The emergence of reproducible spatial or temporal order from initially less differentiated material through local interactions, transport, instability, positional information or coupled growth dynamics. | |
| Proper transfer function | A rational transfer function whose numerator degree does not exceed its denominator degree, so high-frequency gain remains finite. | |
| Recursive Bayesian estimation | Sequential estimation of a changing hidden state by alternating model-based prediction with Bayesian updating from each new observation. | |
| Rosenbrock system matrix | A polynomial block matrix combining state-space dynamics and input-output equations of a linear system. | |
| Rumor spread in social network | Rumor spread in a social network models propagation through stochastic individual interactions or aggregate population compartments. | |
| Self-tuning | An adaptive control or computing architecture that measures its own performance, estimates how tunable parameters affect an objective and changes those parameters online to maintain or improve operation under changing conditions. | |
| Separation principle | A control-theory result allowing state estimation and feedback control to be designed independently while preserving stability or optimality under stated linear-system assumptions. | |
| Set estimation | Estimate every parameter or state consistent with bounded prior and measurement uncertainty, producing an inner or outer feasible set instead of a single point or fully specified probability distribution. | |
| Signal-flow graph | A directed weighted graph whose nodes denote system variables and whose branches denote functional dependence or gain from one variable to another. | |
| Sliding mode control | A nonlinear variable-structure control method using discontinuous feedback to drive trajectories onto a designed switching manifold and maintain reduced-order motion along it. | |
| Small-world network | A network combining high local clustering with short typical path lengths, often comparable to a regular lattice locally and a random graph globally. | |
| Small-World Routing | Reach a destination through a small-world network using only local neighbors and a destination-relative reference, exploiting long-range links whose scale distribution makes short global paths locally discoverable. | |
| Spatiotemporal pattern | A repeatable organization whose identity depends jointly on how a field varies across space and evolves through time. | |
| State variable | One coordinate in a minimal sufficient state description whose current values, together with inputs and a model, determine the system's admissible future evolution and observable outputs. | |
| State-transition matrix | A matrix function Φ(t,t₀) mapping the state of a linear dynamical system at time t₀ to its homogeneous state at time t. | |
| System dynamics | A simulation methodology that represents complex systems through accumulations, rates, feedback loops and delays to explain nonlinear behavior over time. | |
| Trajectory optimization | The computation of a state-and-control path that extremizes a performance objective while satisfying dynamics, boundary conditions and path constraints, usually as an open-loop optimal-control solution. | |
| Triadic closure | The tendency for two nodes sharing a neighbor to become directly connected. | |
| Viable System Model | Beer's recursive organizational model mapping operations, coordination, control, environmental intelligence, and policy in an adaptive system. | |
| Weighted network | A network whose edges carry numerical weights representing strength, capacity, cost, frequency, distance or another declared relation magnitude. | |
| Weighting pattern | Represent a linear time-varying system's zero-state input–output action by a two-time kernel formed from output, state-transition, and input maps, reducing to an impulse-response convolution kernel in the time-invariant case. |