Related papers: A Probabilistic Approach to Generalized Zeckendorf…
We study the Borel complexity of sets of normal numbers in several numeration systems. Taking a dynamical point of view, we offer a unified treatment for continued fraction expansions and base $r$ expansions, and their various…
The random vector of frequencies in a generalized urn model is viewed as conditionally independent random variables, given their sum. Such a representation is exploited to derive Edgeworth expansions for a sum of functions of such…
Statistical mechanics is generalized on the basis of an additive information theory for incomplete probability distributions. The incomplete normalization $\sum_{i=1}^wp_i^q=1$ is used to obtain generalized entropy $S=-k\sum_{i=1}^wp_i^q\ln…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
We analyse correspondence of a text to a simple probabilistic model. The model assumes that the words are selected independently from an infinite dictionary. The probability distribution correspond to the Zipf---Mandelbrot law. We count…
We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion with uniform error terms. We obtain the expansion from a local central limit theorem and we state all coefficients explicitly as…
Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the…
A rescaled Markov chain converges uniformly in probability to the solution of an ordinary differential equation, under carefully specified assumptions. The presentation is much simpler than those in the outside literature. The result may be…
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
A well-known result from Hardy and Ramanujan gives an asymptotic expression for the number of possible ways to express an integer as the sum of smaller integers. In this vein, we consider the general partitioning problem of writing an…
We consider Aichinger's equation $$f(x_1+\cdots+x_{m+1})=\sum_{i=1}^{m+1}g_i(x_1,x_2,\cdots, \widehat{x_i},\cdots, x_{m+1})$$ for functions defined on commutative semigroups which take values on commutative groups. The solutions of this…
In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…
In this article we investigate the existence of a solution to a semilinear, elliptic, partial differential equation with distributional coefficients and data. The problem we consider is a generalization of the Lichnerowicz equation that one…
Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…
In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…
We study a fixed point iterative method based on generalized relaxation of strictly quasi-nonexpansive operators. The iterative method is assembled by averaging of strings, and each string is composed of finitely many strictly…
We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…
We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…
In the analysis of Markov chains and processes, it is sometimes convenient to replace an unbounded state space with a "truncated" bounded state space. When such a replacement is made, one often wants to know whether the equilibrium behavior…
The Conway-Maxwell-Poisson distribution is a two-parameter generalisation of the Poisson distribution that can be used to model data that is under- or over-dispersed relative to the Poisson distribution. The normalizing constant…