• Aucun résultat trouvé

[PDF] Top 20 A CLT for information-theoretic statistics of non-centered Gram random matrices

Has 10000 "A CLT for information-theoretic statistics of non-centered Gram random matrices" found on our website. Below are the top 20 most common "A CLT for information-theoretic statistics of non-centered Gram random matrices".

A CLT for information-theoretic statistics of non-centered Gram random matrices

A CLT for information-theoretic statistics of non-centered Gram random matrices

... , for some well-chosen contour C (see for instance ...Fluctuations for particular linear statistics (and general classes of linear statistics) of large random ... Voir le document complet

45

A CLT for Information-theoretic statistics of Gram random matrices with a given variance profile

A CLT for Information-theoretic statistics of Gram random matrices with a given variance profile

... studied for various models of random matrices and for various classes of linear statistics of the eigenvalues in the physics, engineering and mathematical ...CLTs ... Voir le document complet

53

A CLT for linear spectral statistics of large random information-plus-noise matrices

A CLT for linear spectral statistics of large random information-plus-noise matrices

... part of the proposition can be proved as in [ 15 , Theorem 2], [ 10 ], [ 29 , Lemma 4] and one can track down the minimal value of k 0 by carefully following these ...part of the proposition is ... Voir le document complet

23

Gaussian fluctuations for linear spectral statistics of large random covariance matrices

Gaussian fluctuations for linear spectral statistics of large random covariance matrices

... established for specific linear statistics of interest in information theory, with general entries and (possibly non-centered) covariance random matrices with ... Voir le document complet

53

Dynamics of eigenvectors of random matrices and eigenvalues of nonlinear models of matrices

Dynamics of eigenvectors of random matrices and eigenvalues of nonlinear models of matrices

... de matrices aléatoires de type ...de matrices de Wigner déformées, elles consistent en une perturbation d’une matrice de Wigner par une matrice diagonale ...deux matrices sont du même ordre de ... Voir le document complet

162

Random matrices and the Potts model on random graphs

Random matrices and the Potts model on random graphs

... enumeration of maps goes back to the work of ’t Hooft and Br´ ezin-Parisi-Itzykson-Zuber in the ...terms of Gaussian moments and use Feyn- man diagrams representation of the moments, then ... Voir le document complet

34

Speed-Accuracy Tradeoff: A Formal Information-Theoretic Transmission Scheme (FITTS)

Speed-Accuracy Tradeoff: A Formal Information-Theoretic Transmission Scheme (FITTS)

... using a number of different thresholds for the exclusion of outliers, as well as an estimation of the front of performance (in ...characteristic of the front of ... Voir le document complet

35

Study of Meta-analysis strategies for network inference using information-theoretic approaches

Study of Meta-analysis strategies for network inference using information-theoretic approaches

... decade, a variety of algorithms have been proposed in an attempt to address this reverse engineering ...(mutual information, corre- ...mutual information (MI) based algorithms, such as CLR ... Voir le document complet

14

Compression without a common prior: An information-theoretic justification for ambiguity in language

Compression without a common prior: An information-theoretic justification for ambiguity in language

... underlying a bipartite graph between messages and ...as a dictionary: for each encoding it specifies a set of possible messages ...as a language. The receiver’s decoding pro- ... Voir le document complet

10

A Game-theoretic Algorithm for Non-Linear Single-Path Routing Problems

A Game-theoretic Algorithm for Non-Linear Single-Path Routing Problems

... - a direct application of our problem - and provides good approximated results within reasonable execution ...space of solution depending on probability ...construct a solution by routing each ... Voir le document complet

9

Probability density of determinants of random matrices

Probability density of determinants of random matrices

... For quaternions, multiplication being not commutative, it is not possible to define a determinant having the usual three properties [4]; namely, (i) det A = 0 if and only if Ax = 0 has a ... Voir le document complet

11

An Information-theoretic Framework for the Lossy Compression of Link Streams

An Information-theoretic Framework for the Lossy Compression of Link Streams

... Appendix A, we present a general algorithmic framework that has been proposed in previous work to solve such special versions of the ...principle of this framework, and of dynamic ... Voir le document complet

33

(Non)Automaticity of number theoretic functions

(Non)Automaticity of number theoretic functions

... de Bordeaux 22 (2010), 339-352 (Non)Automaticity of number theoretic functions par Michael COONS Résumé. Soit λ(n) la fonction de Liouville indiquant la parité du nombre de facteurs dans la ... Voir le document complet

15

A continuous approach to information-theoretic exploration with range sensors

A continuous approach to information-theoretic exploration with range sensors

... continuous random fields despite the fact that actual computation requires ...practice of initializing occupancy probabilities in an occupancy grid to 1/2 is arbitrary and in application often an ... Voir le document complet

82

Delocalization at small energy for heavy-tailed random matrices

Delocalization at small energy for heavy-tailed random matrices

... eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to ...to a simple criterion related to the inverse ... Voir le document complet

49

Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering

Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering

... see for instance [Newman, 2004; Pons and Latapy, 2005; Sales-Pardo et ...absence of public datasets of graphs with ground-truth hierarchy. A natural approach is then to define some quality ... Voir le document complet

8

Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering

Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering

... quality of the reconstruction is based on the following classical scores [Bordes et ...edges of the reconstructed graph whose weight is larger than some threshold provides a set of graphs with ... Voir le document complet

8

A Game-Theoretic Approach to Information-Flow Control via Protocol Composition

A Game-Theoretic Approach to Information-Flow Control via Protocol Composition

... Quantitative Information Flow (QIF), the attacker typically tries to interfere with the system in the attempt to increase its leakage of secret ...as a type of protocol composition, i.e., ... Voir le document complet

44

A feedback information-theoretic transmission scheme (FITTS) for modeling trajectory variability in aimed movements

A feedback information-theoretic transmission scheme (FITTS) for modeling trajectory variability in aimed movements

... as a result τ), would induce iterations that are not ...As a result, when considering sufficiently many tra- jectories during the construction of a PVP, it is likely that any time interval, ... Voir le document complet

20

Renormalized energy concentration in random matrices

Renormalized energy concentration in random matrices

... class of determinantal point processes with translation invariant kernels in dimensions 1 and 2, lim N →∞ EW N is minimized by the processes whose cor- relation kernel is the Fourier transform of the ... Voir le document complet

46

Show all 10000 documents...