Pub Date : 2024-01-05DOI: 10.1007/s11009-023-10059-6
Krzysztof Dȩbicki, Enkelejd Hashorva, Zbigniew Michna
Let (Z(t)= exp left( sqrt{ 2} B_H(t)- left|t right|^{2H}right) , tin mathbb {R}) with (B_H(t),tin mathbb {R}) a standard fractional Brownian motion (fBm) with Hurst parameter (H in (0,1]) and define for x non-negative the Berman function
In this paper we consider a general random field (rf) Z that is a spectral rf of some stationary max-stable rf X and derive the properties of the corresponding Berman functions. In particular, we show that Berman functions can be approximated by the corresponding discrete ones and derive interesting representations of those functions which are of interest for Monte Carlo simulations presented in this article.
让 (Z(t)= exp left( sqrt{ 2} B_H(t)- left|t right|^{2H}right) , tin mathbb {R}) with (B_H(t)、t 在 (mathbb {R})是一个标准的分数布朗运动(fBm),具有赫斯特参数 (H 在 (0,1]),并定义 x 为非负的伯曼函数 $$begin{aligned}mathcal {B}_{Z}(x)= mathbb {E}Left (左) (frac (右) (mathbb {I}{ epsilon _0(RZ) > x}{ epsilon _0(RZ)}right}in (0,infty ), end{aligned}$$其中独立于Z的随机变量R具有生存函数(1/x,xgeqslant 1) and $$begin{aligned}epsilon _0(RZ) = int _{mathbb {R}}RZ(t)> 1right} }{dt} .}{dt} .end{aligned}$$ 在本文中,我们考虑了一个一般随机场(rf)Z,它是某个静态最大稳定随机场 X 的谱随机场,并推导了相应伯曼函数的性质。特别是,我们证明伯曼函数可以用相应的离散函数来近似,并推导出这些函数的有趣表示形式,这些表示形式对本文介绍的蒙特卡罗模拟很有意义。
{"title":"On Berman Functions","authors":"Krzysztof Dȩbicki, Enkelejd Hashorva, Zbigniew Michna","doi":"10.1007/s11009-023-10059-6","DOIUrl":"https://doi.org/10.1007/s11009-023-10059-6","url":null,"abstract":"<p>Let <span>(Z(t)= exp left( sqrt{ 2} B_H(t)- left|t right|^{2H}right) , tin mathbb {R})</span> with <span>(B_H(t),tin mathbb {R})</span> a standard fractional Brownian motion (fBm) with Hurst parameter <span>(H in (0,1])</span> and define for <i>x</i> non-negative the Berman function </p><span>$$begin{aligned} mathcal {B}_{Z}(x)= mathbb {E} left{ frac{ mathbb {I} { epsilon _0(RZ) > x}}{ epsilon _0(RZ)}right} in (0,infty ), end{aligned}$$</span><p>where the random variable <i>R</i> independent of <i>Z</i> has survival function <span>(1/x,xgeqslant 1)</span> and </p><span>$$begin{aligned} epsilon _0(RZ) = int _{mathbb {R}} mathbb {I}{left{ RZ(t)> 1right} }{dt} . end{aligned}$$</span><p>In this paper we consider a general random field (rf) <i>Z</i> that is a spectral rf of some stationary max-stable rf <i>X</i> and derive the properties of the corresponding Berman functions. In particular, we show that Berman functions can be approximated by the corresponding discrete ones and derive interesting representations of those functions which are of interest for Monte Carlo simulations presented in this article.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"10 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139104137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Hawkes process models have been recently become a popular tool for modeling and analysis of neural spike trains. In this article, motivated by neuronal spike trains study, we propose a novel multivariate generalized linear Hawkes process model, where covariates are included in the intensity function. We consider the problem of simultaneous variable selection and estimation for the multivariate generalized linear Hawkes process in the high-dimensional regime. Estimation of the intensity function of the high-dimensional point process is considered within a nonparametric framework, applying B-splines and the SCAD penalty for matters of sparsity. We apply the Doob-Kolmogorov inequality and the martingale central limit theory to establish the consistency and asymptotic normality of the resulting estimators. Finally, we illustrate the performance of our proposal through simulation and demonstrate its utility by applying it to the neuron spike train data set.
霍克斯过程模型近来已成为神经尖峰列车建模和分析的常用工具。本文从神经元尖峰列车研究出发,提出了一种新的多元广义线性霍克斯过程模型,该模型的强度函数中包含协变量。我们考虑了高维条件下多元广义线性霍克斯过程的同步变量选择和估计问题。我们在非参数框架内考虑了高维点过程强度函数的估计问题,在稀疏性问题上应用了 B 样条和 SCAD 惩罚。我们应用 Doob-Kolmogorov 不等式和马氏中心极限理论来确定所得估计值的一致性和渐近正态性。最后,我们通过仿真说明了我们建议的性能,并通过将其应用于神经元尖峰训练数据集来证明其实用性。
{"title":"The Multivariate Generalized Linear Hawkes Process in High Dimensions with Applications in Neuroscience","authors":"Masoumeh Fallahi, Reza Pourtaheri, Farzad Eskandari","doi":"10.1007/s11009-023-10063-w","DOIUrl":"https://doi.org/10.1007/s11009-023-10063-w","url":null,"abstract":"<p>The Hawkes process models have been recently become a popular tool for modeling and analysis of neural spike trains. In this article, motivated by neuronal spike trains study, we propose a novel multivariate generalized linear Hawkes process model, where covariates are included in the intensity function. We consider the problem of simultaneous variable selection and estimation for the multivariate generalized linear Hawkes process in the high-dimensional regime. Estimation of the intensity function of the high-dimensional point process is considered within a nonparametric framework, applying B-splines and the SCAD penalty for matters of sparsity. We apply the Doob-Kolmogorov inequality and the martingale central limit theory to establish the consistency and asymptotic normality of the resulting estimators. Finally, we illustrate the performance of our proposal through simulation and demonstrate its utility by applying it to the neuron spike train data set.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"37 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138742810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-14DOI: 10.1007/s11009-023-10064-9
Sheng Wang, Lijuan Dong
In this paper, the stochastic dynamics of a hybrid delay food chain model with harvesting and Lévy jumps in a polluted environment is studied by using stochastic analysis techniques. Under some basic assumptions, criterions about stochastic persistence in mean and extinction of each species are established, as well as global attractivity and the existence of optimal harvesting strategy (OHS) of the system. The accurate expressions for the optimal harvesting effort (OHE) and the maximum of expectation of sustainable yield (MESY) are given. Our results show that the stochastic dynamics and OHS of the system are closely correlated with both time delays and environmental noises. Finally, some numerical simulations are introduced to illustrate the main results.
{"title":"Stochastic Dynamics of a Hybrid Delay Food Chain Model with Harvesting and Jumps in a Polluted Environment","authors":"Sheng Wang, Lijuan Dong","doi":"10.1007/s11009-023-10064-9","DOIUrl":"https://doi.org/10.1007/s11009-023-10064-9","url":null,"abstract":"<p>In this paper, the stochastic dynamics of a hybrid delay food chain model with harvesting and Lévy jumps in a polluted environment is studied by using stochastic analysis techniques. Under some basic assumptions, criterions about stochastic persistence in mean and extinction of each species are established, as well as global attractivity and the existence of optimal harvesting strategy (OHS) of the system. The accurate expressions for the optimal harvesting effort (OHE) and the maximum of expectation of sustainable yield (MESY) are given. Our results show that the stochastic dynamics and OHS of the system are closely correlated with both time delays and environmental noises. Finally, some numerical simulations are introduced to illustrate the main results.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"87 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138690049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-14DOI: 10.1007/s11009-023-10067-6
Ben O’Neill
This paper examines the classical matching distribution arising in the “problem of coincidences”. We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed probability, and remaining non-matched items are allocated using simple random sampling without replacement. Our generalised matching distribution is a convolution of the classical matching distribution and the binomial distribution. We examine the properties of this latter distribution and show how its probability functions can be computed. We also show how to use the distribution for matching tests and inferences of matching ability.
{"title":"A Generalised Matching Distribution for the Problem of Coincidences","authors":"Ben O’Neill","doi":"10.1007/s11009-023-10067-6","DOIUrl":"https://doi.org/10.1007/s11009-023-10067-6","url":null,"abstract":"<p>This paper examines the classical matching distribution arising in the “problem of coincidences”. We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed probability, and remaining non-matched items are allocated using simple random sampling without replacement. Our generalised matching distribution is a convolution of the classical matching distribution and the binomial distribution. We examine the properties of this latter distribution and show how its probability functions can be computed. We also show how to use the distribution for matching tests and inferences of matching ability.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"17 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138630184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-29DOI: 10.1007/s11009-023-10069-4
Mario Abundo
For a one-dimensional Wiener process with stochastic resetting (mathcal{X}(t)), obtained from an underlying Wiener process X(t), we study the statistical properties of its first-passage time through zero, when starting from (X>0,) and its first-passage area, that is the random area enclosed between the time axis and the path of the process (mathcal{X} (t)) up to the first-passage time through zero. By making use of solutions of certain associated ODEs, we are able to find explicit expressions for the Laplace transforms of the first-passage time and the first-passage area, and their single and joint moments.
{"title":"The First-Passage Area of Wiener Process withStochastic Resetting","authors":"Mario Abundo","doi":"10.1007/s11009-023-10069-4","DOIUrl":"https://doi.org/10.1007/s11009-023-10069-4","url":null,"abstract":"<p>For a one-dimensional Wiener process with stochastic resetting <span>(mathcal{X}(t))</span>, obtained from an underlying Wiener process <i>X</i>(<i>t</i>), we study the statistical properties of its first-passage time through zero, when starting from <span>(X>0,)</span> and its first-passage area, that is the random area enclosed between the time axis and the path of the process <span>(mathcal{X} (t))</span> up to the first-passage time through zero. By making use of solutions of certain associated ODEs, we are able to find explicit expressions for the Laplace transforms of the first-passage time and the first-passage area, and their single and joint moments.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"235 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-23DOI: 10.1007/s11009-023-10070-x
Jyy-I Hong, Joseph Najnudel, Siang-Mao Rao, Ju-Yi Yen
An apportionment paradox occurs when the rules for apportionment in a political system or distribution system produce results which seem to violate common sense. For example, The Alabama paradox occurs when the total number of seats increases but decreases the allocated number of a state and the population paradox occurs when the population of a state increases but its allocated number of seats decreases. The Balinski-Young impossibility theorem showed that there is no deterministic apportionment method that can avoid the violation of the quota rule and doesn’t have both the Alabama and the population paradoxes. In this paper, we propose a randomized apportionment method as a stochastic solution to the Balinski-Young impossibility.
{"title":"Random Apportionment: A Stochastic Solution to the Balinski-Young Impossibility","authors":"Jyy-I Hong, Joseph Najnudel, Siang-Mao Rao, Ju-Yi Yen","doi":"10.1007/s11009-023-10070-x","DOIUrl":"https://doi.org/10.1007/s11009-023-10070-x","url":null,"abstract":"<p>An apportionment paradox occurs when the rules for apportionment in a political system or distribution system produce results which seem to violate common sense. For example, The Alabama paradox occurs when the total number of seats increases but decreases the allocated number of a state and the population paradox occurs when the population of a state increases but its allocated number of seats decreases. The Balinski-Young impossibility theorem showed that there is no deterministic apportionment method that can avoid the violation of the quota rule and doesn’t have both the Alabama and the population paradoxes. In this paper, we propose a randomized apportionment method as a stochastic solution to the Balinski-Young impossibility.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-21DOI: 10.1007/s11009-023-10068-5
Frosso S. Makri, Zaharias M. Psillakis
On a finite sequence of binary (0-1) trials we define a random variable enumerating patterns of length subject to certain constraints. For sequences of independent and identically distributed binary trials exact probability mass functions are established in closed forms by means of combinatorial analysis. An explicit expression of the mean value of this random variable is obtained. The results associated with the probability mass functions are extended on sequences of exchangeable binary trials. An application in Information theory concerning counting of a class of run-length-limited binary sequences is provided as a direct byproduct of our study. Illustrative numerical examples exemplify further the results.
{"title":"Distribution of Patterns of Constrained Length in Binary Sequences","authors":"Frosso S. Makri, Zaharias M. Psillakis","doi":"10.1007/s11009-023-10068-5","DOIUrl":"https://doi.org/10.1007/s11009-023-10068-5","url":null,"abstract":"<p>On a finite sequence of binary (0-1) trials we define a random variable enumerating patterns of length subject to certain constraints. For sequences of independent and identically distributed binary trials exact probability mass functions are established in closed forms by means of combinatorial analysis. An explicit expression of the mean value of this random variable is obtained. The results associated with the probability mass functions are extended on sequences of exchangeable binary trials. An application in Information theory concerning counting of a class of run-length-limited binary sequences is provided as a direct byproduct of our study. Illustrative numerical examples exemplify further the results.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"36 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-20DOI: 10.1007/s11009-023-10062-x
Tao Jiang, Li Gao, Xudong Chai
Waiting is a major factor influencing the perception of delay-sensitive customers in the service industry. In the process of queueing, some customers often have a psychological expectation of waiting time in the face of uncertain delay information, so that customer service utility depends not only on the actual waiting time, but also on the relative amount of the actual waiting time and the psychological expectation of waiting time. Therefore, this paper investigates how the reference time effect affects heterogeneous customers' queueing decisions and service system efficiency measures (system throughput and social welfare) in an M/G/1 queue with limited service resources and capacity. The results show that the equilibrium joining probability of customers, the system throughput and social welfare are relatively higher as the proportion of customers with high tolerance levels in the queue increases. In addition, the maintenance of customer homogeneity is better for the improvement of service resource utilization, while the maintenance of customer heterogeneity is better for social welfare. As the psychological expected waiting time increases, the equilibrium joining probability of potential customers and the system throughput increase, while the equilibrium joining probability of existing customers decreases, and the social welfare shows a non-monotonic trend of first decreasing and then increasing. The equilibrium queueing strategies for each type of customer and the service system efficiency measures are not monotonic with the change of the reference time effect parameter. Finally, the optimal social welfare is increasing with respect to the degree of reference time effect and the psychological expectation of waiting time.
{"title":"Equilibrium Queueing Strategies in M/G/1 Queues with the Reference Time Effect","authors":"Tao Jiang, Li Gao, Xudong Chai","doi":"10.1007/s11009-023-10062-x","DOIUrl":"https://doi.org/10.1007/s11009-023-10062-x","url":null,"abstract":"<p>Waiting is a major factor influencing the perception of delay-sensitive customers in the service industry. In the process of queueing, some customers often have a psychological expectation of waiting time in the face of uncertain delay information, so that customer service utility depends not only on the actual waiting time, but also on the relative amount of the actual waiting time and the psychological expectation of waiting time. Therefore, this paper investigates how the reference time effect affects heterogeneous customers' queueing decisions and service system efficiency measures (system throughput and social welfare) in an M/G/1 queue with limited service resources and capacity. The results show that the equilibrium joining probability of customers, the system throughput and social welfare are relatively higher as the proportion of customers with high tolerance levels in the queue increases. In addition, the maintenance of customer homogeneity is better for the improvement of service resource utilization, while the maintenance of customer heterogeneity is better for social welfare. As the psychological expected waiting time increases, the equilibrium joining probability of potential customers and the system throughput increase, while the equilibrium joining probability of existing customers decreases, and the social welfare shows a non-monotonic trend of first decreasing and then increasing. The equilibrium queueing strategies for each type of customer and the service system efficiency measures are not monotonic with the change of the reference time effect parameter. Finally, the optimal social welfare is increasing with respect to the degree of reference time effect and the psychological expectation of waiting time.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"74 2 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-13DOI: 10.1007/s11009-023-10066-7
Fan Yang, Yi Zhang
{"title":"Asymptotics of Sum of Heavy-tailed Risks with Copulas","authors":"Fan Yang, Yi Zhang","doi":"10.1007/s11009-023-10066-7","DOIUrl":"https://doi.org/10.1007/s11009-023-10066-7","url":null,"abstract":"","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"43 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136348597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}