INDEX

Absorbing state

Accessible states

Acyclic graphs

as chain graphs

directed

Adjacency matrix

Adjacent vertices

Advanced queueing theory

Aggregate arrival rates

Algorithms. See also Hungarian algorithm; Inference algorithms; Kruskal’s algorithm; Sum-product algorithm

approximate

clique tree

consensus

convolution

exact

junction tree

maximum weight spanning tree

for product-form queueing networks

Ancestor

Aperiodic state

Approximate algorithms

Approximate solutions

Approximations, of queueing systems and networks

Arrival/departure processes, variations about the mean in. See also Arrivals/departures; Departure process

Arrival processes, in open networks

Arrival rate for a process. See also Aggregate arrival rates; Average customer arrival rate; External Poisson arrival rate; Total arrival rate

Arrivals/departures, cumulative number of

Arrival stream

Arrival theorem

Arriving pattern, of queueing systems

Assignment problem

bipartite graph for

solution of

Attractor cycles

Attractors

Autocorrelation function

Autocorrelation matrix

Autocovariance matrix

Auxiliary servers

Average customer arrival rate

Backlog model

Balance equations. See also Local balance equations

Balking system

Base network

Basin of attraction

Batch arrival system

Bayesian estimation

Bayesian networks (BNs)

classification of

general conditional independence and d-separation

learning

moralizing

parameter learning in

probabilistic inference in

Bayesian network structure, known and unknown

Bayes’ theorem

BCMP (Baskett, Chandy, Muntz, Palacios) networks

routing behavior in

service disciplines in

service time distributions in

BCMP theorem

Belief networks

Belief propagation

in a junction tree

Bernoulli distribution

Bernoulli random graphs

Bernoulli random variable

Betweenness centrality

Biased coin problem

Binomial distribution

Binomial random variable

Biological networks

Biological processes, gene-controlled

Bipartite graphs

for the assignment problem

Birth and death processes

Blocked-calls-lost model

Blocking system

Boolean algebra

Boolean functions

Petri nets for

Boolean networks. See also Probabilistic Boolean networks (PBNs); Random Boolean networks (RBNs)

advantages and disadvantages of

applications of

behavior of

classical

connectivity of

deterministic nature of

fundamentals of

Petri net analysis of

Petri net models of

Boolean network state transition diagram

Boundary conditions

Boundedness property

Bribing system

Bridges

Brooks’ theorem

Brownian approximation

for a G/G/1 queue

Brownian motion

as a continuous-time approximation

with drift

reasons for studying

reflected

scaled

as scale invariant

Brownian motion approximation, of the G/G/1 queue

Bulk service system

Burke’s output theorem

Centrality measures, in complex networks

Central limit theorem (CLT). See also Functional central limit theorem (FCLT)

Central moments

Chain graphs

Chain in a graph

Chaotic network

Chapman–Kolmogorov equations

for the continuous-time Markov chain

Characteristic polynomial

Cheating system

Chebyshev inequality

Child

Children of a vertex

Chord

Chordal graphs

Chromatic index

Chromatic number

Circuits. See also Euler circuit

Citation networks

Classical Boolean network

Classical Brownian motion

Classical Jackson network

Class membership problem

Clique of a graph

identifying

Clique tree algorithm

Clique tree propagation

Cliquishness of a network

Closed communicating class

Closed Jackson queueing network

Closed queueing networks

diffusion approximation of

flow equations for

modeling

possible number of states in

solving

Closed walks

Closeness centrality

Cluster graph

generating

Clustering, in complex networks

Clustering coefficient

in random graphs

in small-world networks

Clusters

Cluster tree

generating

Coefficient of variation

Coloring, of graphs

Communication networks

Complement of a graph

Complete bipartite graph

Complete data

Complete graphs

Complete s-partite graph

Complex networks

centrality measures in

characterization of

clustering in

geodesic distances in

models of

network entropy in

Complex systems, modeling

Concurrency/parallelism, modeling

Conditional independence

general

Conditional probability density functions

Conditional probability distributions (CPDs)

Conditional probability tables (CPTs)

Configuration, of factor graphs

Configuration model

Connected graphs

Connectedness, in random networks

Connection matrix

Connections, in factor graphs

Connectivity, network

Connectivity number

Consensus

over fixed networks

over random networks

Consensus algorithms

Consensus matrix

Conservation property

Continuous Bayesian networks

Continuous Petri nets

Continuous random variables

Continuous-state Markov process

Continuous-state stochastic process

Continuous-time approximation, Brownian motion as

Continuous-time Gaussian process

Continuous-time Markov chains. See also Birth and death processes

Chapman–Kolmogorov equation for

Continuous-time Markov process

Continuous-time process

Continuous-time stochastic processes

modeling

Convergence/divergence parameter

Convolution algorithm

for a multiclass network

Convolution integral

Co-parents. See also Parent

Correlation coefficient

Counting processes

Covariance

Covariance matrix

Covering

Covering number

Coxian distribution

Coxian random variable

Coxian stages

Critical behavior

c-server loss system

c-server queueing system

c-server system

Cumulative distribution function (CDF)

Laplace transform of

Current loop method

Customer classes

Customers

approximating the number of

in a queueing system

Cut edge

Cut sets

Cut vertices

Cycle length of an attractor

Cycle rank

Cycles. See also Fundamental cycle; Hamiltonian cycle

Data

complete

incomplete

Deadlock condition

Defection system

Degree distribution

in complex networks

in random graphs

Degree of a vertex

Density of a graph

Deoxyribonucleic acid (DNA)

Departure process. See also Arrival/departure processes

Descendant

Deterministic network model

Deterministic service time

Diagonalization method

Diameter. See also Radius of a graph

of a network

in random networks

Differential equations

Diffusion approximations

of closed queueing networks

of a G/G/1 queue

of open queueing networks

Diffusion equation

Diffusion process

parameters for

Digraphs

Dirac delta function

Dirac’s theorem

Directed acyclic graphs (DAGs)

converting into factor graphs

Directed graphical models

Directed graphs

chain graphs and

moral graphs and

Direct method

Disconnected graphs

Disconnecting set

Discrete Bayesian networks

Discrete Petri nets

Discrete random variables

Discrete-state Markov process

Discrete-state stochastic process

Discrete-time Markov chains

Discrete-time Markov process

Discrete-time random process

Distance between vertices

Distribution functions

D/M/1 queue

Domain of a random variable

Dominating set

Domination number

Donsker’s theorem

Doubly stochastic matrix

Drift

Brownian motion with

reflected Brownian motion with

Drift rate

d-separation

Dwell time

Dynamic Bayesian networks (DBNs)

joint probability distribution of

Edge coloring

Edge-connectivity number

Edges

Effective service time

Eigenvalues, spectral properties of graphs and

Eigenvectors

E_k/M/1 queue

Elementary queueing theory

Kendall notation

Little’s formula

M/G/1 queueing system

M/M/1 queueing system

M/M queueing system examples

queueing systems

Elementary renewal theorem

Enabled transitions

End vertex

Entropy. See also Graph entropy; Network entropy

Equilibrium distribution

Equilibrium state distribution

Equivalent planar graphs

Erdos–Renyi graphs

Ergodic chain

Ergodic probability transfer

Ergodic states

Erlang distribution

Erlang-k distribution

Erlang-k random variable

Erlang random variable

probability density function for kth-order

Erlang’s loss formula

Error-correcting codes

Euler circuit

Euler graphs

Euler’s formula, for planar graphs

Euler trail

Events

Exact algorithms

Expected residual service time

Expected value(s) (mean)

Expected waiting time

Experiments

Exponential degree distribution

Exponential distribution

Exponentially distributed service times

Exponential random variable

Expression level, of genes

Exterior region, of a planar graph

Externally stable set

External Poisson arrival rate

Factor graphs

Factor nodes

FCLT arguments. See also Functional central limit theorem (FCLT)

Feedback loops

Feed-forward queueing network

Financial markets, modeling

Finite-population schemes

Firing quantity. See also Transition firing

First-come, first-served (FCFS) service discipline

First-come, first-served service policy

in BCMP networks

First-in, first-out (FIFO) discipline

First-order Markov process

First-order Markov property

First passage

Fixed networks

consensus over

time to convergence in

Fixed service time

Flow balance equation

Flow equations, for closed queueing network

Fluid approximation

of a G/G/1 queue

of a queueing network

Forests

Forney–style factor graph (FFG)

Four-color problem

Frozen network

Functional central limit theorem (FCLT). See also FCLT arguments

Function bias

Fundamental cycle

Fundamental equation of renewal theory

F_W(w), Laplace transform of

Gaussian noise

maximum a posteriori estimation with

maximum likelihood estimation with

Gaussian processes. See also Continuous-time Gaussian process; White Gaussian process; Zero-mean Gaussian process

properties of

Gene activity profiles (GAPs)

Gene expression

Gene expression level

Generalized Jackson network

Generalized networks (G-networks)

extensions of

with signals

Generalized stochastic Petri nets

General Markov graph

General phase-type distribution

Genetic regulatory networks (GRNs)

estimating

Gene transcription

Geodesic distances

in complex networks

in small-world networks

Geodesic path

Geometric distribution

Geometric random graphs

Geometric random variable

G/G/1 queue

Brownian approximation for

Brownian motion approximation of

diffusion approximation of

fluid approximation of

Giant component emergence

in random graphs

Global balance

G/M/1 imbedded Markov chain

G/M/1 queue

G/M/1 queueing system

G/M/3/20 queueing system

G-networks. See Generalized networks (G-networks)

Gordon–Newell network

limitations of

Graph coloring

Graph entropy

Graphical models, types of

Graphical network models

Graphs. See also Random graphs

cluster

locally consistent

reachability

topological properties of

triangulated

undirected

Graph theory

basic concepts in

bipartite graphs and matchings

chain graphs

complement of a graph

connected graphs

cut sets, bridges, and cut vertices

directed acyclic graphs

elements of

Euler graphs

factor graphs

graph coloring

graph entropy

Hamiltonian graphs

independent set, domination, and covering

isomorphic graphs

matrix algebra of graphs

minimum weight spanning trees

moral graphs

planar graphs

random graphs

spectral properties of graphs

as a tool for detecting hidden structures

trees and forests

triangulated graphs

H₂/M/1 queue

Hall’s theorem

Hamiltonian cycle

Hamiltonian graphs

Hamiltonian path

Hammersley–Clifford theorem

Hamming distance

Heavy traffic approximate solution techniques

Heavy traffic approximations

of a queueing system

Heavy traffic assumption

Heterogeneous Poisson process

Heterogeneous queueing system

Hidden variables

Holding time

Homogeneous Poisson process

Homogeneous queueing system

Homogeneous state transition probability

Homogenous Markov chains

Hungarian algorithm

Hybrid Bayesian networks

Hybrid Petri nets

Hyperexponential arrival process, second-order

Hyperexponential distribution

Hyperexponential random variable, probability density function for kth-order

Hyperexponential server, k-stage

Hypernodes

Hysteresis behavior

Identically distributed service times

Imbedded Markov chain

G/M/1

M/G/1

state transition matrix of

Immediate transitions

Incident edge

Incomplete data

Indegree of a vertex

Independence number

Independent edge set

Independent increment processes

Independent interarrival times

Independent random variables, sums of

Independent set

Inference, in a junction tree

Inference algorithms, types of

Infinite server (IS). See also IS service discipline

in BCMP networks

Information networks, detecting hidden structures in

Inhibitor arc

Initial marking

Interaction graph

Interarrival times

deterministic

statistically independent

Interior regions, of a planar graph

Internally stable set

Interslice arcs

Intraslice arcs

Irreducible Markov chain

Isolated vertex

Isomorphic graphs

IS service discipline. See also Infinite server (IS)

Jackson networks

generalized versus classical

limitations of

Jockeying system

Joint distribution. See also Joint probability distribution

Joint PMF. See also Probability mass function (PMF)

Joint probability

Joint probability distribution

of dynamic Bayesian networks

Joint probability mass function

Join tree

Junction graphs, potential functions for

Junction tree algorithm

Junction tree property

Junction trees

belief propagation in

generating

inference in

Kauffman model

k-chromatic graph

k-colorable graph

K-dimensional functions. See also Multidimensional diffusion equation; N-dimensional entries

k-edge chromatic graph

k-edge colorable graph

k-edge connected graphs

Kendall notation

K_i, probability mass function of

K_p, probability mass function of

K random variable, probability mass function of

k-regular graphs

k-regular networks

Kruskal’s algorithm

k-stage hyperexponential server

kth-order Coxian random variable

kth-order Erlang random variable

probability density function for

kth-order hyperexponential random variable, probability density function for

Laplace–Stieltjes transform (LST)

Laplace transform, of F_W(w)

Laplacian matrix

eigenvalues of

Last-come, first-served preemptive resume (LCFS PR) discipline, in BCMP networks

Last-come, first-served (LCFS) service discipline

Last-come, first-served service policy

Last-in, first-out (LIFO) discipline

Lattice networks

Law of large numbers

Law of total probability

Leaf node

Leaf vertex

Learning Bayesian networks

Likelihood function

Limiting distribution

Limiting state probabilities

determining

Limit theorems

Lindley’s integral equations

Linear planar graph

Little’s formula

Liveness, Petri net

Load balancing

Local balance

condition

equations

Local functions

Locally consistent graph

Logarithmic likelihood function

Loopy belief propagation

Marginal probability distribution

Marking

Markov blanket

Markov chain Monte Carlo algorithm

Markov chain rule

Markov chains

states of

time-homogeneous

Markovian queueing networks

with feedback

Markovian queueing systems

Markov inequality

Markov networks

Markov processes

types of

Markov property

first-order

Markov random fields

Markov random graph

Marriage problem

Matching

Matrix algebra, of graphs. See also Adjacency matrix; Autocorrelation matrix; Autocovariance matrix; Connection matrix; Consensus matrix; Covariance matrix; Doubly stochastic matrix; Laplacian matrix; N × N routing matrix; Path matrix; Probability matrix; Routing matrix; State transition matrix; State transition probability matrix; Stochastic matrix; Substochastic matrix; Transition probability matrix

Matrix method

Maximal cliques

Maximal independent set

Maximum a posteriori (MAP) estimation

with Gaussian noise

Maximum independence set

Maximum likelihood estimation (MLE)

with Gaussian noise

Maximum likelihood estimators

Maximum matching

Maximum weight spanning tree

Maximum weight spanning tree algorithm

M/D/1 queue

M/D/1 queueing system

Mean

approximation of

moments about

variations about

Mean delay

Mean delay time

Mean duration

of type 1 vacation

of type 2 vacation

Mean interarrival time

Mean residual service time

Mean service time

Mean sojourn time

Mean time in system

Mean time to serve

Mean total time

Mean value analysis (MVA)

Mean waiting time

bounds of

M/E_k/1 queue

Messenger ribonucleic acid (mRNA)

M/G/1 queue

with priority

waiting time distribution of

M/G/1 queueing system

M/H_k/1 queue

Minimal covering

Minimal dominating set

Minimum covering

Minimum dominating edge set

Minimum dominating set

Minimum weight spanning trees

M/M/1/3 queueing problem

M/M/1/K queueing system

M/M/1 queue

M/M/1 queueing analysis techniques

M/M/1 queueing system

total time and waiting time distributions of

M/M/1 threshold queueing systems

M/M/1 vacation queueing systems, with exceptional first vacation

M/M/2 queueing problem

M/M/4/4 queueing system

M/M/c/c queueing system

M/M/c_i queueing system

M/M/c queue, departure process of

M/M/c queueing system

M/M queueing systems, examples of

Moments

about the mean

of random variables

Moral graphs

triangulating

Moralization

Moralizing Bayesian networks

Multiclass network, convolution algorithm for

Multiclass queueing networks, scheduling problem in

Multidimensional diffusion equation. See also K-dimensional functions; N-dimensional entries

Multigraphs

Multiple vacation queueing system

Multiplicity

Multiply connected Bayesian networks

Multiply connected network

Multiserver queueing system

Multiserver stochastic system

Multiserver vacation queueing system

Mutual exclusion, modeling

N-dimensional column vector. See also K-dimensional functions; Multidimensional diffusion equation

N-dimensional continuous-path process

N-dimensional discrete process

Negative binomial distribution

Negative customers

networks with

total arrival rate of

Neighbor of a vertex

Network bias

Network entropy, in complex networks

Network models

Networks. See also BCMP (Baskett, Chandy, Muntz, Palacios) networks; Closed queueing networks; Fixed networks; Generalized networks (G-networks); Genetic regulatory networks (GRNs); Gordon–Newell network; Graphical network models; Jackson networks; Markovian queueing networks; Petri nets (PNs); Product-form queueing networks; Queueing networks; Random networks

base

Bayesian

belief

biological

Boolean

chaotic

citation

cliquishness of

communication

complex

diameter of

feed-forward queueing

frozen

information

k-regular

lattice

Markov

multiclass

multiclass queueing

multiply connected

open

open queueing

ordered

perturbations of

with positive and negative customers

probabilistic

queueing

real-world

regular

scale-free

sensor

small-world

social

stochastic

three-node

transitivity of

Network state transition

Network wiring

N-K Boolean network

N × N routing matrix

Node-class pair

Node degree

Nodes. See also Hypernodes

factor

simplicial

variable

Nonexponentially distributed service times

Nonhomogeneous Markov chain

Nonhomogeneous Poisson processes

Nonpreemptive priority

Nonpreemptive priority queues

Nonrecurrent state

Nonzero eigenvalues

Normal distribution

Normal graph

Normalizing constant

Normal random variable

n-step state transition probability

Null recurrent state

Observable variables

Offspring of a vertex

Open networks, arrival processes in

Open queueing networks

diffusion approximation of

Optimal assignment problem

Ordered network

Order of a graph

Ore’s theorem

Outdegree of a vertex

Parameter learning, in Bayesian networks

Parameter set

Parent. See also Co-parents

Partially dynamic Bayesian networks

Partition function

Pascal distribution

Pascal random variable

Path. See also Hamiltonian path

Path matrix

Pendant vertex

Percolation theory

Percolation threshold

Perfect matching

Periodic state

Period of an attractor

“Per-node” steady-state distribution

Perrone–Frobenius theorem

Persistent state

Perturbations, network

Petri net analysis, of Boolean networks

Petri net liveness

Petri net model, of Boolean networks

Petri nets (PNs)

behavioral properties of

Petri net states

Phase transition

Phase-type distribution

Planar graphs

Euler’s formula for

Poisson arrivals see time averages (PASTA) property

Poisson distribution

Poisson processes

Poisson random graph

Poisson random variable

Pollaczek–Khinchin formula

Polynomials, characteristic

Polytrees

Population, in a queueing system

Positive customers

networks with

total arrival rate of

Positive recurrent state

Posterior distribution

Posterior probability

Posterior probability distribution, process of computing

Potential function concept

Potentials

Power-law distributions

Predictors

in probabilistic Boolean networks

Preemptive priority

Preemptive priority queues

Preemptive-repeat different queueing

Preemptive-repeat identical queueing

Preemptive-repeat policy

Preemptive-repeat priority

Preemptive-repeat with resampling queueing

Preemptive-repeat without resampling queueing

Preemptive-resume policy

Preemptive-resume priority

Preferential attachment

Primary server

Prior distribution

Priority, in queueing systems

Priority class 1 customers

Priority queues, classes of

Prior probability

Probabilistic Boolean networks (PBNs)

dynamics of

Probabilistic graphical model

Probabilistic inference, in Bayesian networks

Probabilistic network

Probabilities (probability). See also Conditional probability distributions (CPDs); Conditional probability tables (CPTs); Joint probability entries; Marginal probability distribution; Posterior probability entries; Prior probability; Probability distributions; Product rule of probability; State transition probabilities; Unconditional probability

covariance and correlation coefficient and

limit theorems and

limiting state

n-step state transition and

random sum of random variables and

random variables and

routing

state transition

steady-state

sums of independent random variables and

transform methods and

Probability density function (PDF)

s-transform of

Probability distributions

measuring

Probability functions, transition

Probability generating function

Probability mass function (PMF). See also Joint PMF

of K_i

of K_p

of a Markov random graph

of number of customers

of random variable K

z-transform of

Probability matrix

state transition

transition

Probability theory, dynamics of

Processor sharing (PS). See also PS service discipline

in BCMP networks

Product-form queueing networks

algorithms for

Product-form solution

Product-form stationary distribution

Product rule of probability

Protein–protein interactions

PS service discipline. See also Processor sharing (PS)

Queueing discipline

Queueing facility capacity

Queueing network models

Queueing networks

approximations of

diffusion approximation of

fluid approximation of

Queueing process

Queueing system notation

Queueing systems. See also Special queueing systems

approximations of

characteristics of

fluid approximation of

M/M/1

stable

vacation

Queueing theory

advanced

elementary

Queue lengths

in G-networks

obtaining

Queue parameters, relationships between

Queues

defined

tandem

Radius of a graph. See also Diameter; Spectral radius

Random Boolean networks (RBNs)

Random experiments

Random graphs

emergence of giant components of

Random incidence paradox

Random incidence principles

Random incidence problem

Random networks

characterization of complex networks

consensus over

defined

models of complex networks

random graphs

regular

Random process

Random regular networks

Random sequence

Random time

Random variables

Bernoulli

binomial

continuous

discrete

domain and range of

Erlang

exponential

geometric

kth-order Erlang (Erlang-k)

normal

Pascal

Poisson

random sum of

ranges of

standard normal

sums of independent

uncorrelated

Range of a random variable

r-connected vertices

Reachability diagram

Reachability graph

Reachable marking

Real-world networks

Recurrence equation

Recurrent state

Recursive equation

Recursive solutions

Reflected Brownian motion

with drift

Region of a planar graph

Regular graphs

Regular networks

Regulatory set

Reneging system

Renewal density

Renewal equation

Renewal events

Renewal function

Renewal processes

Renewal theory

fundamental equation of

Residual life

Residual time

Rewiring procedure

Ribonucleic acid (RNA)

Ripple effect

Root of a tree

Routing behavior, in BCMP networks

Routing matrix

Routing probabilities

Rush hour traffic model

Safe Petri net

Sample points

Sample space

Scaled Brownian motion

Scale-free networks

Scale-free properties, in random graphs

Scale invariance

Second-order approximation

Second-order hyperexponential arrival process

Second-order Markov processes

Semi-Eulerian graph

Sensor network

Separating set

Separator

Servers

number of

in a queueing system

utilization of

Service disciplines

in BCMP networks

Service in random order (SIRO)

Service interruption

Service rate

Service restart

Service time distributions

in BCMP networks

Siblings

Simple graphs

Simplicial node

Single chain

Single-server finite-capacity system

Single server finite customer population system

Single-server infinite-capacity queueing system

Single-server queueing systems

approximating

Singleton attractor

Single vacation queueing system

Singly connected Bayesian networks

“Six degrees of separation” concept

Size of a graph

Small-world networks

Small-world phenomenon

Social networks

Sojourn time. See also Mean sojourn time

Spanning cluster

Spanning forest

Spanning trees

minimum weight

s-partite graph

Special queueing systems

Spectral density of a graph

Spectral gap

Spectral graph theory

Spectral properties, of graphs

Spectral radius

Spectrum of a graph

Stable queueing system

Stable sets

Staircase effect

Standard Brownian motion

Standard Brownian process

Standard normal random variable

State classes

State description

States

accessible

classification of

communication among

of Markov chains

State space

State transition diagrams

for an M/G/1 imbedded Markov chain

State transition matrix, of an imbedded Markov chain

State transition probabilities

State transition probability matrix

State transition rate diagrams

State transitions, of networks

Static Bayesian networks

Stationary increment process

Stationary random processes

Statistically independent interarrival times

Steady-state analysis

Steady-state distribution

Steady-state equations, shortcut method for obtaining

Steady-state probabilities

Steady-state probability distribution, in BCMP networks

Step function

Stochastic balance

Stochastic balance equations

Stochastic matrix

Stochastic networks, networks unifying

Stochastic Petri nets

Stochastic processes

classification of

counting processes

as families of random variables

Gaussian processes

independent increment processes

Markov processes

Poisson processes

renewal processes

scale-invariant

states of

stationary increment process

stationary random processes

Stochastic sampling algorithm

Stock prices, modeling

s-transform

moment-generating property of

of probability density function

Strict-sense stationary processes

Strongly connected graphs

Structure learning

Subgraphs

Substochastic matrix

Sum-product algorithm

Synchronization, modeling

Synchronous update

System state modeling

Tagged priority class 1 customers

Tandem queues

Terminal edge

Terminal vertex

Three-node network

Threshold queue

Time. See also Continuous-time entries; Discrete-time entries; Mean waiting time entries; Service time distribution entries; Waiting time distribution entries

deterministic service

dwell

effective service

expected residual service

expected waiting

exponentially distributed service

fixed service

holding

identically distributed service

independent interarrival

interarrival

mean interarrival

mean residual service

mean service

mean sojourn

mean time in system

mean time to serve

mean total

nonexponentially distributed service

random

residual

sojourn

statistically independent interarrival

total mean interarrival

total mean service

total time distributions

uninterrupted service

virtual waiting

Time-dependent functions

Time-division multiplexing (TDM)

Timed Petri nets

Timed transitions

Time homogeneity property

Time homogeneous process

Time to convergence, in a fixed network

Topological properties, of graphs

Total arrival rate

Total delay

Total mean interarrival time

Total mean service time

Total time distributions, of the M/M/1 queueing system

Total workload

Traffic equations

Traffic flow equations

Traffic intensities

Trails. See also Euler trail

Trajectory

Transcription factors

Transform methods

Transient states

Transition firing. See also Firing quantity

Transition network

Transition probability functions

Transition probability matrix

Transition rate diagram

Transition rates

Transition rules

Transitions, enabled

Transitivity of a network

Trapping state

Trees. See also Clique tree propagation; Join tree; Junction tree entries; Polytrees; Spanning trees

cluster

Triangulated graphs

Triangulated moral graphs

Truth tables

Two-dimensional state description

Two-dimensional state space

Two-queue network

Two-sided Laplace transforms

Two-state birth and death process

Type 1 vacations

mean duration of

Type 2 vacations

mean duration of

Unconditional probability

Uncorrelated random variables

Undirected graphical models

Undirected graphs

moral graphs and

Uniform distribution

Uninterrupted service time

Utilization factor

Vacation queueing systems

Valency of a vertex

Variable elimination

Variable nodes

Variables

hidden

observable

Variance

approximation of

Variational methods

Vertex cut

Vertices

Virtual waiting time

Visit ratio

Vizing’s theorem

Waiting time distributions

of the M/G/1 queue

of the M/M/1 queueing system

Walk in a graph

Watts–Strogatz small-world network

Weak law of large numbers

Weighted graphs

Weights

White Gaussian process

N-dimensional

Wide-sense stationary (WSS) processes

Wiener process

Work conservation rule

Zero-mean Gaussian process

z-transform

moment-generating property of