From network problem to cycle processes

DOI10.1016/S0362-546X(96)00228-3zbMath0899.60062MaRDI QIDQ4374131

Sophia L. Kalpazidou

Publication date: 3 November 1998

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

zbMATH Keywords

network problem; rotational representations; cycle Markov processes; cycle representation formula

Mathematics Subject Classification ID

93E10: Estimation and detection in stochastic control theory

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• A geometric representation of a stochastic matrix: Theorem and conjecture
• Rotational representations of transition matrix functions
• On the rotational dimension of stochastic matrices
• Discrete probability and algorithms. Proceedings of the workshops ``Probability and algorithms and ``The finite Markov chain renaissance held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993
• Circuit duality for recurrent Markov processes
• Asymptotic behaviour of sample weighted circuits representing recurrent Markov chains
• AN APPLICATION OF ALGEBRAIC TOPOLOGY TO NUMERICAL ANALYSIS: ON THE EXISTENCE OF A SOLUTION TO THE NETWORK PROBLEM
• Circulation for recurrent markov chains
• Infinite Electrical Networks
• Parabolic networks and polynomial growth
• Rotational representations of stochastic matrices