{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:29:10Z","timestamp":1760146150339,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T00:00:00Z","timestamp":1727395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>This paper considers two models of queuing with a varying structure based on the introduction of additional transient intensities into known models or their combinations, which create stationary distributions convenient for calculation. In the first model, it is a probabilistic mixture of known stationary distributions with given weights. In the second model, this uniform distribution is repeatedly used in physical statistics. Both models are based on the selection of states, between which additional transient intensities are introduced. The algorithms used in this paper for introducing new transient intensities are closely related to the concept of flow in a deterministic transport network. The introduced controls are selected so that the marginal distribution of the combined system is a mixture of the marginal distributions of the combined systems with different weights determined by the introduced transient intensities. As a result, the process of functioning of the combined system is obtained by switching processes corresponding to different combined systems at certain points in time.<\/jats:p>","DOI":"10.3390\/computation12100195","type":"journal-article","created":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T07:49:24Z","timestamp":1727423364000},"page":"195","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Networks Based on Graphs of Transient Intensities and Product Theorems in Their Modelling"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2600-0474","authenticated-orcid":false,"given":"Gurami","family":"Tsitsiashvili","sequence":"first","affiliation":[{"name":"Institute for Applied Mathematics, Far Eastern Branch of Russian Academy Sciences, Radio Street 7, 690041 Vladivostok, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Grimmett, G. (2018). Probability on Graphs, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/9781108528986"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Van der Hofstad, R. (2017). Random Graphs and Complex Networks, Cambridge University Press.","DOI":"10.1017\/9781316779422"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/stsy.2019.0057","article-title":"Big jobs arrive early: From critical queues to random graphs","volume":"10","author":"Bet","year":"2020","journal-title":"Stochastic Syst."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kriz, P., and Szala, L. (2020). The Combined Estimator for Stochastic Equations on Graphs with Fractional Noise. Mathematics, 8.","DOI":"10.3390\/math8101766"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jtbi.2019.02.009","article-title":"Methods for approximating stochastic evolutionary dynamics on graphs","volume":"468","author":"Overtona","year":"2019","journal-title":"J. Theor. Biol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ejor.2023.07.001","article-title":"Production, Manufacturing, Transportation and Logistics Admission and pricing optimization of on-street parking with delivery bays","volume":"312","author":"Legros","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"110396","DOI":"10.1016\/j.ress.2024.110396","article-title":"Joint optimization of preventive maintenance and triggering mechanism for k-out-of-n: F systems with protective devices based on periodic inspection","volume":"251","author":"Ning","year":"2024","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1016\/j.ejor.2023.03.043","article-title":"Production, Manufacturing, Transportation and Logistics Managing production-inventory-maintenance systems with condition monitoring","volume":"310","author":"Feng","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","first-page":"107","article-title":"Ideas and facts in the development of the theory of functional systems","volume":"5","author":"Anokhin","year":"1984","journal-title":"Psychol. J."},{"key":"ref_10","unstructured":"Redko, V.G., Prokhorov, D.V., and Burtsev, M.S. (2004, January 25\u201329). Theory of Functional Systems, Adaptive Critics and Neural Networks. Proceedings of the 2004 IEEE International Joint Conference on Neural Networks, Budapest, Hungary."},{"key":"ref_11","first-page":"3","article-title":"Human memory and anatomical features of the hippocampus","volume":"4","author":"Vartanov","year":"2009","journal-title":"Vestn. Moscow. Univ. Ser. 14. Psychol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s00234-005-0032-5","article-title":"Predicting memory performance in normal ageing using different measures of hippocampal size","volume":"48","author":"Lye","year":"2006","journal-title":"Neuroradiology"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.neuroimage.2006.09.041","article-title":"Hippocampal volume is as variable in young as in older adults: Implications for the notion of hippocampal atrophy in humans","volume":"34","author":"Lupien","year":"2007","journal-title":"Neuroimage"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.neuron.2008.12.023","article-title":"The legacy of patient H.M. for neuroscience","volume":"61","author":"Squire","year":"2009","journal-title":"Neuron"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/opre.5.4.518","article-title":"Networks of Waiting Lines","volume":"5","author":"Jackson","year":"1957","journal-title":"Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.15.2.254","article-title":"Closed Queuing Systems with Exponential Servers","volume":"15","author":"Gordon","year":"1967","journal-title":"Oper. Res."},{"key":"ref_17","unstructured":"Pathria, R.K., and Beale, P.D. (2011). Statistical Mechanics, Elsevier. [3rd ed.]."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.shpsb.2017.01.001","article-title":"Maxwell and the normal distribution: A coloured story of probability, independence, and tendency toward equilibrium","volume":"57","author":"Gyenis","year":"2017","journal-title":"Stud. Hist. Philos. Sci. Part Stud. Hist. Philos. Mod. Phys."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Can. J. Math."},{"key":"ref_20","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (1990). Algorithms: Introduction to Second Edition, The MIT Press Cambridge."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.03.065","article-title":"Inefficiency in stochastic queueing systems with strategic customers","volume":"295","author":"Ghosh","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/nav.21931","article-title":"Optimal policies for stochastic clearing systems with time-dependent delay penalties","volume":"67","author":"He","year":"2020","journal-title":"Naval Res. Logist."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1016\/j.apm.2013.09.016","article-title":"The M\/G\/1 queue with disasters and working breakdowns","volume":"38","author":"Kim","year":"2014","journal-title":"Appl. Math. Model."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2415","DOI":"10.1080\/00207543.2023.2217301","article-title":"Order release optimisation for time-dependent and stochastic manufacturing systems","volume":"62","author":"Missbauer","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s11122-005-0021-7","article-title":"New multiplicative theorems for queuing networks","volume":"41","author":"Tsitsiashvili","year":"2005","journal-title":"Probl. Inf. Transm."},{"key":"ref_26","unstructured":"Ivchenko, G.I., Kashtanov, V.A., and Kovalenko, I.N. (1982). Theory of Queuing: A Textbook for Universities, Higher School. (In Russian)."},{"key":"ref_27","unstructured":"Kovalenko, I.N., Kuznetsov, N.Y., and Shurenkov, V.M. (1983). Random Processes, Naukova Dumka. (In Russian)."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1214\/aoap\/1015961155","article-title":"Is network traffic approximated by stable Levy motion or fractional Brownian motion?","volume":"12","author":"Mikosch","year":"2002","journal-title":"Ann. Appl. Probab."},{"key":"ref_29","unstructured":"Stillwell, J. (2004). Mathematics and Its History, Springer Science and Business Media Inc.. [2nd ed.]."},{"key":"ref_30","unstructured":"Vilenkin, N.Y. (1969). Combinatorics, Nauka. (In Russian)."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/10\/195\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:05:02Z","timestamp":1760112302000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/10\/195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,27]]},"references-count":30,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["computation12100195"],"URL":"https:\/\/doi.org\/10.3390\/computation12100195","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2024,9,27]]}}}