Timezone: »
Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies in statistics and learning theory have provided some theoretical insights about such high-dimensional graph testing problems, but the practicality of the developed theoretical methods remains an open question.
In this paper, we consider the problem of two-sample testing of large graphs. We demonstrate the practical merits and limitations of existing theoretical tests and their bootstrapped variants. We also propose two new tests based on asymptotic distributions. We show that these tests are computationally less expensive and, in some cases, more reliable than the existing methods.
Author Information
Debarghya Ghoshdastidar (University of Tübingen)
Ulrike von Luxburg (University of Tübingen)
More from the Same Authors
-
2023 Poster: Mind the spikes: Benign overfitting of kernels and neural networks in fixed dimension »
Moritz Haas · David Holzmüller · Ulrike Luxburg · Ingo Steinwart -
2022 Poster: Interpolation and Regularization for Causal Learning »
Leena Chennuru Vankadara · Luca Rendsburg · Ulrike Luxburg · Debarghya Ghoshdastidar -
2021 Poster: Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networks »
Pascal Esser · Leena Chennuru Vankadara · Debarghya Ghoshdastidar -
2019 Poster: Foundations of Comparison-Based Hierarchical Clustering »
Debarghya Ghoshdastidar · Michaël Perrot · Ulrike von Luxburg -
2018 Poster: When do random forests fail? »
Cheng Tang · Damien Garreau · Ulrike von Luxburg -
2018 Poster: Measures of distortion for machine learning »
Leena Chennuru Vankadara · Ulrike von Luxburg -
2017 : Ordinal distance comparisons: from topology to geometry »
Ulrike von Luxburg -
2017 Poster: Kernel functions based on triplet comparisons »
Matthäus Kleindessner · Ulrike von Luxburg -
2014 Poster: Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model »
Debarghya Ghoshdastidar · Ambedkar Dukkipati -
2013 Poster: Density estimation from unweighted k-nearest neighbor graphs: a roadmap »
Ulrike von Luxburg · Morteza Alamgir -
2011 Workshop: Relations between machine learning problems - an approach to unify the field »
Robert Williamson · John Langford · Ulrike von Luxburg · Mark Reid · Jennifer Wortman Vaughan -
2011 Poster: Phase transition in the family of p-resistances »
Morteza Alamgir · Ulrike von Luxburg -
2011 Spotlight: Phase transition in the family of p-resistances »
Morteza Alamgir · Ulrike von Luxburg -
2010 Spotlight: Getting lost in space: Large sample analysis of the resistance distance »
Ulrike von Luxburg · Agnes Radl · Matthias Hein -
2010 Poster: Getting lost in space: Large sample analysis of the resistance distance »
Ulrike von Luxburg · Agnes Radl · Matthias Hein -
2009 Workshop: Clustering: Science or art? Towards principled approaches »
Margareta Ackerman · Shai Ben-David · Avrim Blum · Isabelle Guyon · Ulrike von Luxburg · Robert Williamson · Reza Zadeh -
2008 Poster: Influence of graph construction on graph-based clustering measures »
Markus M Maier · Ulrike von Luxburg · Matthias Hein -
2008 Oral: Influence of graph construction on graph-based clustering measures »
Markus M Maier · Ulrike von Luxburg · Matthias Hein -
2007 Session: Spotlights »
Ulrike von Luxburg -
2007 Session: Spotlights »
Ulrike von Luxburg -
2007 Spotlight: Consistent Minimization of Clustering Objective Functions »
Ulrike von Luxburg · Sebastien Bubeck · Stefanie S Jegelka · Michael Kaufmann -
2007 Poster: Consistent Minimization of Clustering Objective Functions »
Ulrike von Luxburg · Sebastien Bubeck · Stefanie S Jegelka · Michael Kaufmann