Dynamical dimer correlations at bipartite and non-bipartite Rokhsar-Kivelson points

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.

We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one com ...

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

Situational awareness strategies are essential for the reliable and secure operation of the electric power grid which represents critical infrastructure in modern society. With the rise of converter-interfaced renewable generation and the consequent shift ...

Modern power distribution systems are experiencing a large-scale integration of Converter-Interfaced Distributed Energy Resources (CIDERs). Their presence complicates the analysis and mitigation of harmonics, whose creation and propagation may be amplified ...

Disentangling electronic and thermal effects in photoexcited perovskite materials is crucial for photovoltaic and optoelectronic applications but remains a challenge due to their intertwined nature in both the time and energy domains. In this study, we emp ...

We study the statistical mechanics and the equilibrium dynamics of a system of classical Heisenberg spins with frustrated interactions on a d -dimensional simple hypercubic lattice, in the limit of infinite dimensionality d -> infinity . In the analysis we ...

Building replacement (BR) – i.e., the demolition of existing structures and subsequent construction of new buildings on the same site – is often understood as a necessary urban planning strategy despite significant environmental implications regarding soli ...

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

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

Graph machine learning offers a powerful framework with natural applications in scientific fields such as chemistry, biology and material sciences. By representing data as a graph, we encode the prior knowledge that the data is composed of a set of entiti ...

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

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

The corner transfer matrix renormalization group (CTMRG) algorithm has been extensively used to investigate both classical and quantum two-dimensional (2D) lattice models. The convergence of the algorithm can strongly vary from model to model depending on ...

We introduce the elliptical Ornstein-Uhlenbeck (OU) process, which is a generalisation of the well-known univariate OU process to bivariate time series. This process maps out elliptical stochastic oscillations over time in the complex plane, which are obse ...

We study experiment design for unique identification of the causal graph of a system where the graph may contain cycles. The presence of cycles in the structure introduces major challenges for experiment design as, unlike acyclic graphs, learning the skele ...

Resting-state fMRI has proven to entail subject-specific signatures that can serve as a fingerprint to identify individuals. Conventional methods are based on building a connectivity matrix based on correlation between the average time course of pairs of b ...

We study the performance of Markov chains for the q-state ferromagnetic Potts model on random regular graphs. While the cases of the grid and the complete graph are by now well-understood, the case of random regular graphs has resisted a detailed analysis ...

The adaptive social learning paradigm helps model how networked agents are able to form opinions on a state of nature and track its drifts in a changing environment. In this framework, the agents repeatedly update their beliefs based on private observation ...

Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-m ...

In this paper, we study the problem of learning Graph Neural Networks (GNNs) with Differential Privacy (DP). We propose a novel differentially private GNN based on Aggregation Perturbation (GAP), which adds stochastic noise to the GNN's aggregation functio ...

Dynamical dimer correlations at bipartite and non-bipartite Rokhsar-Kivelson points

Chat with Graph Search

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Functional-Basis Analysis of Non-Stationary Signals in Modern Power Grids: Theory and Implementation in Embedded Systems

Unified Harmonic Power-Flow and Stability Analysis of Power Grids with Converter-Interfaced Distributed Energy Resources

Disentangling Thermal from Electronic Contributions in the Spectral Response of Photoexcited Perovskite Materials

Frustrated magnets in the limit of infinite dimensions: Dynamics and disorder-free glass transition

Multiscale pattern analysis of building replacements in Zurich from 2000 to 2019

A full characterization of invariant embeddability of unimodular planar graphs

Maximum Independent Set: Self-Training through Dynamic Programming

Equivariant Neural Architectures for Representing and Generating Graphs

Acceleration of graph pattern mining and applications to financial crime

Results on Sparse Integer Programming and Geometric Independent Sets

Critical line of the triangular Ising antiferromagnet in a field from a C3-symmetric corner transfer matrix algorithm

The elliptical Ornstein-Uhlenbeck process

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

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

Metastability of the Potts Ferromagnet on Random Regular Graphs

Discovering Influencers in Opinion Formation Over Social Graphs

Privatized graph federated learning

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation