scholarly journals Subgeometric rates of convergence for Markov processes under subordination

2017 ◽  
Vol 49 (1) ◽  
pp. 162-181 ◽  
Author(s):  
Chang-Song Deng ◽  
René L. Schilling ◽  
Yan-Hong Song
Keyword(s):  
Markov Process ◽  
Invariant Measure ◽  
Convergence Rate ◽  
Rate Of Convergence ◽  
Rates Of Convergence ◽  
Bernstein Function ◽  
Convergence To Equilibrium ◽  
Speed Of Convergence ◽  
Crucial Point ◽  
Original Process

Abstract We are interested in the rate of convergence of a subordinate Markov process to its invariant measure. Given a subordinator and the corresponding Bernstein function (Laplace exponent), we characterize the convergence rate of the subordinate Markov process; the key ingredients are the rate of convergence of the original process and the (inverse of the) Bernstein function. At a technical level, the crucial point is to bound three types of moment (subexponential, algebraic, and logarithmic) for subordinators as time t tends to ∞. We also discuss some concrete models and we show that subordination can dramatically change the speed of convergence to equilibrium.

Rate of convergence to equilibrium of marked Hawkes processes

2002 ◽  
Vol 39 (1) ◽  
pp. 123-136 ◽  
Author(s):  
P. Brémaud ◽  
G. Nappo ◽  
G. L. Torrisi
Keyword(s):  
Rate Of Convergence ◽  
Stationary Process ◽  
Rates Of Convergence ◽  
Stopping Rules ◽  
Convergence To Equilibrium ◽  
Situation Models ◽  
Hawkes Process ◽  
Hawkes Processes ◽  
Simulation Algorithms

In this article we obtain rates of convergence to equilibrium of marked Hawkes processes in two situations. Firstly, the stationary process is the empty process, in which case we speak of the rate of extinction. Secondly, the stationary process is the unique stationary and nontrivial marked Hawkes process, in which case we speak of the rate of installation. The first situation models small epidemics, whereas the results in the second case are useful in deriving stopping rules for simulation algorithms of Hawkes processes with random marks.

Rate of convergence to equilibrium of marked Hawkes processes

2002 ◽  
Vol 39 (01) ◽  
pp. 123-136 ◽  
Author(s):  
P. Brémaud ◽  
G. Nappo ◽  
G. L. Torrisi
Keyword(s):  
Rate Of Convergence ◽  
Stationary Process ◽  
Rates Of Convergence ◽  
Stopping Rules ◽  
Convergence To Equilibrium ◽  
Situation Models ◽  
Hawkes Process ◽  
Hawkes Processes ◽  
Simulation Algorithms

In this article we obtain rates of convergence to equilibrium of marked Hawkes processes in two situations. Firstly, the stationary process is the empty process, in which case we speak of the rate of extinction. Secondly, the stationary process is the unique stationary and nontrivial marked Hawkes process, in which case we speak of the rate of installation. The first situation models small epidemics, whereas the results in the second case are useful in deriving stopping rules for simulation algorithms of Hawkes processes with random marks.

scholarly journals UNIFORM ASYMPTOTIC NORMALITY IN STATIONARY AND UNIT ROOT AUTOREGRESSION

2011 ◽  
Vol 27 (6) ◽  
pp. 1117-1151 ◽  
Author(s):  
Chirok Han ◽  
Peter C. B. Phillips ◽  
Donggyu Sul
Keyword(s):  
Normal Distribution ◽  
Rate Of Convergence ◽  
Unit Root ◽  
Asymptotic Theory ◽  
Signal Strength ◽  
Rates Of Convergence ◽  
Moment Conditions ◽  
First Order ◽  
The Cost ◽  
Artificial Shrinkage

While differencing transformations can eliminate nonstationarity, they typically reduce signal strength and correspondingly reduce rates of convergence in unit root autoregressions. The present paper shows that aggregating moment conditions that are formulated in differences provides an orderly mechanism for preserving information and signal strength in autoregressions with some very desirable properties. In first order autoregression, a partially aggregated estimator based on moment conditions in differences is shown to have a limiting normal distribution that holds uniformly in the autoregressive coefficient ρ, including stationary and unit root cases. The rate of convergence is $\root \of n $ when $\left| \rho \right| < 1$ and the limit distribution is the same as the Gaussian maximum likelihood estimator (MLE), but when ρ = 1 the rate of convergence to the normal distribution is within a slowly varying factor of n. A fully aggregated estimator (FAE) is shown to have the same limit behavior in the stationary case and to have nonstandard limit distributions in unit root and near integrated cases, which reduce both the bias and the variance of the MLE. This result shows that it is possible to improve on the asymptotic behavior of the MLE without using an artificial shrinkage technique or otherwise accelerating convergence at unity at the cost of performance in the neighborhood of unity. Confidence intervals constructed from the FAE using local asymptotic theory around unity also lead to improvements over the MLE.

Computational Models of Bio Heuristics Based on Physical and Cognitive Processes (Review)

2021 ◽  
Vol 27 (11) ◽  
pp. 563-574
Author(s):  
V. V. Kureychik ◽  
◽  
S. I. Rodzin ◽  
Keyword(s):  
Computational Complexity ◽  
Convergence Rate ◽  
Rate Of Convergence ◽  
Cognitive Processes ◽  
Computational Models ◽  
Optimization Problems ◽  
Search Space ◽  
Experimental Results ◽  
Software Implementation ◽  
Minimum Total Length

Computational models of bio heuristics based on physical and cognitive processes are presented. Data on such characteristics of bio heuristics (including evolutionary and swarm bio heuristics) are compared.) such as the rate of convergence, computational complexity, the required amount of memory, the configuration of the algorithm parameters, the difficulties of software implementation. The balance between the convergence rate of bio heuristics and the diversification of the search space for solutions to optimization problems is estimated. Experimental results are presented for the problem of placing Peco graphs in a lattice with the minimum total length of the graph edges.

Acceptability ratings cannot be taken at face value

2020 ◽  
pp. 189-214
Author(s):  
Carson T. Schütze
Keyword(s):  
Rate Of Convergence ◽  
Experimental Work ◽  
Rates Of Convergence ◽  
Original Method ◽  
Journal Articles ◽  
True Rate ◽  
Acceptability Judgments ◽  
Critical Words ◽  
Recent Experimental Work

This chapter addresses how linguists’ empirical (syntactic) claims should be tested with non-linguists. Recent experimental work attempts to measure rates of convergence between data presented in journal articles and the results of large surveys. Three follow-up experiments to one such study are presented. It is argued that the original method may underestimate the true rate of convergence because it leaves considerable room for naïve subjects to give ratings that do not reflect their true acceptability judgments of the relevant structures. To understand what can go wrong, the experiments were conducted in two parts. The first part had visually presented sentences rated on a computer, replicating previous work. The second part was an interview where the experimenter asked the participants about the ratings they gave to particular items, in order to determine what interpretation or parse they had assigned, whether they had missed any critical words, and so on.

The rate of convergence of extremes of stationary normal sequences

1983 ◽  
Vol 15 (01) ◽  
pp. 54-80 ◽  
Author(s):  
Holger Rootzén
Keyword(s):  
Rate Of Convergence ◽  
Joint Distribution ◽  
Point Processes ◽  
Rates Of Convergence ◽  
Joint Distribution Function ◽  
Maximal Correlation ◽  
Standard Normal ◽  
Image Position ◽  
The Right ◽  
Right Order

Let {ξ; t = 1, 2, …} be a stationary normal sequence with zero means, unit variances, and covariances let be independent and standard normal, and write . In this paper we find bounds on which are roughly of the order where ρ is the maximal correlation, ρ =sup {0, r 1 , r 2, …}. It is further shown that, at least for m-dependent sequences, the bounds are of the right order and, in a simple example, the errors are evaluated numerically. Bounds of the same order on the rate of convergence of the point processes of exceedances of one or several levels are obtained using a ‘representation' approach (which seems to be of rather wide applicability). As corollaries we obtain rates of convergence of several functionals of the point processes, including the joint distribution function of the k largest values amongst ξ1, …, ξn.

A class of interacting marked point processes: rate of convergence to equilibrium

2002 ◽  
Vol 39 (1) ◽  
pp. 137-160 ◽  
Author(s):  
G. L. Torrisi
Keyword(s):  
Stochastic Processes ◽  
Rate Of Convergence ◽  
Point Processes ◽  
Marked Point ◽  
Marked Point Processes ◽  
Convergence To Equilibrium ◽  
Birth And Death Processes ◽  
Loss Networks

In this paper we obtain the rate of convergence to equilibrium of a class of interacting marked point processes, introduced by Kerstan, in two different situations. Indeed, we prove the exponential and subexponential ergodicity of such a class of stochastic processes. Our results are an extension of the corresponding results of Brémaud, Nappo and Torrisi. The generality of the dynamics which we take into account allows the application to the so-called loss networks, and multivariate birth and death processes.

Sign in / Sign up

Export Citation Format

Share Document