Publication

A full characterization of invariant embeddability of unimodular planar graphs

Related publications (225)

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.

A type I conjecture and boundary representations of hyperbolic groups

Nicolas Monod

We establish new results on the weak containment of quasi-regular and Koopman representations of a second countable locally compact group G

G

associated with nonsingular G

G

-spaces. We deduce that any two boundary representations of a hyperbolic locally ...

WILEY2023

A full characterization of invariant embeddability of unimodular planar graphs

Graph Chatbot

Chat with Graph Search

Acceleration of graph pattern mining and applications to financial crime

Frequent asymmetric migrations suppress natural selection in spatially structured populations

Brain Fingerprinting Using Fmri Spectral Signatures On High-Resolution Cortical Graphs

DiGress: Discrete Denoising diffusion for graph generation

A type I conjecture and boundary representations of hyperbolic groups

Hyperbolic representations of PU(1,n)

Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

A type I conjecture and boundary representations of hyperbolic groups

Hyperbolic representations of PU(1,n)

Acceleration of graph pattern mining and applications to financial crime

DiGress: Discrete Denoising diffusion for graph generation

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

Frequent asymmetric migrations suppress natural selection in spatially structured populations

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Brain Fingerprinting Using Fmri Spectral Signatures On High-Resolution Cortical Graphs

Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks