Christian Borgs
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Avishay Talonce
- Siddhartha Banerjeeonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Highlights from Current Programs part 2: | Eighth Annual Industry Day | 2022-11-16 |
Three short programs report concrete tools and open claims: a graph limit (graphon) model that generates sparse networks from two-feature link functions and… | ||
| Graphons and Graph Limits 1 | Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp | 2022-08-29 |
Dense graph sequences have a single concrete limit object: graphon = W:[0,1]^2→[0,1], a symmetric feature-kernel that generates inhomogeneous random graphs by… | ||
| Graphons and Graph Limits 2 | Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp | 2022-08-29 |
Defines dense graph limits as graphons and shows that cut metric convergence is equivalent to matching subgraph frequencies, sampled-k distributions… | ||
| Locally Convergent Graphs | Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp | 2022-08-29 |
Sequence convergence uses the rooted-ball metric: pick a vertex uniformly, record the radius-R ball, and set distance = 1/(R+1) where balls are isomorphic… | ||
| nothing matches | ||