English
Related papers

Related papers: Ulam's History-dependent Random Adding Process

200 papers

Let $X_1, X_2,\ldots$ be random elements of the Skorokhod space $D(\mathbb{R})$ and $\xi_1, \xi_2, \ldots$ positive random variables such that the pairs $(X_1,\xi_1), (X_2,\xi_2),\ldots$ are independent and identically distributed. The…

Probability · Mathematics 2015-09-25 Alexander Marynych

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

Probability · Mathematics 2009-12-11 A. D. Barbour , E. Kowalski , A. Nikeghbali

We consider the equation R(n)=Q(n)+M(n) R(n-1), with random non-i.i.d. coefficients (Q(n),M(n)), and show that the distribution tails of the stationary solution to this equation are regularly varying at infinity.

Probability · Mathematics 2010-06-15 A. P. Ghosh , D. Hay , V. Hirpara , R. Rastegar , A. Roitershtein , A. Schulteis , J. Suh

Let $X_1, X_2,\ldots, X_n$ be $n$ independent and identically distributed random variables, here $n \geq 2.$ Let $X_{(1)}, X_{(2)}, \ldots, X_{(n)}$ be the order statistics of $X_1, X_2,..., X_n.$ In this note we proved that: (I) If $X_1,…

Statistics Theory · Mathematics 2015-03-04 Robert W. Chen

We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has…

Probability · Mathematics 2021-07-06 Irene Crimaldi , Pierre-Yves Louis , Ida Germana Minelli

We obtain the asymptotic behaviour of the longest increasing/non-decreasing subsequences in a random uniform multiset permutation in which each element in {1,...,n} occurs k times, where k may depend on n. This generalizes the famous…

Combinatorics · Mathematics 2025-04-08 Lucas Gerin

Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…

Probability · Mathematics 2007-05-23 Alexander Gnedin

Our main goal is to study a class of processes whose increments are generated via a cellular automata rule. Given the increments of a simple biased random walk, a new sequence of (dependent) Bernoulli random variables is produced. It is…

Probability · Mathematics 2017-10-24 Andrea Collevecchio , Kais Hamza , Yunxuan Liu

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

Probability · Mathematics 2012-04-12 Olivier Raimond , Bruno Schapira

We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, $(X_i)_{i \in \mathbb{Z}}$ has a stationary coupling with an independent process on the positive…

Probability · Mathematics 2014-10-07 Neal Bushaw , Karen Gunderson , Steven Kalikow

We propose an approach to construct Bernoulli trials $\{X_i, i\ge 1\}$ combining dependence and independence periods, and call it Bernoulli sequence with random dependence (BSRD). The structure of dependence, on the past $S_i = X_1 + \ldots…

Probability · Mathematics 2018-06-12 Manuel González-Navarrete , Rodrigo Lambert

Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the…

Information Theory · Computer Science 2007-09-04 Andrea Montanari

In this paper, we consider a multi-drawing urn model with random addition. At each discrete time step, we draw a sample of m balls. According to the composition of the drawn colors, we return the balls together with a random number of balls…

Probability · Mathematics 2018-02-14 Rafik Aguech , Nabil Lasmar , Olfa Selmi

A family of self-similar and translation-invariant random sup-measures with long-range dependence are investigated. They are shown to arise as the limit of the empirical random sup-measure of a stationary heavy-tailed process, inspired by…

Probability · Mathematics 2018-10-11 Olivier Durieu , Yizao Wang

Let $X_1,~X_2,\cdots$ be a sequence of i.i.d random variables which are supposed to be observed in sequence. The $n$th value in the sequence is a $k-record~value$ if exactly $k$ of the first $n$ values (including $X_n$) are at least as…

Probability · Mathematics 2022-08-16 Anshui Li

Let $\{X_i\}$ be a sequence of independent identically distributed random variables with an intermediate regularly varying (IR) right tail $\bar{F}$. Let $(N, C_1, ..., C_N)$ be a nonnegative random vector independent of the $\{X_i\}$ with…

Probability · Mathematics 2012-04-18 Mariana Olvera-Cravioto

For each $\lambda>0$ and every square-integrable infinitely-divisible (ID) distribution there exists at least one stationary stochastic process $t\mapsto X_t$ with the specified distribution for $X_1$ and with first-order autoregressive…

Probability · Mathematics 2021-06-02 Robert L Wolpert

How much dependence is there in the prime factorization of a random integer distributed uniformly from 1 to n? How much dependence is there in the decomposition into cycles of a random permutation of n points? What is the relation between…

Number Theory · Mathematics 2013-05-07 Richard Arratia

We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…

Probability · Mathematics 2007-05-23 Shannon Starr

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

Formal Languages and Automata Theory · Computer Science 2025-05-05 Olivier Carton , Jean-Michel Couvreur , Martin Delacourt , Nicolas Ollinger