论高斯马尔可夫过程和波利亚过程

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2024-01-01 DOI:10.1016/j.orl.2023.107062

Kerry Fendick , Ward Whitt

{"title":"论高斯马尔可夫过程和波利亚过程","authors":"Kerry Fendick , Ward Whitt","doi":"10.1016/j.orl.2023.107062","DOIUrl":null,"url":null,"abstract":"<div><p><span><span><span>In previous work we characterized Gaussian Markov processes with </span>stationary increments and showed that they arise as </span>asymptotic approximations for stochastic </span>point processes with a random rate such as Polya processes, which can be useful to model over-dispersion and path-dependent behavior in service system arrival processes. Here we provide additional insight into these stochastic processes.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"52 ","pages":"Article 107062"},"PeriodicalIF":0.8000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Gaussian Markov processes and Polya processes\",\"authors\":\"Kerry Fendick , Ward Whitt\",\"doi\":\"10.1016/j.orl.2023.107062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span><span><span>In previous work we characterized Gaussian Markov processes with </span>stationary increments and showed that they arise as </span>asymptotic approximations for stochastic </span>point processes with a random rate such as Polya processes, which can be useful to model over-dispersion and path-dependent behavior in service system arrival processes. Here we provide additional insight into these stochastic processes.</p></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"52 \",\"pages\":\"Article 107062\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637723002031\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637723002031","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

在之前的工作中，我们对具有静止增量的高斯马尔可夫过程进行了描述，并证明它们是具有随机速率的随机点过程（如波利亚过程）的渐近近似，可用于模拟服务系统到达过程中的过度分散和路径依赖行为。在此，我们将对这些随机过程提出更多见解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Gaussian Markov processes and Polya processes

In previous work we characterized Gaussian Markov processes with stationary increments and showed that they arise as asymptotic approximations for stochastic point processes with a random rate such as Polya processes, which can be useful to model over-dispersion and path-dependent behavior in service system arrival processes. Here we provide additional insight into these stochastic processes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.