Fast Approximate Spectral Clustering for Dynamic Networks

Related publications (28)

About
Privacy
Disclaimer

Graph Chatbot

A full characterization of invariant embeddability of unimodular planar graphs

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...

WILEY2023

Why computational complexity may set impenetrable barriers for epistemic reductionism

Michael Herzog, Christian Sachse, Adrien Christophe Doerig

According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should - in principle - be able to reduce the descriptions and explanations of special sciences to physical ones, for e ...

Springer2023

Smart acoustic lining for UHBR technologies engine: from the design of an electroacoustic metasurface to experimental characterization under flow

Hervé Lissek, Maxime Volery

The SALUTE project aims at evaluating performance of electroacoustic metasurface, employing a surface array of controlled electroacoustic actuators, for smart acoustic lining under grazing turbulent flow to be used in UHBR Technologies Engines. Theoretical ...

Society of Photo-Optical Instrumentation Engineers (SPIE)2023

DiGress: Discrete Denoising diffusion for graph generation

Pascal Frossard, Volkan Cevher, Igor Krawczuk, Clément Arthur Yvon Vignac, Bohan Wang

This work introduces DiGress, a discrete denoising diffusion model for generating graphs with categorical node and edge attributes. Our model utilizes a discrete diffusion process that progressively edits graphs with noise, through the process of adding or ...

2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Cost-effective equalization of electro-optic frequency combs in a Sagnac interferometer

Camille Sophie Brès, Jianqi Hu, Ivan Cardea

We present a cost-effective electro-optic frequency comb generation and equalization method using a single phase modulator inserted in a Sagnac interferometer layout. The equalization relies on the interference of comb lines generated in both clockwise and ...

Optica Publishing Group2023

Fairness and Explainability in Clustering Problems

Xinrui Jia

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 ...

EPFL2023

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Colin Neil Jones, Yuning Jiang, Yingzhao Lian, Xinliang Dai

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

IEEE2023

Page 3 of 3