English
Related papers

Related papers: Iterated limits for aggregation of randomized INAR…

200 papers

We study linear statistics of a class of determinantal processes which interpolate between Poisson and GUE/Ginibre statistics in dimension 1 or 2. These processes are obtained by performing an independent Bernoulli percolation on the…

Probability · Mathematics 2019-07-23 Gaultier Lambert

This paper proposes and establishes the iteration-complexity of an inexact proximal accelerated augmented Lagrangian (IPAAL) method for solving linearly constrained smooth nonconvex composite optimization problems. Each IPAAL iteration…

Optimization and Control · Mathematics 2020-06-16 Jefferson G. Melo , Renato D. C. Monteiro , Hairong Wang

In this paper the integer-valued autoregressive model of order one, contaminated with additive or innovational outliers is studied in some detail. Moreover, parameter estimation is also addressed. Supposing that the time points of the…

Probability · Mathematics 2010-02-28 Matyas Barczy , Marton Ispany , Gyula Pap , Manuel Scotto , Maria Eduarda Silva

When measuring the value of a function to be minimized is not only expensive but also with noise, the popular simultaneous perturbation stochastic approximation (SPSA) algorithm requires only two function values in each iteration. In this…

Optimization and Control · Mathematics 2022-03-08 Shiru Li , Yong Xia , Zi Xu

A special class of standard Gaussian Autoregressive Hilbertian processes of order one (Gaussian ARH(1) processes), with bounded linear autocorrelation operator, which does not satisfy the usual Hilbert-Schmidt assumption, is considered. To…

Applications · Statistics 2018-09-05 M. Dolores Ruiz-Medina , J. Álvarez-Liébana

Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…

Numerical Analysis · Mathematics 2025-04-28 Jonathan Weare , Robert J. Webber

We reconsider a nonparametric density model based on Gaussian processes. By augmenting the model with latent P\'olya--Gamma random variables and a latent marked Poisson process we obtain a new likelihood which is conjugate to the model's…

Machine Learning · Statistics 2018-05-30 Christian Donner , Manfred Opper

Guerrero et al. \cite{GBSO} propose a novel approach to building first-order integer-valued autoregressive (\inar1) models based on the concept of thinning. The standard approach requires that the thinning operator be defined first and…

Probability · Mathematics 2024-03-07 Nadjib Bouzar

We construct admissible circulant Laplacian matrix functions as generators for strictly increasing random walks on the integer line. These Laplacian matrix functions refer to a certain class of Bernstein functions. The approach has…

Probability · Mathematics 2020-12-10 Thomas M. Michelitsch , Federico Polito , Alejandro P. Riascos

We study mean-field inclusion processes with an additional slow phase, in which particle interactions occur at a vanishing rate proportional to the inverse system size. In the thermodynamic limit, such systems exhibit condensation at high…

Probability · Mathematics 2025-07-21 Simon Gabriel

Sequential importance sampling algorithms have been defined to estimate likelihoods in models of ancestral population processes. However, these algorithms are based on features of the models with constant population size, and become…

Statistics Theory · Mathematics 2016-03-24 Coralie Merle , Raphaël Leblois , François Rousset , Pierre Pudlo

Fractional renewal processes as a generalization of Poisson process are already in the literature. In this paper, by introducing a new concept of generalized density function, the authors construct new fractional renewal processes in the…

Statistics Theory · Mathematics 2014-10-30 Jung Hun Han

In this paper, the weak convergence of additive functionals of processes with locally independent increments and with Markov switching in the scheme of Poisson approximation is proved. For the relative compactness, a method proposed by R.…

Probability · Mathematics 2009-10-20 V. S. Koroliuk , N. Limnios , I. V. Samoilenko

We use the replica method of statistical mechanics to examine a typical performance of correctly reconstructing $N$-dimensional sparse vector $bx=(x_i)$ from its linear transformation $by=bF bx$ of $P$ dimensions on the basis of…

Information Theory · Computer Science 2010-06-03 Yoshiyuki Kabashima , Tadashi Wadayama , Toshiyuki Tanaka

We extend the notion of cointegration for time series taking values in a potentially infinite dimensional Banach space. Examples of such time series include stochastic processes in C[0,1] equipped with the supremum distance and those in a…

Functional Analysis · Mathematics 2021-03-17 Won-Ki Seo

We consider stochastic variational inequalities with monotone operators defined as the expected value of a random operator. We assume the feasible set is the intersection of a large family of convex sets. We propose a method that combines…

Optimization and Control · Mathematics 2017-03-03 Alfredo Iusem , Alejandro Jofré , Philip Thompson

Numerous practical medical problems often involve data that possess a combination of both sparse and non-sparse structures. Traditional penalized regularizations techniques, primarily designed for promoting sparsity, are inadequate to…

Methodology · Statistics 2023-11-10 Shun Yu , Yuehan Yang

We study the statistical limits of both detecting and estimating a rank-one deformation of a symmetric random Gaussian tensor. We establish upper and lower bounds on the critical signal-to-noise ratio, under a variety of priors for the…

Probability · Mathematics 2017-01-25 Amelia Perry , Alexander S. Wein , Afonso S. Bandeira

We consider from a microscopic perspective large deviation properties of several stochastic interacting particle systems, using their mapping to integrable quantum spin systems. A brief review of recent work is given and several new results…

Statistical Mechanics · Physics 2015-10-19 Gunter M. Schütz

In [Math. Oper. Res., 2011], Fleischer et al. introduced a powerful technique for solving the generic class of separable assignment problems (SAP), in which a set of items of given values and weights needs to be packed into a set of bins…

Data Structures and Algorithms · Computer Science 2024-06-11 Ilan Doron-Arad , Ariel Kulik , Hadas Shachnai