Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Expander graph

Related publications (30)

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020

On the optimal sampling design for the Graph Total Variation decoder: recovering piecewise-constant graph signals from a few vertex measurements

Rodrigo Cerqueira Gonzalez Pena

Compressed Sensing teaches us that measurements can be traded for offline computation if the signal being sensed has a simple enough representation. Proper decoders can exactly recover the high-dimensional signal of interest from a lower-dimensional vector ...

EPFL2020

Exponential Convergence for the Fredrickson-Andersen One-Spin Facilitated Model

Thomas Mountford

We prove exponential convergence to equilibrium for the Fredrickson-Andersen one-spin facilitated model on bounded degree graphs satisfying a subexponential, but larger than polynomial, growth condition. This was a classical conjecture related to non-attra ...

SPRINGER/PLENUM PUBLISHERS2019

GOT: An Optimal Transport framework for Graph comparison

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Incidences Between Planes Over Finite Fields

Van Thang Pham

In this note, we use methods from spectral graph theory to obtain bounds on the number of incidences between k-planes and h-planes in F-q(d), which generalizes a recent result given by Bennett, Iosevich, and Pakianathan (2014). More precisely, we prove tha ...

American Mathematical Society (AMS)2019

Tight Bounds for Online Edge Coloring

David Wajc

Vizing's celebrated theorem asserts that any graph of maximum degree Delta admits an edge coloring using at most Delta + 1 colors. In contrast, Bar-Noy, Motwani and Naor showed over a quarter century ago that the trivial greedy algorithm, which uses 2 Delt ...

IEEE COMPUTER SOC2019

Approximating the rectilinear crossing number

János Pach

A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph G, (cr) over bar (G), is the mi ...

2019

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Statistical Physics Methods for Community Detection

Chun Lam Chan

This thesis is devoted to information-theoretic aspects of community detection. The importance of community detection is due to the massive amount of scientific data today that describes relationships between items from a network, e.g., a social network. I ...

EPFL2019

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Jasmina Malicevic

Graph processing systems are used in a wide variety of fields, ranging from biology to social networks. Algorithms to mine graphs incur many random accesses, and the sparse nature of the graphs of interest, exacerbates this. As DRAM sustains high bandwidt ...