Random function tracer Patent

Design and development of random function tracer for obtaining coordinates of points on contour map

Sieving random iterative function systems

It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space components, it is possible to construct a scale invariant stochastic process. We study its distribution and paths properties. In particular, we show that it is c\`adl\`ag and has finite total variation. We also provide examples and analyse various properties of particular sieved iterative function systems including perpetuities and infinite Bernoulli convolutions, iterations of maximum, and random continued fractions.Comment: 36 pages, 2 figures; accepted for publication in Bernoull

New Results On the Sum of Two Generalized Gaussian Random Variables

We propose in this paper a new method to compute the characteristic function (CF) of generalized Gaussian (GG) random variable in terms of the Fox H function. The CF of the sum of two independent GG random variables is then deduced. Based on this results, the probability density function (PDF) and the cumulative distribution function (CDF) of the sum distribution are obtained. These functions are expressed in terms of the bivariate Fox H function. Next, the statistics of the distribution of the sum, such as the moments, the cumulant, and the kurtosis, are analyzed and computed. Due to the complexity of bivariate Fox H function, a solution to reduce such complexity is to approximate the sum of two independent GG random variables by one GG random variable with suitable shape factor. The approximation method depends on the utility of the system so three methods of estimate the shape factor are studied and presented

The recurrence function of a random Sturmian word

This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian word. This parameter is central to combinatorics of words. Having fixed a possible length $n$ for the factors, we let $\alpha$ to be drawn uniformly from the unit interval $[0,1]$, thus defining a random Sturmian word of slope $\alpha$. Thus the waiting time for these factors becomes a random variable, for which we study the limit distribution and the limit density.Comment: Submitted to ANALCO 201

Pseudocontinuation and cyclicity for random power series

We prove that a random function in the Hardy space $H^2$ is a non-cyclic vector for the backward shift operator almost surely. The question of existence of a local pseudocontinuation for a random analytic function is also studied