1,203 research outputs found
Probabilistic sampling of finite renewal processes
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
We consider the following problem in one-dimensional diffusion-limited
aggregation (DLA). At time , we have an "aggregate" consisting of
[with a positive integer]. We also have
particles at , . All these particles perform independent
continuous-time symmetric simple random walks until the first time at
which some particle tries to jump from to . The aggregate is
then increased to the integers in [so that
] and all particles which were at at time are
removed from the system. The problem is to determine how fast grows as a
function of if we start at time 0 with and the i.i.d.
Poisson variables with mean . It is shown that if , then
is of order , in a sense which is made precise. It is conjectured
that will grow linearly in if 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
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
We consider the following interacting particle system: There is a ``gas'' of
particles, each of which performs a continuous-time simple random walk on
, with jump rate . These particles are called -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
-particles at , and that the ,
are i.i.d., mean- Poisson random variables. In addition, there are
-particles which perform continuous-time simple random walks with jump rate
. We start with a finite number of -particles in the system at time 0.
-particles are interpreted as individuals who have heard a certain rumor or
who are infected. The -particles move independently of each other. The only
interaction is that when a -particle and an -particle coincide, the
latter instantaneously turns into a -particle. We investigate how fast the
rumor, or infection, spreads. Specifically, if
a -particle visits during
and , then we investigate the
asymptotic behavior of . Our principal result states that if
(so that the - and -particles perform the same random walk), then there
exist constants such that almost surely
for all large ,
where . In a further paper we shall use the results
presented here to prove a full ``shape theorem,'' saying that
converges almost surely to a nonrandom set , with the origin as an
interior point, so that the true growth rate for is linear in . If
, then we can only prove the upper bound 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
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
- …