Publication

Network community-detection enhancement by proper weighting

Publications associées (30)

Graph signal processing tailored for subgraph focus and community structure

Community structure in graph-modeled data appears in a range of disciplines that comprise network science. Its importance relies on the influence it bears on other properties of graphs such as resilience, or prediction of missing connections. Nevertheless, ...

EPFL2022

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

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

De Gruyter2022

Explainability and Graph Learning From Social Interactions

Ali H. Sayed, Stefan Vlaski, Konstantinos Ntemos, Valentina Shumovskaia

Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of information among the ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

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

Akash Kumar

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

IEEE COMPUTER SOC2022

The micro-world of cographs

Dominique de Werra

Cographs constitute a small point in the atlas of graph classes. However, by zooming in on this point, we discover a complex world, where many parameters jump from finiteness to infinity. In the present paper, we identify several milestones in the world of ...

ELSEVIER2022

Applicability of the landscape evolution model in the absence of rills

David Andrew Barry, Paolo Perona, Seifeddine Jomaa, Andrea Rinaldo, Mohsen Cheraghi, Andrea Cimatoribus

Despite numerous applications of physically-based models for incised landscapes, their applicability for overland flow on unchanneled surfaces is not known. This work challenges a widely used landscape evolution model for the case of non-uniform rainfall a ...

2022

Motif Cut Sparsifiers

Mikhail Kapralov, Jakab Tardos, Mikhail Makarov

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

IEEE COMPUTER SOC2022

Graph Embedding for Retrieval

Chi Thang Duong

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

EPFL2022

Distributed Graph Learning With Smooth Data Priors

Pascal Frossard, Isabela Cunha Maia Nobre, Mireille El Gheche

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

IEEE2022

Graph Representation Learning with Optimal Transport: Analysis and Applications

Effrosyni Simou

In several machine learning settings, the data of interest are well described by graphs. Examples include data pertaining to transportation networks or social networks. Further, biological data, such as proteins or molecules, lend themselves well to graph- ...

EPFL2022