English
Related papers

Related papers: Maxima and near-maxima of a Gaussian random assign…

200 papers

We develop a supersymmetric field theoretical description of the Gaussian ensemble of the almost diagonal Hermitian Random Matrices. The matrices have independent random entries H_{ij} with parametrically small off-diagonal elements…

Disordered Systems and Neural Networks · Physics 2016-09-07 Oleg Yevtushenko , Alexander Ossipov

We consider the problem of minimizing cost among one-to-one assignments of $n$ jobs onto $n$ machines. The random assignment problem refers to the case when the cost associated with performing jobs on machines are random variables. Aldous…

Disordered Systems and Neural Networks · Physics 2007-05-23 Chandra Nair

There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work is the first treatment of a natural stochastic variant of the problem where the cost of comparing two elements is a…

Data Structures and Algorithms · Computer Science 2007-10-02 Stanislav Angelov , Keshav Kunal , Andrew McGregor

By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…

Probability · Mathematics 2025-12-11 Fraser Daly

In a random model of minimum cost bipartite matching based on exponentially distributed edge costs, we show that the distribution of the cost of the optimal solution can be computed efficiently. The distribution is represented by its moment…

Probability · Mathematics 2026-02-10 Johan Wästlund

Parametric density estimation, for example as Gaussian distribution, is the base of the field of statistics. Machine learning requires inexpensive estimation of much more complex densities, and the basic approach is relatively costly…

Machine Learning · Computer Science 2017-02-21 Jarek Duda

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…

Computational Complexity · Computer Science 2012-07-02 Amit Chakrabarti , Oded Regev

We study the convergence behavior of the Expectation Maximization (EM) algorithm on Gaussian mixture models with an arbitrary number of mixture components and mixing weights. We show that as long as the means of the components are separated…

Statistics Theory · Mathematics 2018-10-10 Ruofei Zhao , Yuanzhi Li , Yuekai Sun

Over the past decade, characterizing the exact asymptotic risk of regularized estimators in high-dimensional regression has emerged as a popular line of work. This literature considers the proportional asymptotics framework, where the…

Statistics Theory · Mathematics 2024-01-02 Samriddha Lahiry , Pragya Sur

Graphical models with bi-directed edges (<->) represent marginal independence: the absence of an edge between two vertices indicates that the corresponding variables are marginally independent. In this paper, we consider maximum likelihood…

Methodology · Statistics 2012-12-12 Mathias Drton , Thomas S. Richardson

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

Functional Analysis · Mathematics 2022-07-13 Daniel Bartl , Shahar Mendelson

We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…

Probability · Mathematics 2025-09-05 Yaniv Plan , Roman Vershynin

Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$. In the case of large…

Information Theory · Computer Science 2018-03-05 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher , Subrata Sarkar

We study the discrete Gaussian free field (harmonic crystal) on $\mathbb{Z}^d$, $d\geq 3$, with uniformly elliptic and bounded random conductances sampled according to a sufficiently mixing environment measure. We consider the hard wall…

Probability · Mathematics 2025-10-29 Alberto Chiarini , Emanuele Pasqui

We consider a class of Gaussian Free Fields denoted by $(g_x)_{x \in {\cal V}_N}$, where $ {\cal V}_N = \{0,1\}^N$ and $N\in \mathbb{Z}_+$. These fields are related to a general class of $N$-dimensional random walks on the hypercube, which…

Probability · Mathematics 2025-10-22 Robert Griffiths

It is known that the normalized maxima of a sequence of independent and identically distributed bivariate normal random vectors with correlation coefficient $\rho \in (-1,1)$ is asymptotically independent, which may seriously underestimate…

Probability · Mathematics 2014-02-25 Enkelejd Hashorva , Liang Peng , Zhichao Weng

The paper contains results in three areas: First we present a general estimate for tail probabilities of Gaussian quadratic forms with known expectation and variance. Thereafter we analyze the distribution of norms of complex Gaussian…

Probability · Mathematics 2019-03-20 Georg Berschneider , Björn Böttcher

We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass…

Probability · Mathematics 2019-06-24 Louis-Pierre Arguin , Lisa Hartung , Nicola Kistler

We consider the Gaussian free field on the torus whose covariance kernel is given by the zero-average Green's function. We show that for dimension $d\ge 3$, the extremal point process associated with this field converges weakly to a Poisson…

Probability · Mathematics 2024-05-31 Sayan Das , Rajat Subhra Hazra

In this paper we address the complexity of solving linear programming problems with a set of differential equations that converge to a fixed point that represents the optimal solution. Assuming a probabilistic model, where the inputs are…

Computational Complexity · Computer Science 2007-05-23 Asa Ben-Hur , Joshua Feinberg , Shmuel Fishman , Hava T. Siegelmann
‹ Prev 1 3 4 5 6 7 10 Next ›