Traffic modeling: monotonic total-connected random walk on a network

MaRDI QIDQ2961189zbMATH OpenFDO

Authors A. S. Bugaev, Alexander P. Buslaev, Marina V. Yashina, Valery V. Kozlov, Alexander G. Tatashev

Publication date 17 February 2017

Full work available at URL http://mathnet.ru/eng/mm3406

zbMATH Keywords

random walkstochastic modelstraffic flows

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Dynamical systems involving maps of the circle (37E10) Interacting particle systems in time-dependent statistical mechanics (82C22) Traffic problems in operations research (90B20)

Recommendations

• Monotonic random walks and clusters flows on networks. Models and traffic applications
• Monotonic random walk on a one-dimensional lattice
• Monotonic walks on a necklace and a coloured dynamic vector
• Monotone random movement of particles on an integer-number- and LyuMen problem line
• scientific article; zbMATH DE number 5735119

Cited in

(8)

• Spectrum of a continuous closed symmetric chain with an arbitrary number of contours
• Monotonic random walk on a one-dimensional lattice
• On real-valued oscillations of a bipendulum
• Counting the corners of a random walk and its application to traffic flow
• Monotonic random walks and clusters flows on networks. Models and traffic applications
• Monotonic walks on a necklace and a coloured dynamic vector
• A dynamical communication system on a network
• A performance measure analysis for traffic networks with random data and general monotone cost functions

This page was built for publication: Traffic modeling: monotonic total-connected random walk on a network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961189)