Related papers: The logarithmic law of random determinant

Consider a $N\times n$ random matrix $Y_n=(Y_{ij}^{n})$ where the entries are given by $$ Y_{ij}^{n}=\frac{\sigma_{ij}(n)}{\sqrt{n}} X_{ij}^{n} $$ the $X_{ij}^{n}$ being centered, independent and identically distributed random variables…

It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…

We consider an $N$ by $N$ real symmetric random matrix $X=(x_{ij})$ where $\mathbb{E}x_{ij}x_{kl}=\xi_{ijkl}$. Under the assumption that $(\xi_{ijkl})$ is the discretization of a piecewise Lipschitz function and that the correlation is…

Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…

The superiority of stochastic symplectic methods over non-symplectic counterparts has been verified by plenty of numerical experiments, especially in capturing the asymptotic behaviour of the underlying solution process. How can one…

Differential entropy and log determinant of the covariance matrix of a multivariate Gaussian distribution have many applications in coding, communications, signal processing and statistical inference. In this paper we consider in the high…

We study moments of the logarithmic derivative of characteristic polynomials of orthogonal and symplectic random matrices. In particular, we compute the asymptotics for large matrix size, $N$, of these moments evaluated at points which are…

We obtain strong invariance principles for normalized multiple iterated sums and integrals of the form $\bbS_N^{(\nu)}(t)=N^{-\nu/2}\sum_{0\leq k_1<...<k_\nu\leq Nt}\xi(k_1)\otimes\cdots\otimes\xi(k_\nu)$, $t\in[0,T]$ and…

Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have raised progressive interest recently. The purpose of this paper is to study the strong law of large numbers and the law of the…

Consider an $N\times n$ random matrix $Y_n=(Y^n_{ij})$ where the entries are given by $Y^n_{ij}=\frac{\sigma_{ij}(n)}{\sqrt{n}}X^n_{ij}$, the $X^n_{ij}$ being independent and identically distributed, centered with unit variance and…

The exponential inequality of the maximum partial sums is a key to establish the law of the iterated logarithm of negatively associated random variables. In the one-indexed random sequence case, such inequalities for negatively associated…

In a recent article we have discussed the connections between averages of powers of Riemann's $\zeta$-function on the critical line, and averages of characteristic polynomials of random matrices. The result for random matrices was shown to…

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…

We consider a random walk X_n in non-i.i.d. environment and show that the ratio of log X_n to log n converges in probability to a positive constant.

We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…

Consider random symmetric Toeplitz matrices $T_{n}=(a_{i-j})_{i,j=1}^{n}$ with matrix entries $a_{j}, j=0,1,2,...,$ being independent real random variables such that \be \mathbb{E}[a_{j}]=0, \ \ \mathbb{E}[|a_{j}|^{2}]=1 \ \ \textrm{for}\,\…

Consider a simple symmetric random walk on the integer lattice $\mathbb{Z}$. Let $E(n)$ denote a favorite edge of the random walk at time $n$. In this paper, we study the escape rate of $E(n)$, and show that almost surely…

Let $\alpha \in (0,1)_{\mathbb{R}}$ be irrational and $G_n = G_{n,1/n^\alpha}$ be the random graph with edge probability $1/n^\alpha$; we know that it satisfies the 0-1 law for first order logic. We deal with the failure of the 0-1 law for…

When a Brownian motion is scaled according to the law of the iterated logarithm, its supremum converges to one as time tends to zero. Upper large deviations of the supremum process can be quantified by writing the problem in terms of…