Related papers: Exchangeable arrays and integrable systems for cha…
Mixture modeling is a general technique for making any simple model more expressive through weighted combination. This generality and simplicity in part explains the success of the Expectation Maximization (EM) algorithm, in which updates…
We study averages of multiplicative eigenvalue statistics in ensembles of orthogonal Haar distributed matrices, which can alternatively be written as Toeplitz+Hankel determinants. We obtain new asymptotics for symbols with Fisher-Hartwig…
We consider a discrete latent variable model for two-way data arrays, which allows one to simultaneously produce clusters along one of the data dimensions (e.g. exchangeable observational units or features) and contiguous groups, or…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
Exponential integrators are explicit methods for solving ordinary differential equations that treat linear behaviour exactly. The stiff-order conditions for exponential integrators derived in a Banach space framework by Hochbruck and…
This paper examines the joint problem of detection and identification of a sudden and unobservable change in the probability distribution function (pdf) of a sequence of independent and identically distributed (i.i.d.) random variables to…
I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…
We study the class of continuous polynomial Volterra processes, which we define as solutions to stochastic Volterra equations driven by a continuous semimartingale with affine drift and quadratic diffusion matrix in the state of the…
We study the Fredholm determinant of an integrable operator acting on the interval $(0,s)$ whose kernel is constructed out of a hierarchy of higher order analogues to the Painlev\'{e} III equation. This Fredholm determinant describes the…
We claim that looking at probability distributions of \emph{finite time} largest Lyapunov exponents, and more precisely studying their large deviation properties, yields an extremely powerful technique to get quantitative estimates of…
We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
We calculate the time-evolution of a discrete-time fragmentation process in which clusters of particles break up and reassemble and move stochastically with size-dependent rates. In the continuous-time limit the process turns into the…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler…
We study $k$-point correlators of characteristic polynomials in non-Hermitian ensembles of random matrices, focusing on the real, complex and quaternion $N \times N$ Ginibre ensembles. Our approach is based on the technique of character…
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
We show that the chaos representation of some Compound Poisson Type processes displays an underlying intrinsic combinatorial structure, partly independent of the chosen process. From the computational viewpoint, we solve the arising…
The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0,0) to (1,1). This process can also be interpreted in terms of…
We reconsider the problem of calculating a general spectral correlation function containing an arbitrary number of products and ratios of characteristic polynomials for a N x N random matrix taken from the Gaussian Unitary Ensemble (GUE).…
We present the results of systematic numerical computations relating to the extreme value statistics of the characteristic polynomials of random unitary matrices drawn from the Circular Unitary Ensemble (CUE) of Random Matrix Theory. In…