Consider a well-shuffled deck of cards of n different types where each type occurs m times. In a complete feedback game, a player is asked to guess the top card from the deck. After each guess, the top card is revealed to the player and is removed from the deck. The total number of correct guesses in a complete feedback game has attracted significant interest in the past few decades. Under different regimes of m, n, the expected number of correct guesses, under the greedy (optimal) strategy, has been obtained by various authors, while there are not many results available about the fluctuations. In this paper we establish a central limit theorem with Berry–Esseen bounds when m is fixed and n is large. Our results extend to the case of decks where different types may have different multiplicity, under suitable assumptions.

We investigate the hyperuniformity of marked Gibbs point processes that have weak dependencies among distant points whilst the interactions of close points are kept arbitrary. Various stability and range assumptions are imposed on the Papangelou intensity in order to prove that the resulting point process is not hyperuniform. The scope of our results covers many frequently used models, including Gibbs point processes with a superstable, lower-regular, integrable pair potential, as well as the Widom–Rowlinson model with random radii and Gibbs point processes with interactions based on Voronoi tessellations and nearest-neighbour graphs.

We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e. two particles are interacting if and only if they are connected in the underlying graph. We establish a law of large numbers for the empirical measure of the system that holds whenever the graph sequence is convergent to a graphon. The limit is the solution of a non-linear Fokker–Planck equation weighted by the (possibly random) graphon limit. In contrast with the existing literature, our analysis focuses on both deterministic and random graphons: no regularity assumptions are made on the graph limit and we are able to include general graph sequences such as exchangeable random graphs. Finally, we identify the sequences of graphs, both random and deterministic, for which the associated empirical measure converges to the classical McKean–Vlasov mean-field limit.

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.

We explore a simple model of network dynamics which has previously been applied to the study of information flow in the context of epidemic spreading. A random rooted network is constructed that evolves according to the following rule: at a constant rate, pairs of nodes (i, j) are randomly chosen to interact, with an edge drawn from i to j (and any other out-edge from i deleted) if j is strictly closer to the root with respect to graph distance. We characterise the dynamics of this random network in the limit of large size, showing that it instantaneously forms a tree with long branches that immediately collapse to depth two, then it slowly rearranges itself to a star-like configuration. This curious behaviour has consequences for the study of the epidemic models in which this information network was first proposed.

We introduce an extension to Kermack and McKendrick’s classic susceptible–infected–recovered (SIR) model in epidemiology, whose underlying mechanism of infection consists of individuals attending randomly generated social gatherings. This gives rise to a system of ordinary differential equations (ODEs) where the force of the infection term depends non-linearly on the proportion of infected individuals. Some specific instances yield models already studied in the literature, to which the present work provides a probabilistic foundation. The basic reproduction number is seen to depend quadratically on the average size of the gatherings, which may be helpful in understanding how restrictions on social gatherings affect the spread of the disease. We rigorously justify our model by showing that the system of ODEs is the mean-field limit of the jump Markov process corresponding to the evolution of the disease in a finite population.

We establish power-series expansions for the asymptotic expectations of the vertex number and missed area of random disc-polygons in planar convex bodies with $C^{k+1}_+$-smooth boundaries. These results extend asymptotic formulas proved in Fodor et al. (2014).

We prove existence and uniqueness for the inverse-first-passage time problem for soft-killed Brownian motion using rather elementary methods relying on basic results from probability theory only. We completely avoid the relation to a suitable partial differential equation via a suitable Feynman–Kac representation, which was previously one of the main tools.

Measures of uncertainty are a topic of considerable and growing interest. Recently, the introduction of extropy as a measure of uncertainty, dual to Shannon entropy, has opened up interest in new aspects of the subject. Since there are many versions of entropy, a unified formulation has been introduced to work with all of them in an easy way. Here we consider the possibility of defining a unified formulation for extropy by introducing a measure depending on two parameters. For particular choices of parameters, this measure provides the well-known formulations of extropy. Moreover, the unified formulation of extropy is also analyzed in the context of the Dempster–Shafer theory of evidence, and an application to classification problems is given.

We define and study properties of implied volatility for American perpetual put options. In particular, we show that if the market prices are derived from a local volatility model with a monotone volatility function, then the corresponding implied volatility is also monotone as a function of the strike price.

We show that stationary time series can be uniformly approximated over all finite time intervals by mixing, non-ergodic, non-mean-ergodic, and periodic processes, and by codings of aperiodic processes. A corollary is that the ergodic hypothesis—that time averages will converge to their statistical counterparts—and several adjacent hypotheses are not testable in the non-parametric case. Further Baire category implications are also explored.

We consider a Markov control model with Borel state space, metric compact action space, and transitions assumed to have a density function with respect to some probability measure satisfying some continuity conditions. We study the optimization problem of maximizing the probability of visiting some subset of the state space infinitely often, and we show that there exists an optimal stationary Markov policy for this problem. We endow the set of stationary Markov policies and the family of strategic probability measures with adequate topologies (namely, the narrow topology for Young measures and the $ws^\infty$-topology, respectively) to obtain compactness and continuity properties, which allow us to obtain our main results.

We prove that the local time of random walks conditioned to stay positive converges to the corresponding local time of three-dimensional Bessel processes by proper scaling. Our proof is based on Tanaka’s pathwise construction for conditioned random walks and the derivation of asymptotics for mixed moments of the local time.

Processes of random tessellations of the Euclidean space $\mathbb{R}^d$, $d\geq 1$, are considered that are generated by subsequent division of their cells. Such processes are characterized by the laws of the life times of the cells until their division and by the laws for the random hyperplanes that divide the cells at the end of their life times. The STIT (STable with respect to ITerations) tessellation processes are a reference model. In the present paper a generalization concerning the life time distributions is introduced, a sufficient condition for the existence of such cell division tessellation processes is provided, and a construction is described. In particular, for the case that the random dividing hyperplanes have a Mondrian distribution—which means that all cells of the tessellations are cuboids—it is shown that the intrinsic volumes, except the Euler characteristic, can be used as the parameter for the exponential life time distribution of the cells.

We feature results on global survival and extinction of an infection in a multi-layer network of mobile agents. Expanding on a model first presented in Cali et al. (2022), we consider an urban environment, represented by line segments in the plane, in which agents move according to a random waypoint model based on a Poisson point process. Whenever two agents are at sufficiently close proximity for a sufficiently long time the infection can be transmitted and then propagates into the system according to the same rule starting from a typical device. Inspired by wireless network architectures, the network is additionally equipped with a second class of agents able to transmit a patch to neighboring infected agents that in turn can further distribute the patch, leading to chase–escape dynamics. We give conditions for parameter configurations that guarantee existence and absence of global survival as well as an in-and-out of the survival regime, depending on the speed of the devices. We also provide complementary results for the setting in which the chase–escape dynamics is defined as an independent process on the connectivity graph. The proofs mainly rest on percolation arguments via discretization and multiscale analysis.

As a generalization of random recursive trees and preferential attachment trees, we consider random recursive metric spaces. These spaces are constructed from random blocks, each a metric space equipped with a probability measure, containing a labelled point called a hook, and assigned a weight. Random recursive metric spaces are equipped with a probability measure made up of a weighted sum of the probability measures assigned to its constituent blocks. At each step in the growth of a random recursive metric space, a point called a latch is chosen at random according to the equipped probability measure, and a new block is chosen at random and attached to the space by joining together the latch and the hook of the block. We use martingale theory to prove a law of large numbers and a central limit theorem for the insertion depth, the distance from the master hook to the latch chosen. We also apply our results to further generalizations of random trees, hooking networks, and continuous spaces constructed from line segments.

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.

We consider a Poisson autoregressive process whose parameters depend on the past of the trajectory. We allow these parameters to take negative values, modelling inhibition. More precisely, the model is the stochastic process $(X_n)_{n\ge0}$ with parameters $a_1,\ldots,a_p \in \mathbb{R}$, $p\in\mathbb{N}$, and $\lambda \ge 0$, such that, for all $n\ge p$, conditioned on $X_0,\ldots,X_{n-1}$, $X_n$ is Poisson distributed with parameter $(a_1 X_{n-1} + \cdots + a_p X_{n-p} + \lambda)_+$. This process can be regarded as a discrete-time Hawkes process with inhibition and a memory of length p. In this paper we initiate the study of necessary and sufficient conditions of stability for these processes, which seems to be a hard problem in general. We consider specifically the case $p = 2$, for which we are able to classify the asymptotic behavior of the process for the whole range of parameters, except for boundary cases. In particular, we show that the process remains stochastically bounded whenever the solution to the linear recurrence equation $x_n = a_1x_{n-1} + a_2x_{n-2} + \lambda$ remains bounded, but the converse is not true. Furthermore, the criterion for stochastic boundedness is not symmetric in $a_1$ and $a_2$, in contrast to the case of non-negative parameters, illustrating the complex effects of inhibition.

This work concerns Markov decision chains on a denumerable state space endowed with a bounded cost function. The performance of a control policy is assessed by a long-run average criterion as measured by a risk-seeking decision maker with constant risk-sensitivity. Besides standard continuity–compactness conditions, the framework of the paper is determined by the following conditions: (i) the state process is communicating under each stationary policy, and (ii) the simultaneous Doeblin condition holds. Within this framework it is shown that (i) the optimal superior and inferior limit average value functions coincide and are constant, and (ii) the optimal average cost is characterized via an extended version of the Collatz–Wielandt formula in the theory of positive matrices.

In this paper, we time-change the generalized counting process (GCP) by an independent inverse mixed stable subordinator to obtain a fractional version of the GCP. We call it the mixed fractional counting process (MFCP). The system of fractional differential equations that governs its state probabilities is obtained using the Z transform method. Its one-dimensional distribution, mean, variance, covariance, probability generating function, and factorial moments are obtained. It is shown that the MFCP exhibits the long-range dependence property whereas its increment process has the short-range dependence property. As an application we consider a risk process in which the claims are modelled using the MFCP. For this risk process, we obtain an asymptotic behaviour of its finite-time ruin probability when the claim sizes are subexponentially distributed and the initial capital is arbitrarily large. Later, we discuss some distributional properties of a compound version of the GCP.