scientific article; zbMATH DE number 3514781
From MaRDI portal
Publication:4094202
zbMATH Open0328.60035MaRDI QIDQ4094202FDOQ4094202
Authors: John G. Kemeny, J. Laurie Snell
Publication date: 1976
Title of this publication is not available (Why is that?)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Cited In (only showing first 100 items - show all)
- The tropical analogue of the Helton-Nie conjecture is true
- A notion of equivalence for stochastic Petri nets
- Lumpability for uncertain continuous-time Markov chains
- Reasoning about proportional lumpability
- Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices
- EMBEDDED MATRICES FOR FINITE MARKOV CHAINS
- Complete multipartite graphs and Braess edges
- Estimation of ergodic agent-based models by simulated minimum distance
- Bayesian estimation of agent-based models
- Appointments in care pathways: the \(\mathrm{Geo}^x/\mathrm{D}/1\) queue with slot reservations
- Kemeny's constant and an analogue of Braess' paradox for trees
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Opinion influence and evolution in social networks: a Markovian agents model
- A multi-cluster time aggregation approach for Markov chains
- The hitting time of multiple random walks
- Navigation in spatial networks: a survey
- Trapping on modular scale-free and small-world networks with multiple hubs
- Implications of iterative communication for biological system performance
- Memory effects in quantum processes
- The hitting times of random walks on bicyclic graphs
- Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs
- Network interpolation
- Cross docking for libraries with a depot
- Spectral properties of hypercubes with applications
- On fast computation of directed graph Laplacian pseudo-inverse
- On the waiting time until coordinated mutations get fixed in regulatory sequences
- Normal distributions of finite Markov chains
- On the relations between Markov chain lumpability and reversibility
- Redistributing stock in library systems with a depot
- On some formulas in a partnership model from the perspective of a semi- Markov process
- The \(p\)-adic theory of automata functions
- Aggregation of Markov flows I: theory
- Performance analysis of queue length monitoring of \(M/G/1\) systems
- An iterative algorithm for computing mean first passage times of Markov chains
- Calibrating intensities for long-term care multiple-state Markov insurance model
- Dynamic club formation with coordination
- Partitioning multi-edge graphs
- Proportional lumpability and proportional bisimilarity
- Tensor product Markov chains
- Simple derivations of properties of counting processes associated with Markov renewal processes
- On Kemeny's constant for trees with fixed order and diameter
- Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
- Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices
- Local approximation of Markov chains in time and space
- \textsf{MarCaSPiS}: a Markovian extension of a calculus for services
- Probabilities of landing on parallel lines, with natural coefficients of inclination
- Impact of degree heterogeneity on the behavior of trapping in Koch networks
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
- The Benefits of State Aggregation with Extreme-Point Weighting for Assemble-to-Order Systems
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- Ergodicity conditions for zero-sum games
- Robust queueing theory: an initial study using imprecise probabilities
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Branching bisimulation congruence for probabilistic systems
- Exponential convergence to equilibrium for a class of random-walk models
- Lumpings of Markov chains, entropy rate preservation, and higher-order lumpability
- Switched PIOA: parallel composition via distributed scheduling
- Quantization causes waves: smooth finitely computable functions are affine
- Hitting times, cover cost, and the Wiener index of a tree
- Evolution of a time dependent Markov model for training and recruitment decisions in manpower planning
- Balanced partitions for Markov chains
- Heavy-traffic limits for stationary network flows
- The complexity of reachability in parametric Markov decision processes
- Statistical estimation with bounded memory
- Directed forests and the constancy of Kemeny's constant
- General patterns of interaction in stochastic fusion
- Matrices with a strictly dominant eigenvalue
- The mixture transition distribution model for high-order Markov chains and non-Gaussian time series
- A new general analytical approach for modeling patterns of genetic differentiation and effective size of subdivided populations over time
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Critical dynamics of the three-dimensional Ising model: a Monte Carlo study
- SIA matrices and non-negative subdivision
- State reduction in a Markov decision process
- On undiscounted semi-Markov decision processes with absorbing states
- Informational influence and informational control models in social networks
- Perturbations of finite networks and asymptotic periodicity of flow semigroups
- Stationary distribution and perturbation bounds for a stochastic inventory model
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- A finite characterization of weak lumpable Markov processes. I: The discrete time case
- Tilings and discrete Dirichlet problems
- Spectral coarse graining for random walks in bipartite networks
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
- A finite characterization of weak lumpable Markov processes. II: The continuous time case
- On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems
- Ballistic regime for random walks in random environment with unbounded jumps and Knudsen billiards
- On time duality for Markov chains
- A theoretical framework for simulated annealing
- Coupling and self-stabilization
- Exact results for accepting probabilities of quantum automata.
- Symbolic dynamics and entropy analysis of Feigenbaum limit sets
- Lumpability and Commutativity of Markov Processes
- Command-based importance sampling for statistical model checking
- Nonparametric estimation of the stationary distribution of a discrete-time semi-Markov process
- A transformation of Markov jump processes and applications in genetic study
- Kirchhoffian indices for weighted digraphs
- An accretive operator approach to ergodic zero-sum stochastic games
- Pure adaptive search for finite global optimization
- Randomized Shortest-Path Problems: Two Related Models
- Regular systems of inbreeding
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094202)