What is he best known for?
The fields of study he is best known for:
- Computer network
- Algebra
- Statistics
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Random graph, Regret and Cyber-Insurance.
The concepts of his Discrete mathematics study are interwoven with issues in Inference and Partition.
His Combinatorics research incorporates themes from Gibbs measure and Weak convergence.
His work carried out in the field of Random graph brings together such families of science as Random regular graph, Pathwidth, Indifference graph and Chordal graph.
His research integrates issues of Dimension and Leverage, Artificial intelligence in his study of Regret.
His work is dedicated to discovering how Cyber-Insurance, Insurance policy are connected with Computer security and other disciplines.
His most cited work include:
- Universality in polytope phase transitions and message passing algorithms (160 citations)
- Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs (120 citations)
- Economic Incentives to Increase Security in the Internet: The Case for Insurance (106 citations)
What are the main themes of his work throughout his whole career to date?
Marc Lelarge mainly investigates Combinatorics, Random graph, Discrete mathematics, Algorithm and Graph.
His Combinatorics research is multidisciplinary, incorporating perspectives in Matrix, Eigenvalues and eigenvectors and Stochastic block model.
His Random graph study combines topics in areas such as Theoretical computer science, Indifference graph, Logarithm, Adjacency matrix and Bipartite graph.
His Indifference graph research incorporates elements of Pathwidth and Chordal graph.
His Discrete mathematics study incorporates themes from Event, Queueing theory and Applied mathematics.
His work on Asymptotically optimal algorithm as part of general Algorithm research is frequently linked to Belief propagation, thereby connecting diverse disciplines of science.
He most often published in these fields:
- Combinatorics (35.14%)
- Random graph (32.43%)
- Discrete mathematics (24.32%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (35.14%)
- Artificial intelligence (5.41%)
- Theoretical computer science (8.11%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Combinatorics, Artificial intelligence, Theoretical computer science, Gaussian and Eigenvalues and eigenvectors.
His study involves Random graph and Degree, a branch of Combinatorics.
His Giant component study in the realm of Random graph interacts with subjects such as Graph isomorphism problem.
The Statistical model research Marc Lelarge does as part of his general Artificial intelligence study is frequently linked to other disciplines of science, such as Autoencoder and Personalized medicine, therefore creating a link between diverse domains of science.
The Theoretical computer science study combines topics in areas such as Equivariant map, Quadratic assignment problem, Cluster analysis, Graph embedding and Matrix multiplication.
The concepts of his Eigenvalues and eigenvectors study are interwoven with issues in Matrix, Topology and Laplace operator.
Between 2017 and 2021, his most popular works were:
- Fundamental limits of symmetric low-rank matrix estimation (60 citations)
- Nonbacktracking spectrum of random graphs: Community detection and nonregular Ramanujan graphs (31 citations)
- Recovering Asymmetric Communities in the Stochastic Block Model (20 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algebra
- Statistics
His primary areas of investigation include Combinatorics, Stochastic block model, Random walk, Random graph and Degree.
In general Combinatorics, his work in Path is often linked to Ihara zeta function linking many areas of study.
He has included themes like Random regular graph, Theoretical computer science, Cluster analysis and Graph in his Random walk study.
His Random regular graph research is under the purview of Discrete mathematics.
His Discrete mathematics research includes elements of Poisson distribution and Interpolation.
Marc Lelarge combines subjects such as Matrix, Ramanujan's sum and Coupling with his study of Random graph.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
