Publications related to A note on chromatic properties of threshold graphs

Thick points of the planar GFF are totally disconnected for all & gamma;=6 0*

We prove that the set of-y-thick points of a planar Gaussian free field (GFF) with Dirichlet boundary conditions is a.s. totally disconnected for all-y =6 0. Our proof relies on the coupling between a GFF and the nested CLE4. In particular, we show that th ...

INST MATHEMATICAL STATISTICS-IMS2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...

EPFL2023

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Mirjana Stojilovic, Guanglei Zhou

A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...

2023

Present design of the Steering Mirror Assembly (SMA) for ITER ECHUL

Timothy Goodman, René Chavan, Anastasia Xydou

In the ITER Tokamak, four Electron Cyclotron Heating Upper Launchers (ECHUL) are needed to control plasma instabilities at the rational surfaces, most importantly the q = 3/2 and q = 2/1 neoclassical tearing modes (NTMs). Each ECHUL is equipped with a set ...

ELSEVIER SCIENCE SA2023

State of the Art in Dense Monocular Non-Rigid 3D Reconstruction

Pascal Fua

3D reconstruction of deformable (or non-rigid) scenes from a set of monocular 2D image observations is a long-standing and actively researched area of computer vision and graphics. It is an ill-posed inverse problem, since-without additional prior assumpti ...

WILEY2023

Moments of the number of points in a bounded set for number field lattices

Maryna Viazovska, Vlad Serban, Nihar Prakash Gargava

We examine the moments of the number of lattice points in a fixed ball of volume

V

for lattices in Euclidean space which are modules over the ring of integers of a number field

K

. In particular, denoting by

ω_K

the number of roots of unity in

K

, we ...

arXiv2023

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Karl Aberer, Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên

Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories. Existing ...

ELSEVIER SCIENCE INC2023

Acceleration of graph pattern mining and applications to financial crime

Jovan Blanusa

Various forms of real-world data, such as social, financial, and biological networks, can berepresented using graphs. An efficient method of analysing this type of data is to extractsubgraph patterns, such as cliques, cycles, and motifs, from graphs. For i ...

EPFL2023

A full characterization of invariant embeddability of unimodular planar graphs

Laszlo Marton Toth

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

Maximum Independent Set: Self-Training through Dynamic Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

2023

A note on chromatic properties of threshold graphs

Graph Chatbot

Chat with Graph Search

Thick points of the planar GFF are totally disconnected for all & gamma;=6 0*

Results on Sparse Integer Programming and Geometric Independent Sets

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Present design of the Steering Mirror Assembly (SMA) for ITER ECHUL

State of the Art in Dense Monocular Non-Rigid 3D Reconstruction

Moments of the number of points in a bounded set for number field lattices

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Acceleration of graph pattern mining and applications to financial crime

A full characterization of invariant embeddability of unimodular planar graphs

Maximum Independent Set: Self-Training through Dynamic Programming

Thick points of the planar GFF are totally disconnected for all & gamma;=6 0*

Results on Sparse Integer Programming and Geometric Independent Sets

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Moments of the number of points in a bounded set for number field lattices

State of the Art in Dense Monocular Non-Rigid 3D Reconstruction

Acceleration of graph pattern mining and applications to financial crime

A full characterization of invariant embeddability of unimodular planar graphs

Present design of the Steering Mirror Assembly (SMA) for ITER ECHUL

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Maximum Independent Set: Self-Training through Dynamic Programming