scientific article; zbMATH DE number 3240812

zbMATH Open0149.13301MaRDI QIDQ5528211FDOQ5528211

Authors: John G. Kemeny, J. Laurie Snell, Anthony W. Knapp 

Publication date: 1966

Title of this publication is not available (Why is that?)

zbMATH Keywords

probability theory

Cited In (only showing first 100 items - show all)

• Optimal cost almost-sure reachability in POMDPs
• Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks
• Martin boundaries of random walks on Fuchsian groups
• Some limit properties for Markov chains indexed by a homogeneous tree.
• The noisy voter-exclusion process
• Parametric probabilistic transition systems for system design and analysis
• Fast convergence to state-action frequency polytopes for MDPs
• Linear independence of root equations for \(M/G/1\) type Markov chains
• Isotropic random walks in a tree
• Industry dynamics: foundations for models with an infinite number of firms
• Probabilistic Weighted Automata
• A splitting technique for Harris recurrent Markov chains
• On Decision Problems for Probabilistic Büchi Automata
• Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
• Investigation of the \(\mathrm{BMAP}/G/1\to\cdot/PH/1/M\) tandem queue with retrials and losses
• The boundary of the Gelfand-Tsetlin graph: A new approach
• Verification and control of partially observable probabilistic systems
• Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
• Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
• A generalization of a Hardy theorem
• Stochastic Games with Lossy Channels
• A nonconventional local limit theorem
• On the linear model with two absorbing barriers
• Green kernel asymptotics for two-dimensional random walks under random conductances
• Synthesizing efficient systems in probabilistic environments
• Spectra of graphs and fractal dimensions. I
• A Characterization of the Invariant Measures for an Infinite Particle System with Interactions. II
• State explosion in almost-sure probabilistic reachability
• Model checking discounted temporal properties
• Game-Based Probabilistic Predicate Abstraction in PRISM
• The expected hitting times for finite Markov chains
• Spectral theorem for convex monotone homogeneous maps, and ergodic control
• A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
• One dimensional random walks killed on a finite set
• Uniform rates of convergence for Markov chain transition probabilities
• Markov branching processes with instantaneous immigration
• Temporal logics for the specification of performance and reliability
• Random walks and the effective resistance of networks
• Randomized dining philosophers without fairness assumption
• Algebraic and differential operator equations
• Evolution of repeated prisoner's dilemma play under logit dynamics
• Symmetric Wiener-Hopf factorisations in Markov additive processes
• Opérateurs potentiels des chaînes et des processus de Markov irréductibles
• Introduction to Random Walks on Noncommutative Spaces
• Approximate uniformization for continuous-time Markov chains with an application to performability analysis
• Existence and uniqueness criteria for conservative uni-instantaneous denumerable Markov processes
• Finiteness of hitting times under taboo
• A parametric uncertainty analysis method for queues with vacations
• Continue, quit, restart probability model
• The potential function and ladder heights of a recurrent random walk on \(\mathbb{Z}\) with infinite variance
• Continuous-time QBD processes with continuous phase variable
• A duality relation for entrance and exit laws for Markov processes
• POMDPs under probabilistic semantics
• Random walks on graphs, electric networks and fractals
• Quantitative multi-objective verification for probabilistic systems
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Model checking for probabilistic timed automata
• A bibliographical guide to the analysis of retrial queues through matrix analytic techniques
• On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts
• Computation of the steady state distribution for multi-server retrial queues with phase type service process
• Marche al�atoire sur le groupe libre et fronti�re de Martin
• Counterexamples in Probabilistic LTL Model Checking for Markov Chains
• Biharmonic extensions on trees without positive potentials
• Poisson boundary of the dual of \(\text{SU}_q(n)\).
• Concurrent reachability games
• Strict Divergence for Probabilistic Timed Automata
• Verification of probabilistic systems with faulty communication
• Transport in Hamiltonian systems
• Title not available (Why is that?)
• Strategy improvement for concurrent reachability and turn-based stochastic safety games
• A stable algorithm for stationary distribution calculation for a BMAP/SM/1 queueing system with Markovian arrival input of disasters
• Runs of geometrically distributed random variables: A probabilistic analysis
• The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
• Some potential-theoretic techniques in non-reversible Markov chains
• Queueing system \(BMAP/G/1\) with repeated calls.
• The Local Limit Theorem and Some Related Aspects of Super-Critical Branching Processes
• The Sierpiński gasket as the Martin boundary of a non-isotropic Markov chain
• \(LU\)-factorization versus Wiener-Hopf factorization for Markov chains
• Compactness of eigenvectors for certain families of non-negative matrices
• Survival of small populations under demographic stochasticity
• On the number of births and deaths during an extinction cycle, and the survival of a certain individual in a competition process
• Title not available (Why is that?)
• Strong stability and perturbation bounds for discrete Markov chains
• The inverse balayage problem for Markov chains
• The inverse balayage problem for Markov chains, part II
• Title not available (Why is that?)
• Yaglom limits can depend on the starting state
• Riesz decompositions for Schrödinger operators on graphs
• Markov chains and summability methods
• Variational formulas for the exit time of hunt processes generated by semi-Dirichlet forms
• New perturbation bounds for denumerable Markov chains
• The Life, Work, and Legacy of P. L. Chebyshev
• Title not available (Why is that?)
• Ergodic potential
• Explicit solutions for second order operator differential equations with two boundary value conditions
• Markov chains and summability methods
• Explicit solutions for boundary value problems related to the operator equations \(X^{(2)}-AX=0\)
• Evaluation of effective resistances in pseudo-distance-regular resistor networks
• Lumpings of algebraic Markov chains arise from subquotients
• A central limit theorem for the sojourn times of strongly ergodic Markov chains

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 Q5528211)