首页 > 最新文献

Journal of Applied Probability最新文献

英文 中文
Inequalities between time and customer averages for HNB(W)UE arrival processes HNB(W)UE 到达过程的时间和客户平均值之间的不等式
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-03-21 DOI: 10.1017/jpr.2023.120
Shigeo Shioda, Kana Nakano
We show that for arrival processes, the ‘harmonic new better than used in expectation’ (HNBUE) (or ‘harmonic new worse than used in expectation’, HNWUE) property is a sufficient condition for inequalities between the time and customer averages of the system if the state of the system between arrival epochs is stochastically decreasing and convex and the lack of anticipation assumption is satisfied. HNB(W)UE is a wider class than NB(W)UE, being the largest of all available classes of distributions with positive (negative) aging properties. Thus, this result represents an important step beyond existing result on inequalities between time and customer averages, which states that for arrival processes, the NB(W)UE property is a sufficient condition for inequalities.
我们证明,对于到达过程,如果系统在到达历时之间的状态是随机递减和凸的,并且满足缺乏预期假设,那么 "谐波新值优于预期用过的值"(HNBUE)(或 "谐波新值劣于预期用过的值",HNWUE)特性就是系统时间平均值和客户平均值之间不等式的充分条件。与 NB(W)UE 相比,HNB(W)UE 的范围更广,是所有具有正(负)时效特性的分布中最大的一类。因此,这一结果比关于时间与客户平均值不等式的现有结果迈出了重要的一步,现有结果指出,对于到达过程,NB(W)UE 属性是不等式的充分条件。
{"title":"Inequalities between time and customer averages for HNB(W)UE arrival processes","authors":"Shigeo Shioda, Kana Nakano","doi":"10.1017/jpr.2023.120","DOIUrl":"https://doi.org/10.1017/jpr.2023.120","url":null,"abstract":"We show that for arrival processes, the ‘harmonic new better than used in expectation’ (HNBUE) (or ‘harmonic new worse than used in expectation’, HNWUE) property is a sufficient condition for inequalities between the time and customer averages of the system if the state of the system between arrival epochs is stochastically decreasing and convex and the lack of anticipation assumption is satisfied. HNB(W)UE is a wider class than NB(W)UE, being the largest of all available classes of distributions with positive (negative) aging properties. Thus, this result represents an important step beyond existing result on inequalities between time and customer averages, which states that for arrival processes, the NB(W)UE property is a sufficient condition for inequalities.","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140200586","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}
引用次数: 0
Asymptotic results for sums and extremes 和与极值的渐近结果
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-03-13 DOI: 10.1017/jpr.2023.118
Rita Giuliano, Claudio Macci, Barbara Pacchiarotti

The term moderate deviations is often used in the literature to mean a class of large deviation principles that, in some sense, fills the gap between a convergence in probability of some random variables to a constant, and a weak convergence to a centered Gaussian distribution (when such random variables are properly centered and rescaled). We talk about noncentral moderate deviations when the weak convergence is towards a non-Gaussian distribution. In this paper we prove a noncentral moderate deviation result for the bivariate sequence of sums and maxima of independent and identically distributed random variables bounded from above. We also prove a result where the random variables are not bounded from above, and the maxima are suitably normalized. Finally, we prove a moderate deviation result for sums of partial minima of independent and identically distributed exponential random variables.

文献中经常使用 "中等偏差 "一词来指一类大偏差原理,从某种意义上说,它填补了某些随机变量向常数概率收敛与向居中高斯分布弱收敛之间的空白(当这些随机变量被适当地居中和重定标时)。当弱收敛于非高斯分布时,我们谈论非中心适度偏差。在本文中,我们证明了独立且同分布随机变量的和与最大值双变量序列的非中心中等偏差结果。我们还证明了一个随机变量无上界、最大值适当归一化的结果。最后,我们证明了独立且同分布指数随机变量部分最小值之和的中等偏差结果。
{"title":"Asymptotic results for sums and extremes","authors":"Rita Giuliano, Claudio Macci, Barbara Pacchiarotti","doi":"10.1017/jpr.2023.118","DOIUrl":"https://doi.org/10.1017/jpr.2023.118","url":null,"abstract":"<p>The term <span>moderate deviations</span> is often used in the literature to mean a class of large deviation principles that, in some sense, fills the gap between a convergence in probability of some random variables to a constant, and a weak convergence to a centered Gaussian distribution (when such random variables are properly centered and rescaled). We talk about <span>noncentral moderate deviations</span> when the weak convergence is towards a non-Gaussian distribution. In this paper we prove a noncentral moderate deviation result for the bivariate sequence of sums and maxima of independent and identically distributed random variables bounded from above. We also prove a result where the random variables are not bounded from above, and the maxima are suitably normalized. Finally, we prove a moderate deviation result for sums of partial minima of independent and identically distributed <span>exponential</span> random variables.</p>","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140115903","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}
引用次数: 0
Color-avoiding percolation and branching processes 避色渗流和分支过程
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-03-08 DOI: 10.1017/jpr.2023.115
Panna Tímea Fekete, Roland Molontay, Balázs Ráth, Kitti Varga
We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly) edge-colored Erdős–Rényi random graphs. We say that two vertices are color-avoiding connected in an edge-colored graph if, after the removal of the edges of any color, they are in the same component in the remaining graph. The color-avoiding connected components of an edge-colored graph are maximal sets of vertices such that any two of them are color-avoiding connected. We consider the fraction of vertices contained in color-avoiding connected components of a given size, as well as the fraction of vertices contained in the giant color-avoidin g connected component. It is known that these quantities converge, and the limits can be expressed in terms of probabilities associated to edge-colored branching process trees. We provide explicit formulas for the limit of the fraction of vertices contained in the giant color-avoiding connected component, and we give a simpler asymptotic expression for it in the barely supercritical regime. In addition, in the two-colored case we also provide explicit formulas for the limit of the fraction of vertices contained in color-avoiding connected components of a given size.
我们研究的是克劳斯等人提出的避色渗滤模型的一个变体,即我们研究的是边缘着色的厄尔多斯-雷尼随机图(不一定是正确的)上的避色键渗滤设置。如果去掉任何颜色的边后,两个顶点在剩余图中处于同一分量中,我们就说这两个顶点在边色图中是避色相连的。边缘着色图中的避色连接成分是最大的顶点集合,其中任意两个顶点都是避色连接的。我们考虑的是特定大小的避色连通成分中包含的顶点的分数,以及巨型避色连通成分中包含的顶点的分数。众所周知,这些量是收敛的,极限可以用与边缘着色分支过程树相关的概率来表示。我们为巨型避色连通分量中包含的顶点分数的极限提供了明确的公式,并给出了在勉强超临界情况下的更简单的渐近表达式。此外,在双色情况下,我们还提供了给定大小的避色连通成分所含顶点分数的极限的明确公式。
{"title":"Color-avoiding percolation and branching processes","authors":"Panna Tímea Fekete, Roland Molontay, Balázs Ráth, Kitti Varga","doi":"10.1017/jpr.2023.115","DOIUrl":"https://doi.org/10.1017/jpr.2023.115","url":null,"abstract":"We study a variant of the color-avoiding percolation model introduced by Krause <jats:italic>et al.</jats:italic>, namely we investigate the color-avoiding bond percolation setup on (not necessarily properly) edge-colored Erdős–Rényi random graphs. We say that two vertices are color-avoiding connected in an edge-colored graph if, after the removal of the edges of any color, they are in the same component in the remaining graph. The color-avoiding connected components of an edge-colored graph are maximal sets of vertices such that any two of them are color-avoiding connected. We consider the fraction of vertices contained in color-avoiding connected components of a given size, as well as the fraction of vertices contained in the giant color-avoidin g connected component. It is known that these quantities converge, and the limits can be expressed in terms of probabilities associated to edge-colored branching process trees. We provide explicit formulas for the limit of the fraction of vertices contained in the giant color-avoiding connected component, and we give a simpler asymptotic expression for it in the barely supercritical regime. In addition, in the two-colored case we also provide explicit formulas for the limit of the fraction of vertices contained in color-avoiding connected components of a given size.","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140075069","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}
引用次数: 0
Skew Ornstein–Uhlenbeck processes with sticky reflection and their applications to bond pricing 具有粘性反射的倾斜奥恩斯坦-乌伦贝克过程及其在债券定价中的应用
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-03-06 DOI: 10.1017/jpr.2023.110
Shiyu Song, Guangli Xu

We study a skew Ornstein–Uhlenbeck process with zero being a sticky reflecting boundary, which is defined as the weak solution to a stochastic differential equation (SDE) system involving local time. The main results obtained include: (i) the existence and uniqueness of solutions to the SDE system, (ii) the scale function and speed measure, and (iii) the distributional properties regarding the transition density and the first hitting times. On the application side, we apply the process to interest rate modeling and obtain the explicit pricing formula for zero-coupon bonds. Numerical examples illustrate the impacts on bond yields of skewness and stickiness parameters.

我们研究了一个倾斜的奥恩斯坦-乌伦贝克过程,其零点是一个粘性反射边界,它被定义为一个涉及局部时间的随机微分方程(SDE)系统的弱解。获得的主要结果包括(i) SDE 系统解的存在性和唯一性,(ii) 标度函数和速度度量,以及 (iii) 有关过渡密度和首次命中时间的分布特性。在应用方面,我们将该过程应用于利率建模,并获得了零息债券的显式定价公式。数值示例说明了偏度和粘性参数对债券收益率的影响。
{"title":"Skew Ornstein–Uhlenbeck processes with sticky reflection and their applications to bond pricing","authors":"Shiyu Song, Guangli Xu","doi":"10.1017/jpr.2023.110","DOIUrl":"https://doi.org/10.1017/jpr.2023.110","url":null,"abstract":"<p>We study a skew Ornstein–Uhlenbeck process with zero being a sticky reflecting boundary, which is defined as the weak solution to a stochastic differential equation (SDE) system involving local time. The main results obtained include: (i) the existence and uniqueness of solutions to the SDE system, (ii) the scale function and speed measure, and (iii) the distributional properties regarding the transition density and the first hitting times. On the application side, we apply the process to interest rate modeling and obtain the explicit pricing formula for zero-coupon bonds. Numerical examples illustrate the impacts on bond yields of skewness and stickiness parameters.</p>","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140043941","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}
引用次数: 0
Average Jaccard index of random graphs 随机图的平均杰卡尔指数
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-02-26 DOI: 10.1017/jpr.2023.112
Qunqiang Feng, Shuai Guo, Zhishui Hu
The asymptotic behavior of the Jaccard index in G(n, p), the classical Erdös–Rényi random graph model, is studied as n goes to infinity. We first derive the asymptotic distribution of the Jaccard index of any pair of distinct vertices, as well as the first two moments of this index. Then the average of the Jaccard indices over all vertex pairs in G(n, p) is shown to be asymptotically normal under an additional mild condition that $nptoinfty$ and $n^2(1-p)toinfty$ .
本文研究了经典埃尔德斯-雷尼(Erdös-Rényi)随机图模型 G(n, p) 中 Jaccard 指数随 n 变为无穷大的渐近行为。我们首先推导出任意一对不同顶点的 Jaccard 指数的渐近分布,以及该指数的前两个矩。然后,在一个附加的温和条件下,即 $nptoinfty$ 和 $n^2(1-p)toinfty$ ,G(n, p) 中所有顶点对的雅卡指数平均值被证明是渐近正态的。
{"title":"Average Jaccard index of random graphs","authors":"Qunqiang Feng, Shuai Guo, Zhishui Hu","doi":"10.1017/jpr.2023.112","DOIUrl":"https://doi.org/10.1017/jpr.2023.112","url":null,"abstract":"The asymptotic behavior of the Jaccard index in <jats:italic>G</jats:italic>(<jats:italic>n</jats:italic>, <jats:italic>p</jats:italic>), the classical Erdös–Rényi random graph model, is studied as <jats:italic>n</jats:italic> goes to infinity. We first derive the asymptotic distribution of the Jaccard index of any pair of distinct vertices, as well as the first two moments of this index. Then the average of the Jaccard indices over all vertex pairs in <jats:italic>G</jats:italic>(<jats:italic>n</jats:italic>, <jats:italic>p</jats:italic>) is shown to be asymptotically normal under an additional mild condition that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0021900223001122_inline1.png\" /> <jats:tex-math> $nptoinfty$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0021900223001122_inline2.png\" /> <jats:tex-math> $n^2(1-p)toinfty$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>.","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139979356","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}
引用次数: 0
Analysis of -ary tree algorithms with successive interference cancellation 具有连续干扰消除功能的 -ary 树算法分析
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-02-26 DOI: 10.1017/jpr.2023.107
Quirin Vogel, Yash Deshpande, Cedomir Stefanović, Wolfgang Kellerer
We calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are new. We furthermore disprove the claim that only the binary tree maximizes throughput. Our method works with many observables and can be used as a blueprint for further analysis.
我们计算了具有连续干扰消除功能的随机树算法的平均吞吐量、碰撞次数、成功率和空闲时隙。除了二叉树的吞吐量外,所有结果都是新的。我们还进一步推翻了只有二叉树才能使吞吐量最大化的说法。我们的方法适用于许多观测指标,可作为进一步分析的蓝本。
{"title":"Analysis of -ary tree algorithms with successive interference cancellation","authors":"Quirin Vogel, Yash Deshpande, Cedomir Stefanović, Wolfgang Kellerer","doi":"10.1017/jpr.2023.107","DOIUrl":"https://doi.org/10.1017/jpr.2023.107","url":null,"abstract":"We calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are new. We furthermore disprove the claim that only the binary tree maximizes throughput. Our method works with many observables and can be used as a blueprint for further analysis.","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139979054","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}
引用次数: 0
Connectivity of random graphs after centrality-based vertex removal 基于中心性的顶点移除后随机图的连接性
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-02-23 DOI: 10.1017/jpr.2023.106
Remco van der Hofstad, Manish Pandey
Centrality measures aim to indicate who is important in a network. Various notions of ‘being important’ give rise to different centrality measures. In this paper, we study how important the central vertices are for the connectivity structure of the network, by investigating how the removal of the most central vertices affects the number of connected components and the size of the giant component. We use local convergence techniques to identify the limiting number of connected components for locally converging graphs and centrality measures that depend on the vertex’s neighbourhood. For the size of the giant, we prove a general upper bound. For the matching lower bound, we specialise to the case of degree centrality on one of the most popular models in network science, the configuration model, for which we show that removal of the highest-degree vertices destroys the giant most.
中心性度量旨在说明谁在网络中是重要的。不同的 "重要 "概念产生了不同的中心度量。在本文中,我们通过研究移除最中心顶点对连通成分数量和巨大成分大小的影响,来研究中心顶点对网络连通性结构的重要性。我们使用局部收敛技术来确定局部收敛图的连通成分极限数量,以及取决于顶点邻域的中心性度量。对于巨大分量的大小,我们证明了一个一般上界。对于匹配下限,我们专门研究了网络科学中最流行的模型之一--配置模型--的度中心性,并证明了移除最高度顶点会最大程度地破坏巨型图。
{"title":"Connectivity of random graphs after centrality-based vertex removal","authors":"Remco van der Hofstad, Manish Pandey","doi":"10.1017/jpr.2023.106","DOIUrl":"https://doi.org/10.1017/jpr.2023.106","url":null,"abstract":"Centrality measures aim to indicate who is important in a network. Various notions of ‘being important’ give rise to different centrality measures. In this paper, we study how important the central vertices are for the <jats:italic>connectivity structure</jats:italic> of the network, by investigating how the removal of the most central vertices affects the number of connected components and the size of the giant component. We use <jats:italic>local convergence techniques</jats:italic> to identify the limiting number of connected components for locally converging graphs and centrality measures that depend on the vertex’s neighbourhood. For the size of the giant, we prove a general upper bound. For the matching lower bound, we specialise to the case of <jats:italic>degree centrality</jats:italic> on one of the most popular models in network science, the <jats:italic>configuration model</jats:italic>, for which we show that removal of the highest-degree vertices destroys the giant most.","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139955154","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}
引用次数: 0
Continuous dependence of stationary distributions on parameters for stochastic predator–prey models 捕食者-猎物随机模型的静态分布对参数的连续依赖性
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-02-22 DOI: 10.1017/jpr.2023.98
Nguyen Duc Toan, Nguyen Thanh Dieu, Nguyen Huu Du, Le Ba Dung

This research studies the robustness of permanence and the continuous dependence of the stationary distribution on the parameters for a stochastic predator–prey model with Beddington–DeAngelis functional response. We show that if the model is extinct (resp. permanent) for a parameter, it is still extinct (resp. permanent) in a neighbourhood of this parameter. In the case of extinction, the Lyapunov exponent of predator quantity is negative and the prey quantity converges almost to the saturated situation, where the predator is absent at an exponential rate. Under the condition of permanence, the unique stationary distribution converges weakly to the degenerate measure concentrated at the unique limit cycle or at the globally asymptotic equilibrium when the diffusion term tends to 0.

本研究探讨了贝丁顿-德安吉利斯功能响应随机捕食者-猎物模型的永久性稳健性和静态分布对参数的连续依赖性。我们的研究表明,如果该模型在某一参数上灭绝(或永久),那么在该参数的邻域内它仍然是灭绝(或永久)的。在灭绝的情况下,捕食者数量的 Lyapunov 指数为负值,猎物数量几乎收敛到饱和状态,即捕食者以指数速度消失。在持久性条件下,当扩散项趋向于 0 时,唯一的静态分布弱收敛于集中于唯一极限周期或全局渐近平衡的退化度量。
{"title":"Continuous dependence of stationary distributions on parameters for stochastic predator–prey models","authors":"Nguyen Duc Toan, Nguyen Thanh Dieu, Nguyen Huu Du, Le Ba Dung","doi":"10.1017/jpr.2023.98","DOIUrl":"https://doi.org/10.1017/jpr.2023.98","url":null,"abstract":"<p>This research studies the robustness of permanence and the continuous dependence of the stationary distribution on the parameters for a stochastic predator–prey model with Beddington–DeAngelis functional response. We show that if the model is extinct (resp. permanent) for a parameter, it is still extinct (resp. permanent) in a neighbourhood of this parameter. In the case of extinction, the Lyapunov exponent of predator quantity is negative and the prey quantity converges almost to the saturated situation, where the predator is absent at an exponential rate. Under the condition of permanence, the unique stationary distribution converges weakly to the degenerate measure concentrated at the unique limit cycle or at the globally asymptotic equilibrium when the diffusion term tends to 0.</p>","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139924463","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}
引用次数: 0
JPR volume 61 issue 1 Cover and Back matter 日本期刊》第 61 卷第 1 期封面和封底
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-02-16 DOI: 10.1017/jpr.2024.3
{"title":"JPR volume 61 issue 1 Cover and Back matter","authors":"","doi":"10.1017/jpr.2024.3","DOIUrl":"https://doi.org/10.1017/jpr.2024.3","url":null,"abstract":"","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139962453","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}
引用次数: 0
Applied Probability Trust prizes 2023 2023 年应用概率信托奖
IF 1 4区 数学 Q2 Mathematics Pub Date : 2024-02-16 DOI: 10.1017/jpr.2024.6
{"title":"Applied Probability Trust prizes 2023","authors":"","doi":"10.1017/jpr.2024.6","DOIUrl":"https://doi.org/10.1017/jpr.2024.6","url":null,"abstract":"","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139961175","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}
引用次数: 0
期刊
Journal of Applied Probability
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1