Frank Mousset

Discrete Mathematics and Combinatorics · 2019

A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 7 citations into it
• Computational Theory and Mathematics — 5 citations into it
• Geometry and Topology — 5 citations into it

Whom Frank Mousset trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Svante Janson
2. Béla Bollobás
3. Bhaswar B. Bhattacharya
4. Sourav Chatterjee

Papers from Frank Mousset's perspective

Ordered by how strongly the researchers Frank Mousset trusts endorse each paper. Same corpus, a different order for every researcher.

1. Upper tails for subgraph counts in random graphs
2. Estimating and understanding exponential random graph models
3. Upper tails and independence polynomials in random graphs
4. Nonlinear large deviations
5. Random Graphs: Notation
6. Et al
7. A theorem of finite sets
8. Concentration Inequalities (Annual Conference Computational Learning Theory)
9. Probability inequalities for sum of bounded random variables
10. Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations (Geometric and Functional Analysis)

Their papers

• Upper tails via high moments and entropic stability (2019) — 61 citations