Belief Control Strategies for Interactions Over Weakly-Connected Graphs

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.

Collaborative Filtering (CF) is a crucial task in recommendation systems, aimed at predicting user preferences based on the behaviors and preferences of similar users. While traditional CF techniques have achieved significant success by learning low-dimens ...

A classical Turán problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph H as a subgraph. It is well-known that the chromatic number of H is the graph parameter which describes the asympto ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Water distribution systems (WDSs) are complex networks with numerous interconnected junctions and pipes. The robustness and reliability of these systems are critically dependent on their network structure, necessitating detailed analysis for proactive leak ...

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

Current transformer-based skeletal action recognition models tend to focus on a limited set of joints and low-level motion patterns to predict action classes. This results in significant performance degradation under small skeleton perturbations or changin ...

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

We present a statistical framework to benchmark the performance of reconstruction algorithms for linear inverse problems, in particular, neural-network-based methods that require large quantities of training data. We generate synthetic signals as realizati ...

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

Personal cloud, termed as the difference in air pollutant concentrations between breathing zone and room sites, represents the bias in approximating personal inhalation exposure that is linked to accuracy of health risk assessment. This study performed a t ...

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

Graph learning is often a necessary step in processing or representing structured data, when the underlying graph is not given explicitly. Graph learning is generally performed centrally with a full knowledge of the graph signals, namely the data that live ...

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

The International Committee on Intellectual Cooperation (ICIC) is often framed as a step in the constitution of a “League of Minds” – a place where scientists and writers reign, and a necessary part of a successful and harmonious “League of Nations” – but ...

Graph Neural Networks (GNNs) have emerged as a powerful tool for learning on graphs, demonstrating exceptional performance in various domains. However, as GNNs become increasingly popular, new challenges arise. One of the most pressing is the need to ensur ...

We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

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

The fundamental aspiration of new-generation high-performing buildings is to reduce energy use while securing indoor environmental quality conducive to human health and productivity. However, existing frameworks for identifying Key Performance Indicators ( ...

Belief Control Strategies for Interactions Over Weakly-Connected Graphs

Chat with Graph Search

High-Order Recommendation with Heterophilic Hypergraph Diffusion

Turán Problems for Oriented Graphs

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

Towards an Understanding of Hydraulic Sensitivity: Graph Theory Contributions to Water Distribution Analysis

Network-based kinetic models: Emergence of a statistical description of the graph topology

MaskCLR: Attention-Guided Contrastive Learning for Robust Action Representation Learning

Motif Cut Sparsifiers

A Statistical Framework to Investigate the Optimality of Signal-Reconstruction Methods

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

Human personal air pollution clouds in a naturally ventilated office during the COVID-19 pandemic

Data-driven and Safe Networked Control with Applications to Microgrids

Distributed Graph Learning With Smooth Data Priors

Discovering Influencers in Opinion Formation Over Social Graphs

The Paris/Geneva Divide. A Network Analysis of the Archives of the International Committee on Intellectual Cooperation of the League of Nations

Privacy-Preserving Machine Learning on Graphs

Unambiguous DNFs and Alon-Saks-Seymour

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Graph Embedding for Retrieval

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

Energy, SBS symptoms, and productivity in Swiss open-space offices: Economic evaluation of standard, actual, and optimum scenarios