10,119 research outputs found

    Discrepancy bounds for low-dimensional point sets

    Full text link
    The class of (t,m,s)(t,m,s)-nets and (t,s)(t,s)-sequences, introduced in their most general form by Niederreiter, are important examples of point sets and sequences that are commonly used in quasi-Monte Carlo algorithms for integration and approximation. Low-dimensional versions of (t,m,s)(t,m,s)-nets and (t,s)(t,s)-sequences, such as Hammersley point sets and van der Corput sequences, form important sub-classes, as they are interesting mathematical objects from a theoretical point of view, and simultaneously serve as examples that make it easier to understand the structural properties of (t,m,s)(t,m,s)-nets and (t,s)(t,s)-sequences in arbitrary dimension. For these reasons, a considerable number of papers have been written on the properties of low-dimensional nets and sequences

    From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules

    Full text link
    In 1935 J.G. van der Corput introduced a sequence which has excellent uniform distribution properties modulo 1. This sequence is based on a very simple digital construction scheme with respect to the binary digit expansion. Nowadays the van der Corput sequence, as it was named later, is the prototype of many uniformly distributed sequences, also in the multi-dimensional case. Such sequences are required as sample nodes in quasi-Monte Carlo algorithms, which are deterministic variants of Monte Carlo rules for numerical integration. Since its introduction many people have studied the van der Corput sequence and generalizations thereof. This led to a huge number of results. On the occasion of the 125th birthday of J.G. van der Corput we survey many interesting results on van der Corput sequences and their generalizations. In this way we move from van der Corput's ideas to the most modern constructions of sequences for quasi-Monte Carlo rules, such as, e.g., generalized Halton sequences or Niederreiter's (t,s)(t,s)-sequences

    On the distribution of surface extrema in several one- and two-dimensional random landscapes

    Full text link
    We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function P(M,L)P(M,L) of the number MM of maximal points (i.e., local ``peaks'') of growing surfaces. Our analysis is based on two central results: (i) the proof (presented here) of the fact that uniform one--dimensional ballistic growth process in the steady state can be mapped onto ''rise-and-descent'' sequences in the ensemble of random permutation matrices; and (ii) the fact, established in Ref. \cite{ov}, that different characteristics of ``rise-and-descent'' patterns in random permutations can be interpreted in terms of a certain continuous--space Hammersley--type process. For one--dimensional system we compute P(M,L)P(M,L) exactly and also present explicit results for the correlation function characterizing the enveloping surface. For surfaces grown on 2d substrates, we pursue similar approach considering the ensemble of permutation matrices with long--ranged correlations. Determining exactly the first three cumulants of the corresponding distribution function, we define it in the scaling limit using an expansion in the Edgeworth series, and show that it converges to a Gaussian function as L→∞L \to \infty.Comment: 25 pages, 12 figure

    Random patterns generated by random permutations of natural numbers

    Full text link
    We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time nn, whose moves to the right or to the left are induced by the rise-and-descent sequence associated with a given random permutation. We determine exactly the probability of finding the trajectory of such a permutation-generated random walk at site XX at time nn, obtain the probability measure of different excursions and define the asymptotic distribution of the number of "U-turns" of the trajectories - permutation "peaks" and "through". In the second part, we focus on some statistical properties of surfaces obtained by randomly placing natural numbers 1,2,3,>...,L1,2,3, >...,L on sites of a 1d or 2d square lattices containing LL sites. We calculate the distribution function of the number of local "peaks" - sites the number at which is larger than the numbers appearing at nearest-neighboring sites - and discuss some surprising collective behavior emerging in this model.Comment: 16 pages, 5 figures; submitted to European Physical Journal, proceedings of the conference "Stochastic and Complex Systems: New Trends and Expectations" Santander, Spai

    The Euler and Springer numbers as moment sequences

    Full text link
    I study the sequences of Euler and Springer numbers from the point of view of the classical moment problem.Comment: LaTeX2e, 30 pages. Version 2 contains some small clarifications suggested by a referee. Version 3 contains new footnotes 9 and 10. To appear in Expositiones Mathematica
    • …
    corecore