10 citations · 52 across the 22 of their papers we have counts for
24 papers
Realizing Infinity
Maryanthe Malliaris, Assaf Peretz
What happens when mathematics realizes infinity. When are mathematical definitions actually useful?
The unstable formula theorem revisited via algorithms
Maryanthe Malliaris, Shay Moran
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response t…
Weak randomness in graphons and theons
Leonardo N. Coregliano, Maryanthe Malliaris
Call a hereditary family of graphs strongly persistent if there exists a graphon such that in all subgraphons of , is precisely the class of…
Countable Ramsey
Leonardo N. Coregliano, Maryanthe Malliaris
The celebrated Erdős-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size , which is a much be…
Complexity and randomness in the Heisenberg groups (and beyond)
Persi Diaconis, Maryanthe Malliaris
By studying the commuting graphs of conjugacy classes of the sequence of Heisenberg groups and their limit we find pseudo-random behavior (and the rando…
Some simple theories from a Boolean algebra point of view
M. Malliaris, S. Shelah
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories reflecting graph sequences, which witness tha…