Couplings for determinantal point processes and their reduced Palm distributions with a view to quantifying repulsiveness

Journal of Applied Probability

Published On 2021/6

For a determinantal point process (DPP) X with a kernel K whose spectrum is strictly less than one, André Goldman has established a coupling to its reduced Palm process , including Ginibre point processes and other specific parametric models for DPPs.

Journal

Journal of Applied Probability

Published On

2021/6

Volume

58

Issue

2

Page

469-483

Authors

Jesper Møller

Jesper Møller

Aalborg Universitet

Position

Professor in Statistics

H-Index(all)

46

H-Index(since 2020)

23

I-10 Index(all)

0

I-10 Index(since 2020)

0

Citation(all)

0

Citation(since 2020)

0

Cited By

0

Research Interests

Mathematical Statistics

Probability Theory

University Profile Page

Other Articles from authors

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2404.09525

Coupling results and Markovian structures for number representations of continuous random variables

A general setting for nested subdivisions of a bounded real set into intervals defining the digits of a random variable with a probability density function is considered. Under the weak condition that is almost everywhere lower semi-continuous, a coupling between and a non-negative integer-valued random variable is established so that have an interpretation as the ``sufficient digits'', since the distribution of conditioned on does not depend on . Adding a condition about a Markovian structure of the lengths of the intervals in the nested subdivisions, becomes a Markov chain of a certain order . If then are IID with a known distribution. When and the Markov chain is uniformly geometric ergodic, a coupling is established between and a random time so that the chain after time is stationary and follows a simple known distribution. The results are related to several examples of number representations generated by a dynamical system, including base- expansions, generalized L\"uroth series, -expansions, and continued fraction representations. The importance of the results and some suggestions and open problems for future research are discussed.

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2404.08387

The asymptotic distribution of the scaled remainder for pseudo golden ratio expansions of a continuous random variable

Let be the base- expansion of a continuous random variable on the unit interval where is the positive solution to for an integer (i.e., is a generalization of the golden mean for which ). We study the asymptotic distribution and convergence rate of the scaled remainder when tends to infinity.

Jesper Møller

Jesper Møller

Aalborg Universitet

Methodology and Computing in Applied Probability

How many digits are needed?

Let be the digits in the base-q expansion of a random variable X defined on [0, 1) where is an integer. For , we study the probability distribution of the (scaled) remainder : If X has an absolutely continuous CDF then converges in the total variation metric to the Lebesgue measure on the unit interval. Under weak smoothness conditions we establish first a coupling between X and a non-negative integer valued random variable N so that follows and is independent of , and second exponentially fast convergence of and its PDF . We discuss how many digits are needed and show examples of our results.

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2312.09652

The asymptotic distribution of the remainder in a certain base- expansion

Let be the base- expansion of a continuous random variable on the unit interval where is the golden ratio. We study the asymptotic distribution and convergence rate of the scaled remainder when tends to infinity.

2023/12/15

Article Details
Jesper Møller

Jesper Møller

Aalborg Universitet

Proceedings of the London Mathematical Society

Realizability and tameness of fusion systems

A saturated fusion system over a finite p$p$‐group S$S$ is a category whose objects are the subgroups of S$S$ and whose morphisms are injective homomorphisms between the subgroups satisfying certain axioms. A fusion system over S$S$ is realized by a finite group G$G$ if S$S$ is a Sylow p$p$‐subgroup of G$G$ and morphisms in the category are those induced by conjugation in G$G$. One recurrent question in this subject is to find criteria as to whether a given saturated fusion system is realizable or not. One main result in this paper is that a saturated fusion system is realizable if all of its components (in the sense of Aschbacher) are realizable. Another result is that all realizable fusion systems are tame: a finer condition on realizable fusion systems that involves describing automorphisms of a fusion system in terms of those of some group that realizes it. Stated in this way, these results depend on the …

Jesper Møller

Jesper Møller

Aalborg Universitet

ACM Transactions on Spatial Algorithms and Systems

Stochastic Routing with Arrival Windows

Arriving at a destination within a specific time window is important in many transportation settings. For example, trucks may be penalized for early or late arrivals at compact terminals, and early and late arrivals at general practitioners, dentists, and so on, are also discouraged, in part due to COVID. We propose foundations for routing with arrival-window constraints. In a setting where the travel time of a road segment is modeled by a probability distribution, we define two problems where the aim is to find a route from a source to a destination that optimizes or yields a high probability of arriving within a time window while departing as late as possible. In this setting, a core challenge is to enable comparison between paths that may potentially be part of a result path with the goal of determining whether a path is uninteresting and can be disregarded given the existence of another path. We show that existing solutions …

2023/11/21

Article Details
Jesper Møller

Jesper Møller

Aalborg Universitet

Spatial Statistics

Fitting the grain orientation distribution of a polycrystalline material conditioned on a Laguerre tessellation

The description of distributions related to grain microstructure helps physicists to understand the processes in materials and their properties. This paper presents a general statistical methodology for the analysis of crystallographic orientations of grains in a 3D Laguerre tessellation dataset which represents the microstructure of a polycrystalline material. We introduce complex stochastic models which may substitute expensive laboratory experiments: conditional on the Laguerre tessellation, we suggest interaction models for the distribution of cubic crystal lattice orientations, where the interaction is between pairs of orientations for neighbouring grains in the tessellation. We discuss parameter estimation and model comparison methods based on maximum pseudolikelihood as well as graphical procedures for model checking using simulations. Our methodology is applied for analysing a dataset representing a nickel …

Jesper Møller

Jesper Møller

Aalborg Universitet

Methodology and Computing in Applied Probability

Singular distribution functions for random variables with stationary digits

Let F be the cumulative distribution function (CDF) of the base-q expansion , where is an integer and is a stationary stochastic process with state space . In a previous paper we characterized the absolutely continuous and the discrete components of F. In this paper we study special cases of models, including stationary Markov chains of any order and stationary renewal point processes, where we establish a law of pure types: F is then either a uniform or a singular CDF on [0, 1]. Moreover, we study mixtures of such models. In most cases expressions and plots of F are given.

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2212.08402

Cox processes driven by transformed Gaussian processes on linear networks

There is a lack of point process models on linear networks. For an arbitrary linear network, we use isotropic covariance functions with respect to the geodesic metric or the resistance metric to construct new models for isotropic Gaussian processes and hence new models for various Cox processes with isotropic pair correlation functions. In particular we introduce three model classes given by log Gaussian, interrupted, and permanental Cox processes on linear networks, and consider for the first time statistical procedures and applications for parametric families of such models. Moreover, we construct new simulation algorithms for Gaussian processes on linear networks and discuss whether the geodesic metric or the resistance metric should be used for the kind of Cox processes studied in this paper.

2022/12/16

Article Details
Jesper Møller

Jesper Møller

Aalborg Universitet

Stat

Determinantal shot noise Cox processes

We present a new class of cluster point process models, which we call determinantal shot noise Cox processes (DSNCP), with repulsion between cluster centres. They are the special case of generalized shot noise Cox processes where the cluster centres are determinantal point processes. We establish various moment results and describe how these can be used to easily estimate unknown parameters in two particularly tractable cases, namely, when the offspring density is isotropic Gaussian and the kernel of the determinantal point process of cluster centres is Gaussian or like in a scaled Ginibre point process. Through a simulation study and the analysis of a real point pattern data set, we see that when modelling clustered point patterns, a much lower intensity of cluster centres may be needed in DSNCP models as compared to shot noise Cox processes.

Jesper Møller

Jesper Møller

Aalborg Universitet

International Statistical Review

Should we condition on the number of points when modelling spatial point patterns?

We discuss the practice of directly or indirectly assuming a model for the number of points when modelling spatial point patterns even though it is rarely possible to validate such a model in practice because most point pattern data consist of only one pattern. We therefore explore the possibility to condition on the number of points instead when fitting and validating spatial point process models. In a simulation study with different popular spatial point process models, we consider model validation using global envelope tests based on functional summary statistics. We find that conditioning on the number of points will for some functional summary statistics lead to more narrow envelopes and thus stronger tests and that it can also be useful for correcting for some conservativeness in the tests when testing composite hypothesis. However, for other functional summary statistics, it makes little or no difference to condition …

Jesper Møller

Jesper Møller

Aalborg Universitet

Journal of Applied Probability

Characterization of random variables with stationary digits

Let be an integer, a stochastic process with state space , and F the cumulative distribution function (CDF) of . We show that stationarity of is equivalent to a functional equation obeyed by F, and use this to characterize the characteristic function of X and the structure of F in terms of its Lebesgue decomposition. More precisely, while the absolutely continuous component of F can only be the uniform distribution on the unit interval, its discrete component can only be a countable convex combination of certain explicitly computable CDFs for probability distributions with finite support. We also show that is a Rajchman measure if and only if F is the uniform CDF on [0, 1].

Jesper Møller

Jesper Møller

Aalborg Universitet

Spatial Statistics

Fitting three-dimensional Laguerre tessellations by hierarchical marked point process models

We present a general statistical methodology for analysing a Laguerre tessellation data set viewed as a realization of a marked point process model. In the first step, for the points, we use a nested sequence of multiscale processes which constitute a flexible parametric class of pairwise interaction point process models. In the second step, for the marks/radii conditioned on the points, we consider various exponential family models where the canonical sufficient statistic is based on tessellation characteristics. For each step, parameter estimation based on maximum pseudolikelihood methods is tractable. For model selection, we consider maximized log pseudolikelihood functions for models of the radii conditioned on the points. Model checking is performed using global envelopes and corresponding tests in both steps and moreover by comparing observed and simulated tessellation characteristics in the second step …

Jesper Møller

Jesper Møller

Aalborg Universitet

Translational psychiatry

Layer III pyramidal cells in the prefrontal cortex reveal morphological changes in subjects with depression, schizophrenia, and suicide

Brodmann Area 46 (BA46) has long been regarded as a hotspot of disease pathology in individuals with schizophrenia (SCH) and major depressive disorder (MDD). Pyramidal neurons in layer III of the Brodmann Area 46 (BA46) project to other cortical regions and play a fundamental role in corticocortical and thalamocortical circuits. The AutoCUTS-LM pipeline was used to study the 3-dimensional structural morphology and spatial organization of pyramidal cells. Using quantitative light microscopy, we used stereology to calculate the entire volume of layer III in BA46 and the total number and density of pyramidal cells. Volume tensors estimated by the planar rotator quantified the volume, shape, and nucleus displacement of pyramidal cells. All of these assessments were carried out in four groups of subjects: controls (C, n = 10), SCH (n = 10), MDD (n = 8), and suicide subjects with a history of depression (SU …

Jesper Møller

Jesper Møller

Aalborg Universitet

Graphs and Combinatorics

Equivariant Euler characteristics of symplectic buildings

We compute the equivariant Euler characteristics of the buildings for the symplectic groups over finite fields.

Jesper Møller

Jesper Møller

Aalborg Universitet

Journal of Computational and Graphical Statistics

MCMC computations for Bayesian mixture models using repulsive point processes

Repulsive mixture models have recently gained popularity for Bayesian cluster detection. Compared to more traditional mixture models, repulsive mixture models produce a smaller number of well-separated clusters. The most commonly used methods for posterior inference either require to fix a priori the number of components or are based on reversible jump MCMC computation. We present a general framework for mixture models, when the prior of the “cluster centers” is a finite repulsive point process depending on a hyperparameter, specified by a density which may depend on an intractable normalizing constant. By investigating the posterior characterization of this class of mixture models, we derive a MCMC algorithm which avoids the well-known difficulties associated to reversible jump MCMC computation. In particular, we use an ancillary variable method, which eliminates the problem of having intractable …

Jesper Møller

Jesper Møller

Aalborg Universitet

Scandinavian Journal of Statistics

Approximate Bayesian inference for a spatial point process model exhibiting regularity and random aggregation

In this article, we propose a doubly stochastic spatial point process model with both aggregation and repulsion. This model combines the ideas behind Strauss processes and log Gaussian Cox processes. The likelihood for this model is not expressible in closed form but it is easy to simulate realizations under the model. We therefore explain how to use approximate Bayesian computation (ABC) to carry out statistical inference for this model. We suggest a method for model validation based on posterior predictions and global envelopes. We illustrate the ABC procedure and model validation approach using both simulated point patterns and a real data example.

Jesper Møller

Jesper Møller

Aalborg Universitet

Journal of Algebraic Combinatorics

Equivariant Euler characteristics of unitary buildings

The (p-primary) equivariant Euler characteristics of the buildings for the general unitary groups over finite fields are determined.

Jesper Møller

Jesper Møller

Aalborg Universitet

Communications Biology

Cellular 3D-reconstruction and analysis in the human cerebral cortex using automatic serial sections

Techniques involving three-dimensional (3D) tissue structure reconstruction and analysis provide a better understanding of changes in molecules and function. We have developed AutoCUTS-LM, an automated system that allows the latest advances in 3D tissue reconstruction and cellular analysis developments using light microscopy on various tissues, including archived tissue. The workflow in this paper involved advanced tissue sampling methods of the human cerebral cortex, an automated serial section collection system, digital tissue library, cell detection using convolution neural network, 3D cell reconstruction, and advanced analysis. Our results demonstrated the detailed structure of pyramidal cells (number, volume, diameter, sphericity and orientation) and their 3D spatial organization are arranged in a columnar structure. The pipeline of these combined techniques provides a detailed analysis of tissues …

Jesper Møller

Jesper Møller

Aalborg Universitet

AMERICAN MATHEMATICAL SOCIETY

THE NUMBER OF p-ELEMENTS IN FINITE GROUPS OF LIE TYPE OF CHARACTERISTIC p

The combinatorics of the poset of p-radical p-subgroups of a finite group is used to count the number of p-elements.

Other articles from Journal of Applied Probability journal

Balázs Ráth

Balázs Ráth

Budapesti Muszaki és Gazdaságtudományi Egyetem

JOURNAL OF APPLIED PROBABILITY

Color-avoiding percolation in edge-colored Erdős–Rényi graphs

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.

Hugo Cruz-Suárez

Hugo Cruz-Suárez

Benemerita Universidad Autonoma de Puebla

Journal of Applied Probability

Characterization of the optimal average cost in Markov decision chains driven by a risk-seeking controller

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.

Oliver Johnson

Oliver Johnson

University of Bristol

Journal of Applied Probability

Information-theoretic convergence of extreme values to the Gumbel distribution

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.

Jiang Hu

Jiang Hu

Northeast Normal University

Journal of Applied Probability

The limiting spectral distribution of large random permutation matrices

We explore the limiting spectral distribution of large-dimensional random permutation matrices, assuming the underlying population distribution possesses a general dependence structure. Let .

Remco van der Hofstad

Remco van der Hofstad

Technische Universiteit Eindhoven

Journal of Applied Probability

Connectivity of random graphs after centrality-based vertex removal

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.

Du Nguyen Huu

Du Nguyen Huu

Vietnam National University, Hanoi

Journal of Applied Probability

Continuous dependence of stationary distributions on parameters for stochastic predator–prey models

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.

Gilles Mordant

Gilles Mordant

Université Catholique de Louvain

Journal of Applied Probability

Extrema of a multinomial assignment process

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.

Ilya O. Ryzhov

Ilya O. Ryzhov

University of Maryland

Journal of Applied Probability

Moderate deviations inequalities for Gaussian process regression

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.

Gianmarco Bet

Gianmarco Bet

Università degli Studi di Firenze

Journal of Applied Probability

Weakly interacting oscillators on dense random 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 …

Remco van der Hofstad

Remco van der Hofstad

Technische Universiteit Eindhoven

Journal of Applied Probability

The winner takes it all but one

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 .

Markus Bibinger

Markus Bibinger

Julius-Maximilians-Universität Würzburg

Journal of Applied Probability

Inference on the intraday spot volatility from high-frequency order prices with irregular microstructure noise

We consider estimation of the spot volatility in a stochastic boundary model with one-sided microstructure noise for high-frequency limit order prices. Based on discrete, noisy observations of an Itô semimartingale with jumps and general stochastic volatility, we present a simple and explicit estimator using local order statistics. We establish consistency and stable central limit theorems as asymptotic properties. The asymptotic analysis builds upon an expansion of tail probabilities for the order statistics based on a generalized arcsine law. In order to use the involved distribution of local order statistics for a bias correction, an efficient numerical algorithm is developed. We demonstrate the finite-sample performance of the estimation in a Monte Carlo simulation.

Jean-Francois Renaud

Jean-Francois Renaud

Université du Québec à Montréal

Journal of Applied Probability

De Finetti’s control problem with a concave bound on the control rate

We consider De Finetti’s control problem for absolutely continuous strategies with control rates bounded by a concave function and prove that a generalized mean-reverting strategy is optimal in a Brownian model. In order to solve this problem, we need to deal with a nonlinear Ornstein–Uhlenbeck process. Despite the level of generality of the bound imposed on the rate, an explicit expression for the value function is obtained up to the evaluation of two functions. This optimal control problem has, as special cases, those solved in Jeanblanc-Picqué and Shiryaev (1995) and Renaud and Simard (2021) when the control rate is bounded by a constant and a linear function, respectively.

Roland Molontay

Roland Molontay

Budapesti Muszaki és Gazdaságtudományi Egyetem

Journal of Applied Probability

Color-avoiding percolation and branching processes

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 …

Nikolaos Fountoulakis

Nikolaos Fountoulakis

University of Birmingham

Journal of Applied Probability

Bootstrap percolation in inhomogeneous random graphs

Bootstrap percolation in inhomogeneous random graphs — University of Birmingham Skip to main navigation Skip to search Skip to main content University of Birmingham Home University of Birmingham Logo Help & FAQ Home Research output Profiles Research units Projects Activities Datasets Equipment Prizes Press/Media Search by expertise, name or affiliation Bootstrap percolation in inhomogeneous random graphs Nikolaos Fountoulakis, Hamed Amini * , Konstantinos Panagiotou * Corresponding author for this work Mathematics Research output: Contribution to journal › Article › peer-review Overview Projects (1) Original language English Journal Journal of Applied Probability Publication status Published - 4 Mar 2023 Keywords bootstrap percolation inhomogeneous random graphs Chung-Lu model Projects 1 Finished Inhomogeneity and generalised bootstrap percolation in stochastic networks …

Shaochen Wang

Shaochen Wang

Wuhan University

Journal of Applied Probability

An exponential nonuniform Berry–Esseen bound of the maximum likelihood estimator in a Jacobi process

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.

Erik Ekström

Erik Ekström

Uppsala Universitet

Journal of Applied Probability

Monotonicity of implied volatility for perpetual put options

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.

YOU BENG KOH

YOU BENG KOH

Universiti Malaya

Journal of Applied Probability

Super-replication of life-contingent options under the Black–Scholes framework

We consider the super-replication problem for a class of exotic options known as life-contingent options within the framework of the Black–Scholes market model. The option is allowed to be exercised if the death of the option holder occurs before the expiry date, otherwise there is a compensation payoff at the expiry date. We show that there exists a minimal super-replication portfolio and determine the associated initial investment. We then give a characterisation of when replication of the option is possible. Finally, we give an example of an explicit super-replicating hedge for a simple life-contingent option.

Xiaohu Li

Xiaohu Li

Stevens Institute of Technology

Journal of Applied Probability

On relevation redundancy to coherent systems at component and system levels

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 …

Balázs Ráth

Balázs Ráth

Budapesti Muszaki és Gazdaságtudományi Egyetem

Journal of Applied Probability

Color-avoiding percolation and branching processes

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 …

Konstantinos Panagiotou

Konstantinos Panagiotou

Ludwig-Maximilians-Universität München

Journal of Applied Probability

Bootstrap percolation in inhomogeneous random graphs

Bootstrap percolation in inhomogeneous random graphs — University of Birmingham Skip to main navigation Skip to search Skip to main content University of Birmingham Home University of Birmingham Logo Help & FAQ Home Research output Profiles Research units Projects Activities Datasets Equipment Prizes Press/Media Search by expertise, name or affiliation Bootstrap percolation in inhomogeneous random graphs Nikolaos Fountoulakis, Hamed Amini * , Konstantinos Panagiotou * Corresponding author for this work Mathematics Research output: Contribution to journal › Article › peer-review Overview Projects (1) Original language English Journal Journal of Applied Probability Publication status Published - 4 Mar 2023 Keywords bootstrap percolation inhomogeneous random graphs Chung-Lu model Projects 1 Finished Inhomogeneity and generalised bootstrap percolation in stochastic networks …