Related papers: Large prime factors of well-distributed sequences
Gibbs partition models are the largest class of infinite exchangeable partitions of the positive integers generalizing the product form of the probability function of the two-parameter Poisson-Dirichlet family. Recently those models have…
We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a randomly chosen node belongs to a component of size s, for any…
Prime numbers have fascinated mathematicians since antiquity, with ongoing efforts to uncover both their properties and ever-larger examples. While giant primes rarely aid cryptography, they find use in areas such as locally decodable…
In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…
We consider a fractional counting process with jumps of amplitude $1,2,\ldots,k$, with $k\in \mathbb{N}$, whose probabilities satisfy a suitable system of fractional difference-differential equations. We obtain the moment generating…
Exchangeable random partition processes are the basis for Bayesian approaches to statistical inference in large alphabet settings. On the other hand, the notion of the pattern of a sequence provides an information-theoretic framework for…
We consider solutions $u^\varepsilon$ of Poisson problems with the Dirichlet condition on domains $\Omega_\varepsilon$ with holes concentrated at subsets of a domain $\Omega$ non-periodically. We show $u^\varepsilon$ converges to a solution…
The proposal and study of dependent prior processes has been a major research focus in the recent Bayesian nonparametric literature. In this paper, we introduce a flexible class of dependent nonparametric priors, investigate their…
This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…
According to a general probabilistic principle, the natural divisors of friable integers (i.e.~free of large prime factors) should normally present a Gaussian distribution. We show that this indeed is the case with conditional density…
In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.
We construct a pair of related diffusions on a space of interval partitions of the unit interval $[0,1]$ that are stationary with the Poisson-Dirichlet laws with parameters (1/2,0) and (1/2,1/2) respectively. These are two particular cases…
Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points. We proceed by specifying in terms of correlation functions the same distribution…
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…
We study properties of the (generalized) Dickman distribution with two parameters and the stationary solution of the Ornstein-Uhlenbeck stochastic differential equation driven by a Poisson process. In particular, we show that the marginal…
We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $\beta_m$ (if the sampled parts are…
This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size $m$. In particular, the size of the sample is allowed to be…
We continue the investigation of sample paths of $q$-Ornstein-Uhlenbeck process. We show that for all $q\in(-1,1)$, the process has big jumps crossing from near one end point of the domain to the other with positive probability. Moreover,…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…