A counterexample to the Bollobás-Riordan conjectures on sparse graph limits.
Ashwin SahMehtaab SawhneyJonathan TidorYufei ZhaoPublished in: Comb. Probab. Comput. (2021)
Keyphrases
- graph model
- gaussian graphical models
- random walk
- high dimensional
- graph based algorithm
- sparse data
- graph theory
- directed acyclic
- model checking
- connected components
- graph matching
- graph representation
- graph partitioning
- neural network
- graphical representation
- graph theoretic
- graph databases
- structured data
- feature selection
- directed acyclic graph
- directed graph
- compressive sensing
- formal verification
- sparse matrix
- similarity measure
- multiscale