In this study, we consider a class of multiple-drawing opposite-reinforcing urns with time-dependent replacement rules. The class has the symmetric property of a Friedman-type urn. We divide the class into a small-increment regime and a large-increment regime. For small-increment schemes, we prove almost-sure convergence and a central limit theorem for the proportion of white balls by stochastic approximation. For large-increment schemes, by assuming the affinity condition, we show almost-sure convergence of the proportion of white balls by martingale theory and present a way to identify the limit distribution of the proportion of white balls.

We investigate vertex levels of containment in a random hypergraph grown in the spirit of a recursive tree. We consider a local profile tracking the evolution of the containment of a particular vertex over time, and a global profile concerned with counts of the number of vertices of a particular containment level.

For the local containment profile, we obtain the exact mean, variance, and probability distribution in terms of standard combinatorial quantities such as generalized harmonic numbers and Stirling numbers of the first kind. Asymptotically, we observe phases: the early vertices have an asymptotically normal distribution, intermediate vertices have a Poisson distribution, and late vertices have a degenerate distribution.

As for the global containment profile, we establish an asymptotically normal distribution for the number of vertices at the smallest containment level as well as their covariances with the number of vertices at the second smallest containment level and the variances of these numbers. The orders in the variance–covariance matrix establish concentration laws.

A retrial queue with classical retrial policy, where each blocked customer in the orbit retries for service, and general retrial times is modeled by a piecewise deterministic Markov process (PDMP). From the extended generator of the PDMP of the retrial queue, we derive the associated martingales. These results are used to derive the conditional expected number of customers in the orbit in the transient regime.

Nakamoto doublespend strategy, described in Bitcoin foundational article, leads to total ruin with positive probability. The simplest strategy that avoids this risk incorporates a stopping threshold when success is unlikely. We compute the exact profitability and the minimal double spend that is profitable for this strategy. For a given amount of the transaction, we determine the minimal number of confirmations to be requested by the recipient that makes the double-spend strategy non-profitable. This number of confirmations is only 1 or 2 for average transactions and for a small relative hashrate of the attacker. This is substantially lower than the original Nakamoto number, which is about six confirmations and is widely used. Nakamoto analysis is only based on the success probability of the attack instead of on a profitability analysis that we carry out.

This paper is devoted to studying the long-term behaviour of a continuous-time Markov chain that can be interpreted as a pair of linear birth processes which evolve with a competitive interaction; as a special case, they include the famous Lotka–Volterra interaction. Another example of our process is related to urn models with ball removal. We show that, with probability one, the process eventually escapes to infinity by sticking to the boundary in a rather unusual way.

We consider a class of correlated Bernoulli variables, which have the following form: for some 0 < p < 1,

$$\begin{align}{P(X_{j+1}=1 \vert {\cal F}_{j})= (1-\theta_j)p+\theta_jS_j/j,}\end{align}$$

$S_n=\sum _{j=1}^nX_j$

${\cal F}_n=\sigma \{X_1,\ldots , X_n\}$

In this paper we develop the theory of the W and Z scale functions for right-continuous (upwards skip-free) discrete-time, discrete-space random walks, along the lines of the analogous theory for spectrally negative Lévy processes. Notably, we introduce for the first time in this context the one- and two-parameter scale functions Z, which appear for example in the joint deficit at ruin and time of ruin problems of actuarial science. Comparisons are made between the various theories of scale functions as one makes time and/or space continuous.

In this paper, we consider a generalized Pólya urn model with multiple drawings and time-dependent reinforcements. Suppose an urn initially contains w white and r red balls. At the nth action, m balls are drawn at random from the urn, say k white and m−k red balls, and then replaced in the urn along with cnk white and cn(m − k) red balls, where {cn} is a given sequence of positive integers. Repeat the above procedure ad infinitum. Let Xn be the proportion of the white balls in the urn after the nth action. We first show that Xn converges almost surely to a random variable X. Next, we give a necessary and sufficient condition for X to have a Bernoulli distribution with parameter w/(w + r). Finally, we prove that X is absolutely continuous if {cn} is bounded.

We discuss a rich family of directed series–parallel (SP) graphs grown by the simultaneous random series or parallel development of multiple edges. The family portrays a spectrum that spans a wide range of SP graphs: from simple models, where only as few as one edge is chosen for evolution at each discrete point in time, to complex hierarchical lattice networks grown by a take-all strategy, where all the edges in the existing network are developed.

The family of SP graphs we discuss is grown from an initial seed graph with τ0 edges under an arbitrary building sequence, $\{k_{n}\}_{n=1}^{\infty}$, of nonnegative integers (with $k_n \le \tau _0 + \sum\nolimits_{i = 1}^n {k_i} $, for arbitrary τ0 ≥ 1), that specifies the number of edges subjected to evolution at time n. We study the average north polar degree and show that we can go beyond averages to strong laws. We also find the exact average number of critical edges. The asymptotics of the critical edges are facilitated under the regularity condition that $k_n/\sum\nolimits_{i = 1}^n {k_i} $ converges to a constant (as n → ∞), a natural condition easily met by practical strategies, such as single-edge evolution and take-all choice, and much in between.

We consider positive zero-sum stochastic games with countable state and action spaces. For each player, we provide a characterization of those strategies that are optimal in every subgame. These characterizations are used to prove two simplification results. We show that if player 2 has an optimal strategy then he/she also has a stationary optimal strategy, and prove the same for player 1 under the assumption that the state space and player 2's action space are finite.

In this paper we are concerned with a model in econophysics, the subfield of statistical physics that applies concepts from traditional physics to economics. Our model is an example of an interacting particle system with disorder, meaning that some of the transition rates are not identical but rather drawn from a fixed distribution. Economical agents are represented by the vertices of a connected graph and are characterized by the number of coins they possess. Agents independently spend one coin at rate one for their basic need, earn one coin at a rate chosen independently from a distribution ϕ, and exchange money at rate µ with one of their nearest neighbors, with the richest neighbor giving one coin to the other neighbor. If an agent needs to spend one coin when his/her fortune is at 0, he/she dies, i.e. the corresponding vertex is removed from the graph. Our first results focus on the two extreme cases of lack of cooperation µ=0 and perfect cooperation µ = ∞ for finite connected graphs. These results suggest that, when overall the agents earn more than they spend, cooperation is beneficial for the survival of the population, whereas when overall the agents earn less than they spend, cooperation becomes detrimental. We also study the infinite one-dimensional system. In this case, when the agents earn less than they spend on average, the density of agents that die eventually is bounded from below by a positive constant that does not depend on the initial number of coins per agent or the level of cooperation.

We are interested in a large queue in a GI/G/k queue with heterogeneous servers. For this, we consider tail asymptotics and weak limit approximations for the stationary distribution of its queue length process in continuous time under a stability condition. Here, two weak limit approximations are considered. One is when the variances of the interarrival and/or service times are bounded, and the other is when they become large. Both require a heavy-traffic condition. Tail asymptotics and heavy-traffic approximations have been separately studied in the literature. We develop a unified approach based on a martingale produced by a good test function for a Markov process to answer both problems.

In this paper we aim to apply simple actuarial methods to build an insurance plan protecting against an epidemic risk in a population. The studied model is an extended SIR epidemic in which the removal and infection rates may depend on the number of registered removals. The costs due to the epidemic are measured through the expected epidemic size and infectivity time. The premiums received during the epidemic outbreak are measured through the expected susceptibility time. Using martingale arguments, a method by recursion is developed to calculate the cost components and the corresponding premium levels in this extended epidemic model. Some numerical examples illustrate the effect of removals and the premium calculation in an insurance plan.

We give a criterion for unlimited growth with positive probability for a large class of multidimensional stochastic models. As a by-product, we recover the necessary and sufficient conditions for recurrence and transience for critical multitype Galton–Watson with immigration processes and also significantly improve some results on multitype size-dependent Galton–Watson processes.

In the spirit of the axiomatic approach by Rogers (1998) we show the equivalence between a set of assumptions on the behaviour of prices and the existence of a representation of these prices as conditional expectations. We rely on only weak assumptions and avoid any a priori modelling of negligible events or of any market filtration. Rather, both endogenously emerge along with the representation as conditional expectations.

We consider a game with K ≥ 2 players, each having an integer-valued fortune. On each round, a pair (i,j) among the players with nonzero fortunes is chosen to play and the winner is decided by flipping a fair coin (independently of the process up to that time). The winner then receives a unit from the loser. All other players' fortunes remain the same. (Once a player's fortune reaches 0, this player is out of the game.) The game continues until only one player wins all. The choices of pairs represent the control present in the problem. While it is known that the expected time to ruin (i.e. expected duration of the game) is independent of the choices of pairs (i,j) (the strategies), our objective is to find a strategy which maximizes the variance of the time to ruin. We show that the maximum variance is uniquely attained by the (optimal) strategy, which always selects a pair of players who have currently the largest fortunes. An explicit formula for the maximum value function is derived. By constructing a simple martingale, we also provide a short proof of a result of Ross (2009) that the expected time to ruin is independent of the strategies. A brief discussion of the (open) problem of minimizing the variance of the time to ruin is given.

We investigate the degree profile and total weight in Apollonian networks. We study the distribution of the degrees of vertices as they age in the evolutionary process. Asymptotically, the (suitably-scaled) degree of a node with a fixed label has a Mittag-Leffler-like limit distribution. The degrees of nodes of later ages have different asymptotic distributions, influenced by the time of their appearance. The very late arrivals have a degenerate distribution. The result is obtained via triangular Pólya urns. Also, via the Bagchi–Pal urn, we show that the number of terminal nodes asymptotically follows a Gaussian law. We prove that the total weight of the network asymptotically follows a Gaussian law, obtained via martingale methods. Similar results carry over to the sister structure of the k-trees, with minor modification in the proof methods, done mutatis mutandis.

This paper is concerned with the bottom-up hierarchical system and public debate model proposed by Galam (2008), as well as a spatial version of the public debate model. In all three models, there is a population of individuals who are characterized by one of two competing opinions, say opinion −1 and opinion +1. This population is further divided into groups of common size s. In the bottom-up hierarchical system, each group elects a representative candidate, whereas in the other two models, all the members of each group discuss at random times until they reach a consensus. At each election/discussion, the winning opinion is chosen according to Galam's majority rule: the opinion with the majority of representatives wins when there is a strict majority, while one opinion, say opinion −1, is chosen by default in the case of a tie. For the public debate models we also consider the following natural updating rule that we call proportional rule: the winning opinion is chosen at random with a probability equal to the fraction of its supporters in the group. The three models differ in term of their population structure: in the bottom-up hierarchical system, individuals are located on a finite regular tree, in the nonspatial public debate model, they are located on a complete graph, and in the spatial public debate model, they are located on the d-dimensional regular lattice. For the bottom-up hierarchical system and nonspatial public debate model, Galam studied the probability that a given opinion wins under the majority rule and, assuming that individuals' opinions are initially independent, making the initial number of supporters of a given opinion a binomial random variable. The first objective of this paper is to revisit Galam's result, assuming that the initial number of individuals in favor of a given opinion is a fixed deterministic number. Our analysis reveals phase transitions that are sharper under our assumption than under Galam's assumption, particularly with small population size. The second objective is to determine whether both opinions can coexist at equilibrium for the spatial public debate model under the proportional rule, which depends on the spatial dimension.

We consider a production-inventory model operating in a stochastic environment that is modulated by a finite state continuous-time Markov chain. When the inventory level reaches zero, an order is placed from an external supplier. The costs (purchasing and holding costs) are modulated by the state at the order epoch time. Applying a matrix analytic approach, fluid flow techniques, and martingales, we develop methods to obtain explicit equations for these cost functionals in the discounted case and under the long-run average criterion. Finally, we extend the model to allow backlogging.