64 citations · 171 across the 34 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 1 cited
On the typical structure of graphs not containing a fixed vertex-critical subgraph
Oren Engelberg, Wojciech Samotij, Lutz Warnke
This work studies the typical structure of sparse -free graphs, that is, graphs that do not contain a subgraph isomorphic to a given graph . Extending the seminal result of O…
math.PR2021
Lower tails via relative entropy
Gady Kozma, Wojciech Samotij
We show that the naive mean-field approximation correctly predicts the leading term of the logarithmic lower tail probabilities for the number of copies of a given subgraph in $G(n…
math.PR2021
What does a typical metric space look like?
Gady Kozma, Tom Meyerovitch, Ron Peled +1
The collection of all metric spaces on points whose diameter is at most can naturally be viewed as a compact convex subset of , k…