1,203 research outputs found

    Probabilistic sampling of finite renewal processes

    Get PDF
    Consider a finite renewal process in the sense that interrenewal times are positive i.i.d. variables and the total number of renewals is a random variable, independent of interrenewal times. A finite point process can be obtained by probabilistic sampling of the finite renewal process, where each renewal is sampled with a fixed probability and independently of other renewals. The problem addressed in this work concerns statistical inference of the original distributions of the total number of renewals and interrenewal times from a sample of i.i.d. finite point processes obtained by sampling finite renewal processes. This problem is motivated by traffic measurements in the Internet in order to characterize flows of packets (which can be seen as finite renewal processes) and where the use of packet sampling is becoming prevalent due to increasing link speeds and limited storage and processing capacities.Comment: Published in at http://dx.doi.org/10.3150/10-BEJ321 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm

    A problem in one-dimensional diffusion-limited aggregation (DLA) and positive recurrence of Markov chains

    Full text link
    We consider the following problem in one-dimensional diffusion-limited aggregation (DLA). At time tt, we have an "aggregate" consisting of Z[0,R(t)]\Bbb{Z}\cap[0,R(t)] [with R(t)R(t) a positive integer]. We also have N(i,t)N(i,t) particles at ii, i>R(t)i>R(t). All these particles perform independent continuous-time symmetric simple random walks until the first time t>tt'>t at which some particle tries to jump from R(t)+1R(t)+1 to R(t)R(t). The aggregate is then increased to the integers in [0,R(t)]=[0,R(t)+1][0,R(t')]=[0,R(t)+1] [so that R(t)=R(t)+1R(t')=R(t)+1] and all particles which were at R(t)+1R(t)+1 at time tt'{-} are removed from the system. The problem is to determine how fast R(t)R(t) grows as a function of tt if we start at time 0 with R(0)=0R(0)=0 and the N(i,0)N(i,0) i.i.d. Poisson variables with mean μ>0\mu>0. It is shown that if μ<1\mu<1, then R(t)R(t) is of order t\sqrt{t}, in a sense which is made precise. It is conjectured that R(t)R(t) will grow linearly in tt if μ\mu is large enough.Comment: Published in at http://dx.doi.org/10.1214/07-AOP379 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Exponents, symmetry groups and classification of operator fractional Brownian motions

    Get PDF
    Operator fractional Brownian motions (OFBMs) are zero mean, operator self-similar (o.s.s.), Gaussian processes with stationary increments. They generalize univariate fractional Brownian motions to the multivariate context. It is well-known that the so-called symmetry group of an o.s.s. process is conjugate to subgroups of the orthogonal group. Moreover, by a celebrated result of Hudson and Mason, the set of all exponents of an operator self-similar process can be related to the tangent space of its symmetry group. In this paper, we revisit and study both the symmetry groups and exponent sets for the class of OFBMs based on their spectral domain integral representations. A general description of the symmetry groups of OFBMs in terms of subsets of centralizers of the spectral domain parameters is provided. OFBMs with symmetry groups of maximal and minimal types are studied in any dimension. In particular, it is shown that OFBMs have minimal symmetry groups (as thus, unique exponents) in general, in the topological sense. Finer classification results of OFBMs, based on the explicit construction of their symmetry groups, are given in the lower dimensions 2 and 3. It is also shown that the parametrization of spectral domain integral representations are, in a suitable sense, not affected by the multiplicity of exponents, whereas the same is not true for time domain integral representations

    The spread of a rumor or infection in a moving population

    Full text link
    We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous-time simple random walk on Zd\mathbb{Z}^d, with jump rate DAD_A. These particles are called AA-particles and move independently of each other. They are regarded as individuals who are ignorant of a rumor or are healthy. We assume that we start the system with NA(x,0)N_A(x,0-) AA-particles at xx, and that the NA(x,0),xZdN_A(x,0-),x\in\mathbb{Z}^d, are i.i.d., mean-μA\mu_A Poisson random variables. In addition, there are BB-particles which perform continuous-time simple random walks with jump rate DBD_B. We start with a finite number of BB-particles in the system at time 0. BB-particles are interpreted as individuals who have heard a certain rumor or who are infected. The BB-particles move independently of each other. The only interaction is that when a BB-particle and an AA-particle coincide, the latter instantaneously turns into a BB-particle. We investigate how fast the rumor, or infection, spreads. Specifically, if B~(t):={xZd:\widetilde{B}(t):=\{x\in\mathbb{Z}^d: a BB-particle visits xx during [0,t]}[0,t]\} and B(t)=B~(t)+[1/2,1/2]dB(t)=\widetilde{B}(t)+[-1/2,1/2]^d, then we investigate the asymptotic behavior of B(t)B(t). Our principal result states that if DA=DBD_A=D_B (so that the AA- and BB-particles perform the same random walk), then there exist constants 0<Ci<0<C_i<\infty such that almost surely C(C2t)B(t)C(C1t)\mathcal{C}(C_2t)\subset B(t)\subset \mathcal{C}(C_1t) for all large tt, where C(r)=[r,r]d\mathcal{C}(r)=[-r,r]^d. In a further paper we shall use the results presented here to prove a full ``shape theorem,'' saying that t1B(t)t^{-1}B(t) converges almost surely to a nonrandom set B0B_0, with the origin as an interior point, so that the true growth rate for B(t)B(t) is linear in tt. If DADBD_A\ne D_B, then we can only prove the upper bound B(t)C(C1t)B(t)\subset \mathcal{C}(C_1t) eventually.Comment: Published at http://dx.doi.org/10.1214/009117905000000413 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Models of Late-Type Disk Galaxies: 1-D Versus 2-D

    Full text link
    We investigate the effects of stochasticity on the observed galaxy parameters by comparing our stochastic star formation two-dimensional (2-D) galaxy evolution models with the commonly used one-dimensional (1-D) models with smooth star formation. The 2-D stochastic models predict high variability of the star formation rate and the surface photometric parameters across the galactic disks and in time.Comment: 9 pages, 10 figure
    corecore