Related papers: Some notes on Lamperti's recurrence of stochastic …
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We prove a transient fluctuation theorem for the currents for continuous-time Markov jump processes with stationary rates, generalizing an asymptotic result by Andrieux and Gaspard [J. Stat. Phys. 127, 107 (2007)] to finite times. The…
We study the recurrence/transience phase transition for Markov chains on $\mathbb{R}_+$, $\mathbb{R}$, and $\mathbb{R}^2$ whose increments have heavy tails with exponent in $(1,2)$ and asymptotically zero mean. This is the infinite-variance…
We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.
We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…
This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.
We investigate a connection between generalized Fibonacci numbers and renewal theory for stochastic processes. Using Blackwell's renewal theorem we find an approximation to the generalized Fibonacci numbers. With the help of error estimates…
In the paper, we generalize some congruences of Lehmer for general composite numbers.
The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [Colombo, Crippa, and Spirito, Calc. Var. Partial Differential Equations 2015] concerning existence and…
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory…
This paper contains an answer to the question of existence of regularities of the so called \textit{random in a broad sense} mass phenomena, asked by A. N. Kolmogorov in \cite{Kolmogorov}. It turns out that some family of finitely-additive…
In this paper, we use Sakai's geometric framework to explore the profound interconnection between recurrence coefficients of the semiclassical Laguerre weight $w(x)=x^{\lambda}\mathrm{e}^{-x^2+sx}$, $x\in\mathbb{R}^+$, $\lambda>-1$,…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
We prove a linear recurrence relation for a large family of generalized Schreier sets, which generalizes the Fibonacci recurrence proved by Bird and higher order Fibonacci recurrence proved by the second author et al. Furthermore, we show a…
We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of $v$-palindromes that inspires this investigation. We also…
This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.