What is she best known for?
The fields of study she is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
Noga Alon mainly focuses on Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Graph theory.
Combinatorics is a component of her Vertex, Randomized algorithm, Integer, Binary logarithm and Graph power studies.
In her research on the topic of Binary logarithm, Parallel algorithm, Pairwise independence, Maximal independent set and Family of sets is strongly related with Deterministic algorithm.
Her Discrete mathematics and Conjecture, Bipartite graph, Independent set, Random graph and Complement graph investigations all form part of her Discrete mathematics research activities.
Her Upper and lower bounds research includes elements of Matching, Absolute value, Broadcasting and Boolean function.
Her Expander mixing lemma study incorporates themes from Efficient algorithm, Eigenvalues and eigenvectors and Ramanujan graph.
Her most cited work include:
- Eigen values and expanders (1010 citations)
- Eigen values and expanders (1010 citations)
- The Space Complexity of Approximating the Frequency Moments (980 citations)
What are the main themes of her work throughout her whole career to date?
Her main research concerns Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Conjecture.
Her is involved in several facets of Combinatorics study, as is seen by her studies on Vertex, Binary logarithm, Bipartite graph, Degree and Graph power.
Noga Alon studies Graph power, focusing on Bound graph in particular.
The study incorporates disciplines such as Graph theory and Set in addition to Discrete mathematics.
Her research on Complement graph frequently links to adjacent areas such as Null graph.
She most often published in these fields:
- Combinatorics (97.86%)
- Discrete mathematics (62.67%)
- Graph (19.43%)
What were the highlights of her more recent work (between 2014-2021)?
- Combinatorics (97.86%)
- Discrete mathematics (62.67%)
- Graph (19.43%)
In recent papers she was focusing on the following fields of study:
Her primary areas of study are Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Random graph.
Her research links Bounded function with Combinatorics.
Her Discrete mathematics study combines topics from a wide range of disciplines, such as Function and Degree.
Her study in the field of Induced subgraph, Complete bipartite graph and Vertex is also linked to topics like Omega.
As a part of the same scientific study, Noga Alon usually deals with the Upper and lower bounds, concentrating on VC dimension and frequently concerns with Moment curve, Rank and Sign.
Her Random graph research is multidisciplinary, incorporating perspectives in Binary logarithm, Theta function, Diagonal and Linear algebra.
Between 2014 and 2021, her most popular works were:
- Many T copies in H-free graphs (125 citations)
- Many T copies in H-free graphs (125 citations)
- Online Learning with Feedback Graphs: Beyond Bandits (41 citations)
In her most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Discrete mathematics
Noga Alon mostly deals with Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Random graph.
Her study brings together the fields of Bounded function and Combinatorics.
Noga Alon has included themes like Function and Asymptotically optimal algorithm in her Discrete mathematics study.
Noga Alon combines subjects such as Symmetrization and Directed graph with her study of Graph.
The Upper and lower bounds study combines topics in areas such as Moment curve, Quadratic equation, Sign and Rank.
Her Random graph study combines topics in areas such as Binary logarithm, Crowds, Complete graph and Wisdom of the crowd.
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.
