SearcharxivSearch

arXiv subjects

Takis Konstantopoulos

Publications and source records attributed to Takis Konstantopoulos.

At least 19 recordsLinked to original sources

Short-Rate Derivatives in a Higher-for-Longer Environment

We introduce a class of short-rate models that exhibit a ``higher for longer'' phenomenon. Specifically, the short-rate is modeled as a general time-homogeneous one-factor Markov diffusion on a finite interval. The lower endpoint is assumed to be regular, exit or natural according to boundary classification while the upper endpoint is assumed to be regular with absorbing behavior. In this setting, we give an explicit expression for price of a zero-coupon bond (as well as more general interest rate derivatives) in terms of the transition density of the short-rate under a new probability measure, and the solution of a non-linear ordinary differential equation (ODE). We then narrow our focus to a class of models for which the transition density and ODE can be solved explicitly. For models within this class, we provide conditions under which the lower endpoint is regular, exit and natural. Finally, we study two specific models -- one in which the lower endpoint is exit and another in which the lower endpoint is natural. In these two models, we give an explicit solution of transition density of the short-rate as a (generalized) eigenfunction expansion. We provide plots of the transition density, (generalized) eigenfunctions, bond prices and the associated yield curve.

q-fin.MF

A combinatorial approach to phase transitions in random graph isomorphism problems

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters we show a sharp asymptotic phase transition as the graph sizes tend to infinity. This extends known results for the case of uniform Erd\H{o}s-R\'enyi random graphs. Our approach is primarily combinatorial, naturally leading to several related problems for further exploration.

math.CO

Last passage percolation and limit theorems in Barak-Erd\H{o}s directed random graphs and related models

We consider directed random graphs, the prototype of which being the Barak-Erd\H{o}s graph $\vec G(\mathbb Z, p)$, and study the way that long (or heavy, if weights are present) paths grow. This is done by relating the graphs to certain particle systems that we call Infinite Bin Models (IBM). A number of limit theorems are shown. The goal of this paper is to present results along with techniques that have been used in this area. In the case of $\vec G(\mathbb Z, p)$ the last passage percolation constant $C(p)$ is studied in great detail. It is shown that $C(p)$ is analytic for $p>0$, has an interesting asymptotic expansion at $p=1$ and that $C(p)/p$ converges to $e$ like $1/(\log p)^2$ as $p \to 0$. The paper includes the study of IBMs as models on their own as well as their connections to stochastic models of branching processes in continuous or discrete time with selection. Several proofs herein are new or simplified versions of published ones. Regenerative techniques are used where possible, exhibiting random sets of vertices over which the graphs regenerate. When edges have random weights we show how the last passage percolation constants behave and when central limit theorems exist. When the underlying vertex set is partially ordered, new phenomena occur, e.g., there are relations with last passage Brownian percolation. We also look at weights that may possibly take negative values and study in detail some special cases that require combinatorial/graph theoretic techniques that exhibit some interesting non-differentiability properties of the last passage percolation constant. We also explain how to approach the problem of estimation of last passage percolation constants by means of perfect simulation.

math.PR

Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph

To each edge (i,j), i<j of the complete directed graph on the integers we assign unit weight with probability p or weight x with probability 1-p, independently from edge to edge, and give to each path weight equal to the sum of its edge weights. If W^x_{0,n} is the maximum weight of all paths from 0 to n then W^x_{0,n}/n \to C_p(x), as n\to\infty, almost surely, where C_p(x) is positive and deterministic. We study C_p(x) as a function of x, for fixed 0<p<1 and show that it is a strictly increasing convex function that is not differentiable if and only if x is a nonpositive rational or a positive integer except 1 or the reciprocal of it. We allow x to be any real number, even negative, or, possibly, -\infty. The case x=-\infty corresponds to the well-studied directed version of the Erd"os-R'enyi random graph (known as Barak-Erd"os graph) for which C_p(-\infty) = lim_{x\to -\infty} C_p(x) has been studied as a function of p in a number of papers.

math.PR

Age of information without service preemption

When designing a message transmission system, from the point of view of making sure that the information transmitted is as fresh as possible, two rules of thumb seem reasonable: use small buffers and adopt a last-in-first-out policy. In this paper, we measure freshness of information using the "age of information" performance measure. Considering it as a stochastic process operating in a stationary regime, we compute not just the first moment but the whole marginal distribution of the age of information (something important in applications) for two well-performing systems. In neither case do we allow for preemption of the message being processed because this may be difficult to implement in practice. We assume that the arrival process is Poisson and that the messages have independent sizes (service times) with common distribution. We use Palm and Markov-renewal theory to derive explicit results for Laplace transforms. In particular, this approach can be used to analyze more complex last-in-first-out systems with larger buffer sizes.

cs.PF

Age of information distribution under dynamic service preemption

Age of Information (AoI) has emerged as an important quality-of-service measure for applications that prioritize delivery of the freshest information, e.g., virtual or augmented reality over mobile devices and wireless sensor networks used in the control of cyber-physical systems. We derive the Laplace transform of the stationary AoI for the M/GI/1/2 system with a "dynamic" service preemption and pushout policy depending on the existing service time of the in-service message. Thus, our system generalizes both the static M/GI/1/2 queue-pushout system without service preemption and the M/GI/1/1 bufferless system with service preemption - two systems considered to provide very good AoI performance. Based on our analysis, for a service-time distribution that is a mixture of deterministic and exponential, we numerically show that the dynamic policy has lower mean AoI than that of these two static policies and also that of the well studied M/GI/1/1 blocking system.

cs.PF

Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation

Our object of study is the asymptotic growth of heaviest paths in a charged (weighted with signed weights) complete directed acyclic graph. Edge charges are i.i.d. random variables with common distribution $F$ supported on $[-\infty,1]$ with essential supremum equal to $1$ (a charge of $-\infty$ is understood as the absence of an edge). The asymptotic growth rate is a constant that we denote by $C(F)$. Even in the simplest case where $F=p\delta_1 + (1-p)\delta_{-\infty}$, corresponding to the longest path in the Barak-Erd\H{o}s random graph, there is no closed-form expression for this function, but good bounds do exist. In this paper we construct a Markovian particle system that we call "Max Growth System" (MGS), and show how it is related to the charged random graph. The MGS is a generalization of the Infinite Bin Model that has been the object of study of a number of papers. We then identify a random functional of the process that admits a stationary version and whose expectation equals the unknown constant $C(F)$. Furthermore, we construct an effective perfect simulation algorithm for this functional which produces samples from the random functional.

math.PR

Age of Information for Small Buffer Systems

Consider a message processing system whose objective is to produce the most current information as measured by the quantity known as "age of information". We have argued in previous papers that if we are allowed to design the message processing policy ad libitum, we should keep a small buffer and operate according to a LIFO policy. In this small note we provide an analysis for the AoI of the P_m system which uses a buffer of size m, a single server, operating without service preemption and in a LIFO manner for stored messages. Analytical expressions for the mean (or even distribution) of the AoI in steady-state are possible but with the aid computer algebra. We explain the the analysis for m=3.

cs.PF

Does the ratio of Laplace transforms of powers of a function identify the function?

We study the following question: if $f$ is a nonzero measurable function on $[0,\infty)$ and $m$ and $n$ distinct nonnegative integers, does the ratio $\widehat{f^n}/\widehat{f^m}$ of the Laplace transforms of the powers $f^n$ and $f^m$ of $f$ uniquely determine $f$? The answer is yes if one of $m, n$ is zero, by the inverse Laplace transform. Under some assumptions on the smoothness of $f$ we show that the answer in the general case is also affirmative. The question arose from a problem in economics, specifically in auction theory where $f$ is the cumulative distribution function of a certain random variable. This is also discussed in the paper.

math.PR

On a caching system with object sharing

We consider a content-caching system thatis shared by a number of proxies. The cache could belocated in an edge-cloud datacenter and the proxies couldeach serve a large population of mobile end-users. Eachproxy operates its own LRU-list of a certain capacity inthe shared cache. The length of objects simultaneouslyappearing in plural LRU-lists is equally divided amongthem,i.e., object sharing among the LRUs. We provide a "working-set" approximation for this system to quicklyestimate the cache-hit probabilities under such objectsharing, which can be used to facilitate admission control.Also, a way to reduce ripple evictions,i.e.,setrequestoverhead, is suggested. We give numerical results for ourMemCacheD with Object Sharing (MCD-OS) prototype.

cs.PF

The distribution of age-of-information performance measures for message processing systems

The idea behind the recently introduced "age of information" performance measure of a networked message processing system is that it indicates our knowledge regarding the "freshness" of the most recent piece of information that can be used as a criterion for real-time control. In this foundational paper, we examine two such measures, one that has been extensively studied in the recent literature and a new one that could be more relevant from the point of view of the processor. Considering these measures as stochastic processes in a stationary environment (defined by the arrival processes, message processing times and admission controls in bufferless systems), we characterize their distributions using the Palm inversion formula. Under renewal assumptions we derive explicit solutions for their Laplace transforms and show some interesting decomposition properties. Previous work has mostly focused on computation of expectations in very particular cases. We argue that using bufferless or very small buffer systems is best and support this by simulation. We also pose some open problems including assessment of enqueueing policies that may be better in cases where one wishes to minimize more general functionals of the age of information measures.

cs.PF

The log-Sobolev inequality for spin systems of higher order interactions

We study the infinite-dimensional log-Sobolev inequality for spin systems on $\mathbb{Z}^d$ with interactions of power higher than quadratic. We assume that the one site measure without a boundary $e^{-\phi(x)}dx/Z$ satisfies a log-Sobolev inequality and we determine conditions so that the infinite-dimensional Gibbs measure also satisfies the inequality. As a concrete application, we prove that a certain class of nontrivial Gibbs measures with non-quadratic interaction potentials on an infinite product of Heisenberg groups satisfy the log-Sobolev inequality.

math.PR

Relative Age of Information: Maintaining Freshness while Considering the Most Recently Generated Information

A queueing system handling a sequence of message arrivals is considered where each message obsoletes all previous messages. The objective is to assess the freshness of the latest message/information that has been successfully transmitted, i.e., "age of information" (AoI). We study a variation of traditional AoI, the "Relative AoI", here defined so as to account for the presence of newly arrived messages/information to the queue to be transmitted.

cs.PF

Limiting properties of random graph models with vertex and edge weights

This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on edges and vertices and assuming that weights on edges are signed. We aim at an exposition that summarizes, simplifies, and extends proof ideas. We also study sparse graph asymptotics, showing convergence of the weighted random graphs to a certain weighted graph that can be constructed in terms of Poisson processes. We are motivated by numerous applications, ranging from ecology to parallel computing model. It is the latter set of applications that necessitates the introduction of vertex weights. Finally, we discuss some open problems and research directions.

math.PR

Moving-target Defense against Botnet Reconnaissance and an Adversarial Coupon-Collection Model

We consider a cloud based multiserver system consisting of a set of replica application servers behind a set of proxy (indirection) servers which interact directly with clients over the Internet. We study a proactive moving-target defense to thwart a DDoS attacker's reconnaissance phase and consequently reduce the attack's impact. The defense is effectively a moving-target (motag) technique in which the proxies dynamically change. The system is evaluated using an AWS prototype of HTTP redirection and by numerical evaluations of an adversarial coupon-collector mathematical model, the latter allowing larger-scale extrapolations.

cs.CR

On the extendibility of finitely exchangeable probability measures

A length-$n$ random sequence $X_1,\ldots,X_n$ in a space $S$ is finitely exchangeable if its distribution is invariant under all $n!$ permutations of coordinates. Given $N > n$, we study the extendibility problem: when is it the case that there is a length-$N$ exchangeable random sequence $Y_1,\ldots, Y_N$ so that $(Y_1,\ldots,Y_n)$ has the same distribution as $(X_1,\ldots,X_n)$? In this paper, we give a necessary and sufficient condition so that, for given $n$ and $N$, the extendibility problem admits a solution. This is done by employing functional-analytic and measure-theoretic arguments that take into account the symmetry. We also address the problem of infinite extendibility. Our results are valid when $X_1$ has a regular distribution in a locally compact Hausdorff space $S$. We also revisit the problem of representation of the distribution of a finitely exchangeable sequence.

math.PR

Power law condition for stability of Poisson hail

We consider the Poisson hail model introduced by Baccelli and Foss. We give a power law condition for the tails (spatial and temporal) of the distribution of jobs to ensure stability as the rate parameter $λ$ tends to zero. We then show that in a weak sense it is optimal.

math.PR

On a representation theorem for finitely exchangeable random vectors

A random vector $X=(X_1,\ldots,X_n)$ with the $X_i$ taking values in an arbitrary measurable space $(S, \mathscr{S})$ is exchangeable if its law is the same as that of $(X_{σ(1)}, \ldots, X_{σ(n)})$ for any permutation $σ$. We give an alternative and shorter proof of the representation result (Jaynes \cite{Jay86} and Kerns and Székely \cite{KS06}) stating that the law of $X$ is a mixture of product probability measures with respect to a signed mixing measure. The result is "finitistic" in nature meaning that it is a matter of linear algebra for finite $S$. The passing from finite $S$ to an arbitrary one may pose some measure-theoretic difficulties which are avoided by our proof. The mixing signed measure is not unique (examples are given), but we pay more attention to the one constructed in the proof ("canonical mixing measure") by pointing out some of its characteristics. The mixing measure is, in general, defined on the space of probability measures on $S$, but for $S=\mathbb{R}$, one can choose a mixing measure on $\mathbb{R}^n$.

math.PR