Related papers: Implicit renewal theory in the arithmetic case
Let $Y=\sum_{k\ge 1} 1_{A_k}$ be an infinite sum of the indicators of independent events. We investigate a precise (as opposed to logarithmic) first-order asymptotic behavior of the tail probabilities $\mathbb{P}\{Y\ge n\}$ and the point…
We show that the (Gurevich) topological entropy for the countable Markov shift associated with an infinite transition matrix $A$ coincides with the non-commutative topological entropy for the Exel--Laca algebra associated with $A$, under…
In this paper we show that the intuitionistic fixed point theory FiX^{i}(X) over set theories T is a conservative extension of T if T can manipulate finite sequences and has the full foundation schema.
This paper aims to incorporate the Caflisch's decomposition into the macro-micro decomposition in Boltzmann theory for allowing the microscopic component to exhibit only the polynomial tail in large velocities. In particular, we treat the…
We obtain first decay rates of probabilities of tails of multivariate polynomials built on independent random variables with heavy tails. Then we derive stable limit theorems for nonconventional sums of the form $\sum_{Nt\geq n\geq…
We investigate a way of comparing and classifying tails of random variables. Our approach extends the notion of classical indices, such as exponential and moment indices, which are widely used measuring heaviness of tail functions. A…
We consider the equation R(n)=Q(n)+M(n) R(n-1), with random non-i.i.d. coefficients (Q(n),M(n)), and show that the distribution tails of the stationary solution to this equation are regularly varying at infinity.
This document introduces a generalization of calculus that treats both continuous and discrete variables on an equal footing. This generalization of calculus was developed independently of the "Calculus on Time Scales" literature but may be…
In this paper, we show a series of abstract results on fixed point regularity with respect to a parameter. They are based on a Taylor development taking into account a loss of regularity phenomenon, typically occurring for composition…
One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have…
A basic result in the elementary theory of continued fractions says that two real numbers share the same tail in their continued fraction expansions iff they belong to the same orbit under the projective action of PGL(2,Z). This result was…
A boundary value problem associated to the difference equation with advanced argument \begin{equation} \label{*}\Delta\bigl (a_{n}\Phi(\Delta x_{n})\bigr)+b_{n}\Phi(x_{n+p} )=0,\ \ n\geq1 \tag{$*$} \end{equation} is presented, where…
In a recent article the authors obtained a formula which relates explicitly the tail of risk neutral returns with the wing behavior of the Black Scholes implied volatility smile. In situations where precise tail asymptotics are unknown but…
The aims of this paper are twofold. Firstly, we derive some probabilistic representation for the constant which appears in the one-dimensional case of Kesten's renewal theorem. Secondly, we estimate the tail of some related random variable…
We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…
The rate of uniform convergence in extreme value statistics is non-universal and can be arbitrarily slow. Further, the relative error can be unbounded in the tail of the approximation, leading to difficulty in extrapolating the extreme…
This work proposes a general strategy for solving possibly nonlinear problems arising from implicit time discretizations as a sequence of explicit solutions. The resulting sequence may exhibit instabilities similar to those of the base…
The extremes of a univariate Markov chain with regulary varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper, we extend…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
In the late 1990s, Kim and Vu pioneered an inductive method for showing concentration of certain random variables X. Shortly afterwards, Janson and Ruci{\'n}ski developed an alternative inductive approach, which often gives comparable…