English
Related papers

Related papers: On the Asymptotic Behavior of Guessing Sequences

200 papers

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

Probability · Mathematics 2024-07-10 Daniela Bertacchi , Elisabetta Candellero , Fabio Zucca

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray

In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…

Statistics Theory · Mathematics 2012-11-26 Stefano Favaro , Antonio Lijoi , Igor Prünster

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

Probability · Mathematics 2007-05-23 Svante Janson

We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…

Combinatorics · Mathematics 2025-05-21 Michael Krivelevich , Maksim Zhukovskii

A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…

Number Theory · Mathematics 2020-07-09 Dragos Crisan , Radek Erban

In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…

Probability · Mathematics 2024-09-10 Alice Guionnet , Jiaoyang Huang

We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…

Statistical Mechanics · Physics 2009-11-07 C. Vanderzande , F. Daerden

We establish large deviations properties valid for almost every sample path of a class of stationary mixing processes $(X_1,..., X_n,...)$. These properties are inherited from those of $S_n=\sum_{i=1}^nX_i$ and describe how the local…

Probability · Mathematics 2011-12-08 Julien Barral , Patrick Loiseau

In probability theory, there exist discrete and continuous distributions. Generally speaking, we do not have sufficient kinds and properties of discrete ones compared to the continuous ones. In this paper, we treat the Riemann zeta…

Probability · Mathematics 2023-06-05 Takahiro Aoyama , Ryuya Namba , Koki Ota

A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for…

Logic · Mathematics 2012-01-25 Samuel Alexander

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Probability · Mathematics 2026-01-21 Ze-Chun Hu , Xue Peng , Renming Song , Yuan Tan

We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…

Probability · Mathematics 2025-09-03 Frankie Higgs

Random walks on a group $G$ model many natural phenomena. A random walk is defined by a probability measure $p$ on $G$. We are interested in asymptotic properties of the random walks and in particular in the linear drift and the asymptotic…

Probability · Mathematics 2015-12-14 Lorenz A. Gilch , François Ledrappier

We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of…

Logic · Mathematics 2017-12-19 Andreas Blass , Mauro Di Nasso , Marco Forti

Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…

Number Theory · Mathematics 2026-05-11 Bing He , Guanting Liu

We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…

Probability · Mathematics 2007-05-23 David J. Aldous , Gregory Miermont , Jim Pitman

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

Functional Analysis · Mathematics 2020-10-01 Lassi Paunonen , David Seifert

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

Probability · Mathematics 2007-05-23 Jason Fulman

Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-L\"of, Karp and Aldous to give a simple proof of the asymptotic normality of the size of the giant component in the random graph $G(n,p)$ above the phase…

Probability · Mathematics 2012-10-29 Bela Bollobas , Oliver Riordan