|
Limit Behavior of Sparse Networks I: Structural Sparsity| old_uid | 15654 |
|---|
| title | Limit Behavior of Sparse Networks I: Structural Sparsity |
|---|
| start_date | 2015/05/21 |
|---|
| schedule | 14h30-16h30 |
|---|
| online | no |
|---|
| summary | Classes with bounded expansion and nowhere dense classes are formalizations of the well-observed notions of “sparsity”, which allow many previously intractable problems to become tractable, and to be efficiently solved on real-world large networks. We discuss several aspects of the nowhere dense/somewhere dense dichotomy introduced by the authors for classes of graphs, and their connections to model theory, probability, combinatorics, and computer science. |
|---|
| responsibles | Tellini, Berestycki |
|---|
| |
|