Related papers: Inhomogeneous random 2-SAT
The following random recurrency: $$ W_{n+1} = U_{n+1} ( W_n + \Lambda_{n+1} ) $$ where $W_{-1}=0.$ is known to be associated with the shot noise : $$ W_{t} = \sum_{0<t_k<t} \Lambda_{k} e^{-(t-t_k)} $$ where the $t_k$ are the dates of a…
Let $\Phi$ be a uniformly random $k$-SAT formula with $n$ variables and $m$ clauses. We study the algorithmic task of finding a satisfying assignment of $\Phi$. It is known that satisfying assignments exist with high probability up to…
The Lasso is an attractive technique for regularization and variable selection for high-dimensional data, where the number of predictor variables $p_n$ is potentially much larger than the number of samples $n$. However, it was recently…
we study the statistical properties of inhomogenous Poisson networks. we perform a detailed analysis of the statistical properties of Poisson networks and show that the topological properties of random cellular structures, can be derived…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…
We study the fundamental problem of calibrating a linear binary classifier of the form $\sigma(\hat{w}^\top x)$, where the feature vector $x$ is Gaussian, $\sigma$ is a link function, and $\hat{w}$ is an estimator of the true linear weight…
SARRIGUREN, a new complete algorithm for SAT based on counting clauses (which is valid also for Unique-SAT and #SAT) is described, analyzed and tested. Although existing complete algorithms for SAT perform slower with clauses with many…
We consistently formalize the probabilistic description of multipartite joint measurements performed on systems of any nature. This allows us: (1) to specify in probabilistic terms the difference between nonsignaling, the Einstein-…
We investigate the nonparametric bivariate additive regression estimation in the random design and long-memory errors and construct adaptive thresholding estimators based on wavelet series. The proposed approach achieves asymptotically…
At first sight, the use of an everywhere positive Wigner function as a probability density to perform stochastic simulations in quantum optics seems equivalent to the introduction of local hidden variables, thus preventing any violation of…
Concerning bivariate least squares linear regression, the classical results obtained for extreme structural models in earlier attempts are reviewed using a new formalism in terms of deviation (matrix) traces which, for homoscedastic data,…
Regularity estimates for an integral operator with a symmetric continuous kernel on a convex bounded domain are derived. The covariance of a mean-square continuous random field on the domain is an example of such an operator. The estimates…
We consider linear random coefficient regression models, where the regressors are allowed to have a finite support. First, we investigate identifiability, and show that the means and the variances and covariances of the random coefficients…
We consider deformed sparse random matrices of the form $H= W+ \lambda V$, where $W$ is a real symmetric sparse random matrix, $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$, and $\lambda = O(1)…
This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second part is a discussion of two…
We investigate random graphs on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point carries an independent random mark and given marks and…
We consider four nontrivial ensembles involving Gaussian Wigner and Wishart matrices. These are relevant to problems ranging from multiantenna communication to random supergravity. We derive the matrix probability density, as well as the…
Classification and probability estimation are fundamental tasks with broad applications across modern machine learning and data science, spanning fields such as biology, medicine, engineering, and computer science. Recent development of…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…