The full rank condition for sparse random matrices

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: Combinatorics, probability and computing, 33.2024, 5, S. 643-707

Event: Veröffentlichung

(where): Frankfurt am Main

(who): Universitätsbibliothek Johann Christian Senckenberg

(when): 2024

Creator: Coja-Oghlan, Amin
Gao, Pu
Hahn-Klimroth, Maximilian Grischa
Lee, Joon
Müller, Noela
Rolvien, Maurice

DOI: 10.1017/S096354832400021X

URN: urn:nbn:de:hebis:30:3-871468

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:33 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Coja-Oghlan, Amin
Gao, Pu
Hahn-Klimroth, Maximilian Grischa
Lee, Joon
Müller, Noela
Rolvien, Maurice
Universitätsbibliothek Johann Christian Senckenberg

Time of origin

2024

Other Objects (12)

The rank of sparse random matrices

On the rank of combinatorial sparse random matrices

Random perturbation of sparse graphs

Sparse random models in combinatorics

Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes

Sparse random hamiltonians are quantumly easy

Artikel

Random rank-dependent expected utility

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Hochschulschrift

Projection Methods in Sparse and Low Rank Feasibility

Sparse reduced-rank regression for integrating omics data

Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization

The rank of sparse random matrices

On the rank of combinatorial sparse random matrices

Random perturbation of sparse graphs

Sparse random models in combinatorics

Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes

Sparse random hamiltonians are quantumly easy

Artikel

Random rank-dependent expected utility

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Hochschulschrift

Projection Methods in Sparse and Low Rank Feasibility

Sparse reduced-rank regression for integrating omics data

Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization

The rank of sparse random matrices

On the rank of combinatorial sparse random matrices

Random perturbation of sparse graphs

Sparse random models in combinatorics

Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes

Sparse random hamiltonians are quantumly easy

Artikel

Random rank-dependent expected utility

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Hochschulschrift

Projection Methods in Sparse and Low Rank Feasibility

Sparse reduced-rank regression for integrating omics data

Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

The full rank condition for sparse random matrices

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

The rank of sparse random matrices

The rank of sparse random matrices

On the rank of combinatorial sparse random matrices

Random perturbation of sparse graphs

Sparse random models in combinatorics

Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes

Sparse random hamiltonians are quantumly easy

Random rank-dependent expected utility

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Projection Methods in Sparse and Low Rank Feasibility

Sparse reduced-rank regression for integrating omics data

Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization

The rank of sparse random matrices

The rank of sparse random matrices

On the rank of combinatorial sparse random matrices

Random perturbation of sparse graphs

Sparse random models in combinatorics

Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes

Sparse random hamiltonians are quantumly easy

Random rank-dependent expected utility

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Projection Methods in Sparse and Low Rank Feasibility

Sparse reduced-rank regression for integrating omics data

Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization

The rank of sparse random matrices

The rank of sparse random matrices

On the rank of combinatorial sparse random matrices

Random perturbation of sparse graphs

Sparse random models in combinatorics

Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes

Sparse random hamiltonians are quantumly easy

Random rank-dependent expected utility

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Projection Methods in Sparse and Low Rank Feasibility

Sparse reduced-rank regression for integrating omics data

Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization

Related objects

Reset password