Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Nicolas Wicker"'
Autor:
Alejandro Murua, Nicolas Wicker
Publikováno v:
Austrian Journal of Statistics, Vol 49, Iss 2 (2020)
We introduce a fast method to estimate the complete-data set of k-nearest-neighbors.This is equivalent to finding an estimate of the k-nearest-neighbor graph of the data. The method relies on random normal projections. The k-nearest-neighbors are est
Externí odkaz:
https://doaj.org/article/2d382ac567f64c38a771decffec52481
Publikováno v:
Austrian Journal of Statistics, Vol 48, Iss 5 (2019)
A graph random walk is presented. It is derived from the p-Laplacian similarly to the derivation of the canonical random walk from the Laplacian. This variant enables quicker exploration while still sticking to the connection constraints given by the
Externí odkaz:
https://doaj.org/article/8c1fe0e8d9c746b99728a03f092654ce
Publikováno v:
Austrian Journal of Statistics, Vol 48, Iss 5 (2019)
This article presents two methods to sample uniform subtrees from graphs using Metropolis-Hastings algorithms. One method is an independent Metropolis-Hastings and the other one is a type of add-and-delete MCMC. In addition to the theoretical cont
Externí odkaz:
https://doaj.org/article/7c84ef1107df4322938e765f94282676
Publikováno v:
PLoS ONE, Vol 7, Iss 2, p e31345 (2012)
In this paper we investigate how metabolic network structure affects any coordination between transcript and metabolite profiles. To achieve this goal we conduct two complementary analyses focused on the metabolic response to stress. First, we invest
Externí odkaz:
https://doaj.org/article/b8ad6a6e361c4a95a19f2430666fccb9
Publikováno v:
Communications in Statistics - Theory and Methods. :1-9
Autor:
Abdelrahman Eid, Nicolas Wicker
Publikováno v:
Communications in Statistics - Theory and Methods. 52:398-408
The choice of a bandwidth can affect dramatically the accuracy of classification methods relying on it. Recently, a large number of methods to choose the bandwidth have been developed. This article...
Autor:
Diala Wehbe, Nicolas Wicker
Publikováno v:
Sankhya B. 84:188-203
This paper aims at making explicit the mixing time found by Anari et al. (2016) for k-DPP Monte-Carlo sampling when it is applied on large graphs. This yields a polynomial bound on the mixing time of the associated Markov chain under mild conditions
Publikováno v:
MathematicS In Action
MathematicS In Action, 2021, ⟨10.5802/msia.13⟩
MathematicS In Action, Société de Mathématiques Appliquées et Industrielles, 2021, ⟨10.5802/msia.13⟩
MathematicS In Action, 2021, ⟨10.5802/msia.13⟩
MathematicS In Action, Société de Mathématiques Appliquées et Industrielles, 2021, ⟨10.5802/msia.13⟩
Determinantal point processes (DPPs) are popular tools that supply useful information for repulsiveness. They provide coherent probabilistic models when negative correlations arise and also represent new algo-rithms for inference problems like sampli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::982544ebf7dc4532e0ba8141f08dbcb1
https://hal.science/hal-03402874/document
https://hal.science/hal-03402874/document
Publikováno v:
Publications Mathématiques de Besançon. :85-94
Publikováno v:
Journal of Applied Statistics. 44:2697-2715
The three-dimensional structure of a given protein can take different conformations depending upon the reaction it undergoes and its substrate/cofactor/partners binding state. Various methods exist to study these conformational changes but only one,