We consider a branching random walk on a d-ary tree of height n (), in the presence of a hard wall which restricts each value to be positive, where d is a natural number satisfying . We consider the behaviour of Gaussian processes with long-range interactions, for example the discrete Gaussian free field, under the condition that it is positive on a large subset of vertices. We observe a relation with the expected maximum of the processes. We find the probability of the event that the branching random walk is positive at every vertex in the nth generation, and show that the conditional expectation of the Gaussian variable at a typical vertex, under positivity, is less than the expected maximum by order of .
]]>Consider a Brownian motion on the circumference of the unit circle, which jumps to the opposite point of the circumference at incident times of an independent Poisson process of rate . We examine the problem of coupling two copies of this ‘jumpy Brownian motion’ started from different locations, so as to optimise certain functions of the coupling time. We describe two intuitive co-adapted couplings (‘Mirror’ and ‘Synchronous’) which differ only when the two processes are directly opposite one another, and show that the question of which strategy is best depends upon the jump rate in a non-trivial way. We also provide an explicit description of a (non-co-adapted) maximal coupling for any jump rate in the case that the two jumpy Brownian motions begin at antipodal points of the circle.
]]>Under mild assumptions, we show that the exact convergence rate in total variation is also exact in weaker Wasserstein distances for the Metropolis–Hastings independence sampler. We develop a new upper and lower bound on the worst-case Wasserstein distance when initialized from points. For an arbitrary point initialization, we show that the convergence rate is the same and matches the convergence rate in total variation. We derive exact convergence expressions for more general Wasserstein distances when initialization is at a specific point. Using optimization, we construct a novel centered independent proposal to develop exact convergence rates in Bayesian quantile regression and many generalized linear model settings. We show that the exact convergence rate can be upper bounded in Bayesian binary response regression (e.g. logistic and probit) when the sample size and dimension grow together.
]]>Let , where Y(t) is a one-dimensional diffusion process, and let be the first time the process (X(t), Y(t)), starting from (x, y), leaves a subset of the first quadrant. The problem of computing the probability is considered. The Laplace transform of the function p(x, y) is obtained in important particular cases, and it is shown that the transform can at least be inverted numerically. Explicit expressions for the Laplace transform of and of the moment-generating function of can also be derived.
]]>We find sufficient conditions on explosion/non-explosion for continuous-state branching processes with competition in a Lévy random environment. In particular, we identify the necessary and sufficient conditions on explosion/non-explosion when the competition function is a power function and the Lévy measure of the associated branching mechanism is stable.
]]>We consider the simple random walk on the d-dimensional lattice (), traveling in potentials which are Bernoulli-distributed. The so-called Lyapunov exponent describes the cost of traveling for the simple random walk in the potential, and it is known that the Lyapunov exponent is strictly monotone in the parameter of the Bernoulli distribution. Hence the aim of this paper is to investigate the effect of the potential on the Lyapunov exponent more precisely, and we derive some Lipschitz-type estimates for the difference between the Lyapunov exponents.
]]>Recently, the relevation transformation has received further attention from researchers, and some interesting results have been developed. It is well known that the active redundancy at component level results in a more reliable coherent system than that at system level. However, the lack of study of this problem with relevation redundancy prevents us from fully understanding such a generalization of the active redundancy. In this note we deal with relevation redundancy to coherent systems of homogeneous components. Typically, for a series system of independent components, we have proved that the lifetime of a system with relevation redundancy at component level is larger than that with relevation redundancy at system level in the sense of the usual stochastic order and the likelihood ratio order, respectively. For a coherent system with dependent components, we have developed a sufficient condition in terms of the domination function to the usual stochastic order between the system lifetime with redundancy at component level and that at system level.
]]>The myopic strategy is one of the most important strategies when studying bandit problems. In 2018, Nouiehed and Ross put forward a conjecture about Feldman’s bandit problem (J. Appl. Prob. (2018) 55, 318–324). They proposed that for Bernoulli two-armed bandit problems, the myopic strategy stochastically maximizes the number of wins. In this paper we consider the two-armed bandit problem with more general distributions and utility functions. We confirm this conjecture by proving a stronger result: if the agent playing the bandit has a general utility function, the myopic strategy is still optimal if and only if this utility function satisfies reasonable conditions.
]]>We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with a type 1 and type 2 infection, respectively, and the infection then spreads via nearest neighbors in the graph. The time it takes for the type 1 (resp. 2) infection to traverse an edge e is given by a random variable (resp. ) and, if the vertex at the other end of the edge is still uninfected, it then becomes type 1 (resp. 2) infected and immune to the other type. Assuming that the degrees follow a power-law distribution with exponent , we show that with high probability as the number of vertices tends to infinity, one of the infection types occupies all vertices except for the starting point of the other type. Moreover, both infections have a positive probability of winning regardless of the passage-time distribution. The result is also shown to hold for the erased configuration model, where self-loops are erased and multiple edges are merged, and when the degrees are conditioned to be smaller than for some .
]]>With a focus on the risk contribution in a portofolio of dependent risks, Colini-Baldeschi et al. (2018) introduced Shapley values for variance and standard deviation games. In this note we extend their results, introducing tail variance as well as tail standard deviation games. We derive closed-form expressions for the Shapley values for the tail variance game and we analyze the vector majorization problem for the two games. In particular, we construct two examples showing that the risk contribution rankings for the two games may be inverted depending on the conditioning threshold and the tail fatness. Motivated by these examples, we formulate a conjecture for general portfolios. Lastly, we discuss risk management implications, including the characterization of tail covariance premiums and reinsurance pricing for peer-to-peer insurance policies.
]]>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 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.
]]>Stationary Poisson processes of lines in the plane are studied, whose directional distributions are concentrated on 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.
]]>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 , 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 . In this paper we study subsets that are vector subspaces with the cycle space as the main example. We propose a novel prior on 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.
]]>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 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.
]]>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.
]]>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 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.
]]>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.
]]>