Related papers: Statistical distribution of the Stern sequence
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
Atoms, propagating across a detuned standing laser wave, can be scattered in a chaotic way even in the absence of spontaneous emission and any modulation of the laser field. Spontaneous emission masks the effect in some degree, but the…
We have studied the soliton propagation through a segment containing random point-like scatterers. In the limit of small concentration of scatterers when the mean distance between the scatterers is larger than the soliton width, a method…
The Stern sequence (s(n)) is defined by s(0) = 0, s(1) = 1, s(2n) = s(n), s(2n+1) = s(n) + s(n+1). Stern showed in 1858 that gcd(s(n),s(n+1)) = 1, and that for every pair of relatively prime positive integers (a,b), there exists a unique n…
We propose an asymptotic theory for distribution forecasting from the log normal chain-ladder model. The theory overcomes the difficulty of convoluting log normal variables and takes estimation error into account. The results differ from…
The so-called ``symplectic method'' is used for studying the linear stability of a self-gravitating collisionless stellar system, in which the particles are also submitted to an external potential. The system is steady and spherically…
Grimmett and McDiarmid suggested a simple heuristic for finding stable sets in random graphs. They showed that the heuristic finds a stable set of size $\sim\log_2 n$ (with high probability) on a $G(n, 1/2)$ random graph. We determine the…
Doron Gepner's word statistics, that came up in his research in conformal field theory, is studied and it is conjectured that its scaled limiting distribution is the Logistic distribution. We support this by proving rigorously that the…
Symbolic transfer entropy is a powerful non-parametric tool to detect lead-lag between time series. Because a closed expression of the distribution of Transfer Entropy is not known for finite-size samples, statistical testing is often…
We describe a twisted version of the Stern sequence and study a few of its properties.
We prove that the number of copies of any given permutation pattern $q$ has an asymptotically normal distribution in random permutations.
We develop an algorithm which can learn from partially labeled and unsegmented sequential data. Most sequential loss functions, such as Connectionist Temporal Classification (CTC), break down when many labels are missing. We address this…
We study the periods of Markov sequences, which are derived from the continued fraction expression of elements in the Markov spectrum. This spectrum is the set of minimal values of indefinite binary quadratic forms that are specially…
We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…
This paper examines the distribution of order statistics taken from simple-random-sampling without replacement (SRSWOR) from a finite population with values 1,...,N. This distribution is a shifted version of the beta-binomial distribution,…
The aim of this article is to establish asymptotic distributions and consistency of subsampling for spectral density and for magnitude of coherence for non-stationary, almost periodically correlated time series. We show the asymptotic…
We provide a complete asymptotic distribution theory for clustered data with a large number of independent groups, generalizing the classic laws of large numbers, uniform laws, central limit theory, and clustered covariance matrix…
This paper describes the Difference-of-Log-Normals (DLN) distribution. A companion paper makes the case that the DLN is a fundamental distribution in nature, and shows how a simple application of the CLT gives rise to the DLN in many…
The Small Subgraph Conditioning Method has been used to study the almost sure existence and the asymptotic distribution of the number of regular spanning subgraphs of various types in random \emph{d}-regular graphs. In this paper we use the…
For regularized distributions we establish stability of the characterization of the normal law in Cramer's theorem with respect to the total variation norm and the entropic distance. As part of the argument, Sapogov-type theorems are…