scientific article; zbMATH DE number 3236503
From MaRDI portal
Publication:5524074
Cited in
(only showing first 100 items - show all)- Transient nearest neighbor random walk on the line
- Asymptotic expansions of backward equations for two-time-scale Markov chains in continuous time
- Bias optimality for multichain continuous-time Markov decision processes
- Transient nearest neighbor random walk and Bessel process
- Occupation times for countable Markov chains. II. Chains with continuous time
- Transience and volumes of trees
- On the range of a regenerative sequence
- Simple random walks on trees
- A general class of Markov processes with explicit matrix-geometric solutions
- Discrete-time conversion for simulating semi-Markov processes
- Extreme values of birth and death processes and queues
- Stochastic flows on a countable set: Convergence in distribution
- Random walk in random environment: A counterexample?
- The birth and death processes with zero as their absorbing barrier
- Simulation methods of queues: An overview
- Exponential convergence to equilibrium for a class of random-walk models
- Some asymptotic results for the branching process with immigration
- Equivalent descriptions of perturbed Markov processes
- Wiener analysis of functionals of a Markov chain: Application to neural transformations of random signals
- Analog of the limit theorem for ratios in the case of parts of an increasing chain
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Perturbations of countable Markov chains and processes
- Guidelines for choosing the transition matrix in Monte Carlo methods using Markov chains
- A renewal approach to the Perron-Frobenius theory of non-negative kernels on general state spaces
- Continuous time Markov decision programming with average reward criterion and unbounded reward rate
- Continuous parameter circuit processes with finite state space
- Stability of token passing rings
- On the structure of 1-dependent Markov chains
- An optimal algorithm for the period of a strongly connected digraph
- Über die Summe Markoffscher Ketten auf Halbgruppen
- Prediction and smoothing for partially observed Markov chains
- Random walks on graphs
- The oscillating random walk
- Metric theorems related to the Kronecker-Weyl theorem mod m
- On the concepts of \(\alpha\)-recurrence and \(\alpha\)-transience for Markov renewal processes
- A random-walk model of human mortality and aging
- Excursions in Brownian motion
- Perturbation models
- Modes of convergence of Markov chain transition probabilities
- Ergodic potential
- Modeling Markovian biological systems via optimization operators
- A self-correcting point process
- The age of a Markov process
- Structural properties of Markov chains with weak and strong interactions
- Uniform acceleration expansions for Markov chains with time-varying rates
- Stochastic comparability and dual \(Q\)-functions
- Absorbing Markov and branching processes with instantaneous resurrection
- Transient product form distributions in queueing networks
- Some topics in regenerative steady-state simulation
- Asymptotic expansions in sequential estimation for the first-order random coefficient autoregressive model: Regenerative approach
- Diffusive clustering in an infinite system of hierarchically interacting diffusions
- Existence and uniqueness criteria for conservative uni-instantaneous denumerable Markov processes
- On the strong law of large numbers for functionals of countable nonhomogeneous Markov chains
- Optimal models for the first arrival time distribution function in continuous time -- with a special case
- Features of some discrete-time cyclic queueing networks
- Thresholds and initial growth rates in a model of parasitic infection
- Global annealing genetic algorithm and its convergence analysis
- Control of dynamic systems under the influence of singularly perturbed Markov chains
- Large deviation principle for random walk in a quenched random environment in the flow speed regime
- Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach
- How many probes are needed to compute the maximum of a random walk?
- Further results on the relationship between \(\mu\)-invariant measures and quasi-stationary distributions for absorbing continuous-time Markov chains.
- Some dichotomy results for functionals of Harris recurrent Markov chains
- Annealed scaling for a charged polymer
- The risk probability criterion for discounted continuous-time Markov decision processes
- A Markov chain description of the stepwise mutation model: local and global behaviour of the allele process
- Growth of normalizing sequences in limit theorems for conservative maps
- Upper escape rate for weighted graphs via metric graphs
- Edgeworth expansions of suitably normalized sample mean statistics for atomic Markov chains
- Necessary conditions in limit theorems for cumulative processes.
- Limiting distribution for subcritical controlled branching processes with random control function
- Bridges and networks: exact asymptotics
- Singularly perturbed diffusisons: Rapid switchings and fast diffusions.
- \(R\)-positivity, quasi-stationary distributions and ratio limit theorems for a class of probabilistic automata
- Erzeugung äquivalenter Summierungsverfahren durch Matrizenprodukte
- Uniqueness and extinction properties of generalised Markov branching processes
- Polynomial convergence rates of Markov chains
- Rescaled voter models converge to super-Brownian motion.
- Empirical law of the iterated logarithm for Markov chains with a countable state space.
- The CLT for Markov chains with a countable state space embedded in the space \(l_p\).
- On extremes and streams of upcrossing.
- Markov branching processes regulated by emigration and large immigration
- A dichotomy property for Markov measures
- Random walks on generalized lattices
- Asymptotic properties of the maximum likelihood estimator for spatio-temporal point processes
- On the convergence of the Markov chain simulation method
- A mean-variance optimization problem for discounted Markov decision processes
- Hitting times with taboo for a random walk
- Markov decision processes in service facilities holding perishable inventory
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Absence of mass gap for a class of stochastic contour models.
- On the stability of crystal growth.
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- Singularly perturbed Markov chains: Convergence and aggregation
- Self-normalized Cramér-type moderate deviations for functionals of Markov chain
- Randomized multivariate central limit theorems for ergodic homogeneous random fields
- On the approximation of extinction time for the discrete-time birth-death circuit chains in random environments
- Periodic words, common subsequences and frogs
- Strong Gaussian approximation for cumulative processes
- Spatial birth-and-death processes with a finite number of particles
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 Q5524074)