8 citations · 11 across the 19 of their papers we have counts for
4 papers · 1 filter
Bigraph percolation problems
Leonardo N. Coregliano
A bigraph is weakly norming if the th root of the density of in is a norm in the space of bounded measurable functions …
On the equivalence of quasirandomness and exchangeable representations independent from lower-order variables
Leonardo N. Coregliano, Henry P. Towsner
It is often convenient to represent a process for randomly generating a graph as a graphon. (More precisely, these give \emph{vertex exchangeable} processes -- those processes in w…
How to get the random graph with non-uniform probabilities?
Leonardo N. Coregliano, Jarosław Swaczyna, Agnieszka Widz
The Rado Graph, sometimes also known as the (countable) Random Graph, can be generated almost surely by putting an edge between any pair of vertices with some fixed probability $p…
High-arity PAC learning via exchangeability
Leonardo N. Coregliano, Maryanthe Malliaris
We develop a theory of high-arity PAC learning, which is statistical learning in the presence of "structured correlation". In this theory, hypotheses are either graphs, hypergraphs…