Quantitative estimate on singularities in isoperimetric clusters
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Clustering in education, particularly in large-scale online environments like MOOCs, is essential for understanding and adapting to diverse student needs. However, the effectiveness of clustering depends on its interpretability, which becomes challenging w ...
This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...
In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...
Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision while preserving graph topological structures and node attributive features. Previous Graph Neural Networks (GNN) require a large number of labeled ...
This article presents two algorithms developed based on two different techniques, from clusterization theory, namely k-means clustering technique and Fuzzy C-means technique, respectively. In this context, the study offers a sustained comparison of the two ...
Collective tunneling is a ubiquitous phenomenon in finite-size spin clusters that shows up in systems as diverse as molecular magnets or spin clusters adsorbed at surfaces. The basic problem we explore is to understand how small flipping terms can cooperat ...
In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space Rd. We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if logr/logs is irrational and X and Y are ×r- and ×s-invariant subsets of [0,1], respectively, then $\dim_\text{ ...
A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...
