scientific article; zbMATH DE number 3514781
From MaRDI portal
Publication:4094202
Cited in
(only showing first 100 items - show all)- The fine structure of the stationary distribution for a simple Markov process
- 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
- Applications of the fundamental matrix to mean absorption and conditional mean absorption problems
- The tropical analogue of the Helton-Nie conjecture is true
- Susceptible-exposed-infectious model using Markov chains
- Probabilistic Analysis of Binary Sessions
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- First hitting time analysis of the independence Metropolis sampler
- Exponential convergence to equilibrium for a class of random-walk models
- Switched PIOA: parallel composition via distributed scheduling
- Invitation to research of new mathematics from biology: Evolution algebras
- A game theoretic model of the behavioural gaming that takes place at the EMS-ED interface
- Lumpability for uncertain continuous-time Markov chains
- Reasoning about proportional lumpability
- Branching bisimulation congruence for probabilistic systems
- Quantization causes waves: smooth finitely computable functions are affine
- Lumpings of Markov chains, entropy rate preservation, and higher-order lumpability
- Efficiency of transportation on weighted extended Koch networks
- A notion of equivalence for stochastic Petri nets
- Evolution of a time dependent Markov model for training and recruitment decisions in manpower planning
- Hitting times, cover cost, and the Wiener index of a tree
- Balanced partitions for Markov chains
- Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices
- Fitting feature-dependent Markov chains
- Heavy-traffic limits for stationary network flows
- A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
- Statistical estimation with bounded memory
- The complexity of reachability in parametric Markov decision processes
- General patterns of interaction in stochastic fusion
- A first hitting time approach to finding effective spreaders in a network
- Directed forests and the constancy of Kemeny's constant
- EMBEDDED MATRICES FOR FINITE MARKOV CHAINS
- Estimation of ergodic agent-based models by simulated minimum distance
- Complete multipartite graphs and Braess edges
- Bayesian estimation of agent-based models
- ``Pass the buck on a complete binary tree
- Appointments in care pathways: the \(\mathrm{Geo}^x/\mathrm{D}/1\) queue with slot reservations
- On Block Skip Free Transition Matrices and First Passage Times
- The mixture transition distribution model for high-order Markov chains and non-Gaussian time series
- Matrices with a strictly dominant eigenvalue
- Kemeny's constant and an analogue of Braess' paradox for trees
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- A new general analytical approach for modeling patterns of genetic differentiation and effective size of subdivided populations over time
- A probabilistic algorithm for aggregating vastly undersampled large Markov chains
- The Augmented Semi-Markov System in Continuous Time
- Critical dynamics of the three-dimensional Ising model: a Monte Carlo study
- SIA matrices and non-negative subdivision
- On the statistical analysis of grouped markov chains
- On undiscounted semi-Markov decision processes with absorbing states
- State reduction in a Markov decision process
- Informational influence and informational control models in social networks
- Opinion influence and evolution in social networks: a Markovian agents model
- Quantitative static analysis of communication protocols using abstract Markov chains
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- A multi-cluster time aggregation approach for Markov chains
- Perturbations of finite networks and asymptotic periodicity of flow semigroups
- Navigation in spatial networks: a survey
- Trapping on modular scale-free and small-world networks with multiple hubs
- The hitting time of multiple random walks
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Stationary distribution and perturbation bounds for a stochastic inventory model
- A finite characterization of weak lumpable Markov processes. I: The discrete time case
- Tilings and discrete Dirichlet problems
- A finite characterization of weak lumpable Markov processes. II: The continuous time case
- Application of a Markovian ancestral model to the temporal and spatial dynamics of cultural evolution on a population network
- A gradual facilitate high-order multivariate Markov chains model with application to the changes of exchange rates in Egypt: new approach
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
- Implications of iterative communication for biological system performance
- Spectral coarse graining for random walks in bipartite networks
- Ballistic regime for random walks in random environment with unbounded jumps and Knudsen billiards
- Observations on some special matrices and polynomials
- On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems
- Matsumoto-Yor and Dufresne type theorems for a random walk on positive definite matrices
- On zero-sum two-person undiscounted semi-Markov games with a multichain structure
- Equivalence checking 40 years after: a review of bisimulation tools
- On a diversity of perspectives and world views: learning under Bayesian vis-á-vis DeGroot updating
- 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
- Hypothesis testing for panels of semi-Markov processes with parametric sojourn time distributions
- Covariances between transient states in finite absorbing Markov chains
- Attracting graphs of skew products with non-contracting fiber maps
- A theoretical framework for simulated annealing
- On time duality for Markov chains
- Coupling and self-stabilization
- Exact results for accepting probabilities of quantum automata.
- Symbolic dynamics and entropy analysis of Feigenbaum limit sets
- Comparison of mean hitting times for a degree-biased random walk
- 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
- Network interpolation
- The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
- Families of graphs with twin pendent paths and the Braess edge
- Normal distributions of finite Markov chains
- Command-based importance sampling for statistical model checking
- Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from 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 Q4094202)
