Publication
A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models
Publications associées (82)
Revisiting the General Identifiability Problem
Negar Kiyavash, Ehsan Mokhtarian, Yaroslav Kivva, Seyed Jalal Etesami
We revisit the problem of general identifiability originally introduced in [Lee et al., 2019] for causal inference and note that it is necessary to add positivity assumption of observational distribution to the original definition of the problem. We show t ...
2022Adaptive majority problems for restricted query graphs and for weighted sets
Abhishek Methuku, Balázs Keszegh
Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...
ELSEVIER2021Sequential metric dimension for random graphs
In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...
2021How Florist Apprentices Explore Bouquet Designs: Supporting Design Space Exploration for Vocational Students
Pierre Dillenbourg, Kevin Gonyop Kim, Catharine Regina Monika Maria Oertel Genannt Bierbach
Context: Exploring the design space is an important process in a design task. In this study, we considered design space exploration for the learners in vocational education and training (VET). The goal of the study was to investigate how they explore the d ...
2021Estimating an extreme Bayesian network via scalings
A recursive max-linear vector models causal dependence between its components by expressing each node variable as a max-linear function of its parental nodes in a directed acyclic graph and some exogenous innovation. Motivated by extreme value theory, inno ...
ELSEVIER INC2021The KDD 2021 Workshop on Causal Discovery (CD2021)
As a basic and effective tool for explanation, prediction and decision making, causal relationships have been utilized in almost all disciplines. Traditionally, causal relationships are identified by making use of interventions or randomized controlled exp ...
ASSOC COMPUTING MACHINERY2021Edge colorings of graphs without monochromatic stars
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph on n vertices may admit. Our results rely on an improved application of an ...
ELSEVIER2020Graph Laplacian Mixture Model
Pascal Frossard, Hermina Petric Maretic
Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in settings where all avai ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of Design Considerations, and Numerical Comparison
A major line of work in graph signal processing [2] during the past 10 years has been to design new transform methods that account for the underlying graph structure to identify and exploit structure in data residing on a connected, weighted, undirected gr ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Mneme: A Mobile Distributed Ledger
Boi Faltings, Sujit Prakash Gujar, Dimitrios Chatzopoulos
Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on device-to-device (D2D) ecosystems (e.g., crowdsensing). More sophisticated applications, like cryptocurrencies, need ...
IEEE2020