1,204,756 research outputs found

    Limit theorems for the number of occupied boxes in the Bernoulli sieve

    Full text link
    The Bernoulli sieve is a version of the classical `balls-in-boxes' occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative renewal process, also known as the residual allocation model or stick-breaking. We focus on the number KnK_n of boxes occupied by at least one of nn balls, as nn\to\infty. A variety of limiting distributions for KnK_n is derived from the properties of associated perturbed random walks. Refining the approach based on the standard renewal theory we remove a moment constraint to cover the cases left open in previous studies.Comment: submitte

    Lambda-coalescents with dust component

    Full text link
    We consider the lambda-coalescent processes with positive frequency of singleton clusters. The class in focus covers, for instance, the beta(a,b)(a,b)-coalescents with a>1a>1. We show that some large-sample properties of these processes can be derived by coupling the coalescent with an increasing L{\'e}vy process (subordinator), and by exploiting parallels with the theory of regenerative composition structures. In particular, we discuss the limit distributions of the absorption time and the number of collisions.Comment: 21 page

    Regenerative compositions in the case of slow variation: A renewal theory approach

    Full text link
    A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous studies Barbour and Gnedin (2006), Gnedin, Iksanov and Marynych (2010) and Gnedin, Pitman and Yor (2006) on the asymptotics of the number of blocks KnK_n in the composition of integer nn, in the case when the L{\'e}vy measure of the subordinator has a property of slow variation at 0. Using tools from the renewal theory the limit laws for KnK_n are obtained in terms of integrals involving the Brownian motion or stable processes. In other words, the limit laws are either normal or other stable distributions, depending on the behavior of the tail of L{\'e}vy measure at \infty. Similar results are also derived for the number of singleton blocks.Comment: 22 pages, submitted to EJ

    Spin relaxation in the presence of electron-electron interactions

    Full text link
    The D'yakonov-Perel' spin relaxation induced by the spin-orbit interaction is examined in disordered two-dimensional electron gas. It is shown that, because of the electron-electron interactions different spin relaxation rates can be obtained depending on the techniques used to extract them. It is demonstrated that the relaxation rate of a spin population is proportional to the spin-diffusion constant D_s, while the spin-orbit scattering rate controlling the weak-localization corrections is proportional to the diffusion constant D, i.e., the conductivity. The two diffusion constants get strongly renormalized by the electron-electron interactions, but in different ways. As a result, the corresponding relaxation rates are different, with the difference between the two being especially strong near a magnetic instability or near the metal-insulator transition.Comment: To appear in Phys. Rev. Lett. (2006

    On multi-dimensional sampling and interpolation

    Full text link
    The paper discusses sharp sufficient conditions for interpolation and sampling for functions of n variables with convex spectrum. When n=1, the classical theorems of Ingham and Beurling state that the critical values in the estimates from above (from below) for the distances between interpolation (sampling) nodes are the same. This is no longer true for n>1. While the critical value for sampling sets remains constant, the one for interpolation grows linearly with the dimension

    Yet again on polynomial convergence for SDEs with a gradient-type drift

    Full text link
    Bounds on convergence rate to the invariant distribution for a class of stochastic differential equations (SDEs) with a gradient-type drift are obtained.Comment: 9 pages, 11 reference

    A Gr\"{o}bner basis for Kazhdan-Lusztig ideals

    Full text link
    Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A flag variety. Our main result is a Grobner basis for these ideals. This provides a single geometric setting to transparently explain the naturality of pipe dreams on the Rothe diagram of a permutation, and their appearance in: * combinatorial formulas [Fomin-Kirillov '94] for Schubert and Grothendieck polynomials of [Lascoux-Schutzenberger '82]; * the equivariant K-theory specialization formula of [Buch-Rimanyi '04]; and * a positive combinatorial formula for multiplicities of Schubert varieties in good cases, including those for which the associated Kazhdan-Lusztig ideal is homogeneous under the standard grading. Our results generalize (with alternate proofs) [Knutson-Miller '05]'s Grobner basis theorem for Schubert determinantal ideals and their geometric interpretation of the monomial positivity of Schubert polynomials. We also complement recent work of [Knutson '08,'09] on degenerations of Kazhdan-Lusztig varieties in general Lie type, as well as work of [Goldin '01] on equivariant localization and of [Lakshmibai-Weyman '90], [Rosenthal-Zelevinsky '01], and [Krattenthaler '01] on Grassmannian multiplicity formulas.Comment: 40 pages; to appear in Amer. J. Mat

    Categorical joins

    Full text link
    We introduce the notion of a categorical join, which can be thought of as a categorification of the classical join of two projective varieties. This notion is in the spirit of homological projective duality, which categorifies classical projective duality. Our main theorem says that the homological projective dual category of the categorical join is naturally equivalent to the categorical join of the homological projective dual categories. This categorifies the classical version of this assertion and has many applications, including a nonlinear version of the main theorem of homological projective duality.Comment: 58 pages. Final version, to appear in JAM

    Magnetic susceptibility of the quark condensate via holography

    Full text link
    We discuss the holographic derivation of the magnetic susceptibility of the quark condensate. It is found that the susceptibility emerges upon the account of the Chern-Simons term in the holographic action. We demonstrate that Vainshtein's relation is not exact in the hard wall dual model but is fulfilled with high accuracy. Some comments concerning the spectral density of the Dirac operator are presented.Comment: 7 pages, the version published in Phys.Rev.

    Rollerchain, a Blockchain With Safely Pruneable Full Blocks

    Full text link
    Bitcoin is the first successful decentralized global digital cash system. Its mining process requires intense computational resources, therefore its usefulness remains a disputable topic. We aim to solve three problems with Bitcoin and other blockchain systems of today by repurposing their work. First, space to store a blockchain is growing linearly with number of transactions. Second, a honest node is forced to be irrational regarding storing full blocks by a way implementations are done. Third, a trustless bootstrapping process for a new node involves downloading and processing all the transactions ever written into a blockchain. In this paper we present a new consensus protocol for Bitcoin-like peer-to-peer systems where a right to generate a block is given to a party providing non-interactive proofs of storing a subset of the past state snapshots. Unlike the blockchain systems in use today, a network using our protocol is safe if the nodes prune full blocks not needed for mining. We extend the GKL model to describe our Proof-of-Work scheme and a transactional model modifications needed for it. We provide a detailed analysis of our protocol and proofs of its security
    corecore