By the technique of augmented truncations, we obtain the perturbation bounds on the distance of the finite-time state distributions of two continuous-time Markov chains (CTMCs) in a type of weaker norm than the V-norm. We derive the estimates for strongly and exponentially ergodic CTMCs. In particular, we apply these results to get the bounds for CTMCs satisfying Doeblin or stochastically monotone conditions. Some examples are presented to illustrate the limitation of the V-norm in perturbation analysis and to show the quality of the weak norm.

We study the $R_\beta$-positivity and the existence of zero-temperature limits for a sequence of infinite-volume Gibbs measures $(\mu_{\beta}(\!\cdot\!))_{\beta \geq 0}$ at inverse temperature $\beta$ associated to a family of nearest-neighbor matrices $(Q_{\beta})_{\beta \geq 0}$ reflected at the origin. We use a probabilistic approach based on the continued fraction theory previously introduced in Ferrari and Martínez (1993) and sharpened in Littin and Martínez (2010). Some necessary and sufficient conditions are provided to ensure (i) the existence of a unique infinite-volume Gibbs measure for large but finite values of $\beta$, and (ii) the existence of weak limits as $\beta \to \infty$. Some application examples are revised to put in context the main results of this work.

We establish the exponential nonuniform Berry–Esseen bound for the maximum likelihood estimator of unknown drift parameter in an ultraspherical Jacobi process using the change of measure method and precise asymptotic analysis techniques. As applications, the optimal uniform Berry–Esseen bound and optimal Cramér-type moderate deviation for the corresponding maximum likelihood estimator are obtained.

Gaussian process regression is widely used to model an unknown function on a continuous domain by interpolating a discrete set of observed design points. We develop a theoretical framework for proving new moderate deviations inequalities on different types of error probabilities that arise in GP regression. Two specific examples of broad interest are the probability of falsely ordering pairs of points (incorrectly estimating one point as being better than another) and the tail probability of the estimation error at an arbitrary point. Our inequalities connect these probabilities to the mesh norm, which measures how well the design points fill the space.

We consider a discrete-time population growth system called the Bienaymé–Galton–Watson stochastic branching system. We deal with a noncritical case, in which the per capita offspring mean $m\neq1$. The famous Kolmogorov theorem asserts that the expectation of the population size in the subcritical case $m<1$ on positive trajectories of the system asymptotically stabilizes and approaches ${1}/\mathcal{K}$, where $\mathcal{K}$ is called the Kolmogorov constant. The paper is devoted to the search for an explicit expression of this constant depending on the structural parameters of the system. Our argumentation is essentially based on the basic lemma describing the asymptotic expansion of the probability-generating function of the number of individuals. We state this lemma for the noncritical case. Subsequently, we find an extended analogue of the Kolmogorov constant in the noncritical case. An important role in our discussion is also played by the asymptotic properties of transition probabilities of the Q-process and their convergence to invariant measures. Obtaining the explicit form of the extended Kolmogorov constant, we refine several limit theorems of the theory of noncritical branching systems, showing explicit leading terms in the asymptotic expansions.

Candidates arrive sequentially for an interview process which results in them being ranked relative to their predecessors. Based on the ranks available at each time, a decision mechanism must be developed that selects or dismisses the current candidate in an effort to maximize the chance of selecting the best. This classical version of the ‘secretary problem’ has been studied in depth, mostly using combinatorial approaches, along with numerous other variants. We consider a particular new version where, during reviewing, it is possible to query an external expert to improve the probability of making the correct decision. Unlike existing formulations, we consider experts that are not necessarily infallible and may provide suggestions that can be faulty. For the solution of our problem we adopt a probabilistic methodology and view the querying times as consecutive stopping times which we optimize with the help of optimal stopping theory. For each querying time we must also design a mechanism to decide whether or not we should terminate the search at the querying time. This decision is straightforward under the usual assumption of infallible experts, but when experts are faulty it has a far more intricate structure.

We explore the limiting spectral distribution of large-dimensional random permutation matrices, assuming the underlying population distribution possesses a general dependence structure. Let $\textbf X = (\textbf x_1,\ldots,\textbf x_n)$ $\in \mathbb{C} ^{m \times n}$ be an $m \times n$ data matrix after self-normalization (n samples and m features), where $\textbf x_j = (x_{1j}^{*},\ldots, x_{mj}^{*} )^{*}$. Specifically, we generate a permutation matrix $\textbf X_\pi$ by permuting the entries of $\textbf x_j$ $(j=1,\ldots,n)$ and demonstrate that the empirical spectral distribution of $\textbf {B}_n = ({m}/{n})\textbf{U} _{n} \textbf{X} _\pi \textbf{X} _\pi^{*} \textbf{U} _{n}^{*}$ weakly converges to the generalized Marčenko–Pastur distribution with probability 1, where $\textbf{U} _n$ is a sequence of $p \times m$ non-random complex matrices. The conditions we require are $p/n \to c >0$ and $m/n \to \gamma > 0$.

We study the asymptotic behaviour of the expectation of the maxima and minima of a random assignment process generated by a large matrix with multinomial entries. A variety of results is obtained for different sparsity regimes.

Multivariate regular variation is a key concept that has been applied in finance, insurance, and risk management. This paper proposes a new dependence assumption via a framework of multivariate regular variation. Under the condition that financial and insurance risks satisfy our assumption, we conduct asymptotic analyses for multidimensional ruin probabilities in the discrete-time and continuous-time cases. Also, we present a two-dimensional numerical example satisfying our assumption, through which we show the accuracy of the asymptotic result for the discrete-time multidimensional insurance risk model.

In the classical gambler’s ruin problem, the gambler plays an adversary with initial capitals z and $a-z$, respectively, where $a>0$ and $0< z < a$ are integers. At each round, the gambler wins or loses a dollar with probabilities p and $1-p$. The game continues until one of the two players is ruined. For even a and $0<z\leq {a}/{2}$, the family of distributions of the duration (total number of rounds) of the game indexed by $p \in [0,{\frac{1}{2}}]$ is shown to have monotone (increasing) likelihood ratio, while for ${a}/{2} \leq z<a$, the family of distributions of the duration indexed by $p \in [{\frac{1}{2}}, 1]$ has monotone (decreasing) likelihood ratio. In particular, for $z={a}/{2}$, in terms of the likelihood ratio order, the distribution of the duration is maximized over $p \in [0,1]$ by $p={\frac{1}{2}}$. The case of odd a is also considered in terms of the usual stochastic order. Furthermore, as a limit, the first exit time of Brownian motion is briefly discussed.

Stationary Poisson processes of lines in the plane are studied, whose directional distributions are concentrated on $k\geq 3$ equally spread directions. The random lines of such processes decompose the plane into a collection of random polygons, which form a so-called Poisson line tessellation. The focus of this paper is to determine the proportion of triangles in such tessellations, or equivalently, the probability that the typical cell is a triangle. As a by-product, a new deviation of Miles’s classical result for the isotropic case is obtained by an approximation argument.

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.

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.

Gaussian graphical models are useful tools for conditional independence structure inference of multivariate random variables. Unfortunately, Bayesian inference of latent graph structures is challenging due to exponential growth of $\mathcal{G}_n$, the set of all graphs in n vertices. One approach that has been proposed to tackle this problem is to limit search to subsets of $\mathcal{G}_n$. In this paper we study subsets that are vector subspaces with the cycle space $\mathcal{C}_n$ as the main example. We propose a novel prior on $\mathcal{C}_n$ based on linear combinations of cycle basis elements and present its theoretical properties. Using this prior, we implement a Markov chain Monte Carlo algorithm, and show that (i) posterior edge inclusion estimates computed with our technique are comparable to estimates from the standard technique despite searching a smaller graph space, and (ii) the vector space perspective enables straightforward implementation of MCMC algorithms.

Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points (v, u) with $v\in\mathcal{V}$ and $u\in\mathcal{U}$ independently with probability $g(v-u)$, where g is a non-increasing radial function, and then connecting two points $v_1,v_2\in\mathcal{V}$ if and only if they have a joint neighbor $u\in\mathcal{U}$. This gives rise to a random intersection graph on $\mathbb{R}^d$. Local properties of the graph, including the degree distribution, are investigated and quantified in terms of the intensities of the underlying Poisson processes and the function g. Furthermore, the percolation properties of the graph are characterized and shown to differ depending on whether g has bounded or unbounded support.

We study the weak convergence of the extremes of supercritical branching Lévy processes $\{\mathbb{X}_t, t \ge0\}$ whose spatial motions are Lévy processes with regularly varying tails. The result is drastically different from the case of branching Brownian motions. We prove that, when properly renormalized, $\mathbb{X}_t$ converges weakly. As a consequence, we obtain a limit theorem for the order statistics of $\mathbb{X}_t$.

More than half a century ago, it was proved that the increasing failure rate (IFR) property is preserved under the formation of k-out-of-n systems (order statistics) when the lifetimes of the components are independent and have a common absolutely continuous distribution function. However, this property has not yet been proved in the discrete case. Here we give a proof based on the log-concavity property of the function $f({{\mathrm{e}}}^x)$. Furthermore, we extend this property to general distribution functions and general coherent systems under some conditions.

Eaton (1992) considered a general parametric statistical model paired with an improper prior distribution for the parameter and proved that if a certain Markov chain, constructed using the model and the prior, is recurrent, then the improper prior is strongly admissible, which (roughly speaking) means that the generalized Bayes estimators derived from the corresponding posterior distribution are admissible. Hobert and Robert (1999) proved that Eaton’s Markov chain is recurrent if and only if its so-called conjugate Markov chain is recurrent. The focus of this paper is a family of Markov chains that contains all of the conjugate chains that arise in the context of a Poisson model paired with an arbitrary improper prior for the mean parameter. Sufficient conditions for recurrence and transience are developed and these are used to establish new results concerning the strong admissibility of non-conjugate improper priors for the Poisson mean.

We show how convergence to the Gumbel distribution in an extreme value setting can be understood in an information-theoretic sense. We introduce a new type of score function which behaves well under the maximum operation, and which implies simple expressions for entropy and relative entropy. We show that, assuming certain properties of the von Mises representation, convergence to the Gumbel distribution can be proved in the strong sense of relative entropy.

We show that an estimate by de la Peña, Ibragimov, and Jordan for ${\mathbb{E}}(X-c)^+$, with c a constant and X a random variable of which the mean, the variance, and $\mathbb{P}(X \leqslant c)$ are known, implies an estimate by Scarf on the infimum of ${\mathbb{E}}(X \wedge c)$ over the set of positive random variables X with fixed mean and variance. This also shows, as a consequence, that the former estimate implies an estimate by Lo on European option prices.