Concept

Centralité

Publications associées (102)

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

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in r ...

New York2023

Motif Cut Sparsifiers

Mikhail Kapralov, Mikhail Makarov, Jakab Tardos

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

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Ralf Seifert, Anna Timonina-Farkas

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

INFORMS2022

ECCE: Entity-centric Corpus Exploration Using Contextual Implicit Networks

Maud Ehrmann, Matteo Romanello, Andreas Oliver Spitz

In the Digital Age, the analysis and exploration of unstructured document collections is of central importance to members of investigative professions, whether they might be scholars, journalists, paralegals, or analysts. In many of their domains, entities ...

ACM Digital Press2022

Evaluation of Drainage Phase Diagram for PEM Fuel Cell Porous Layer

Mahbod Heidari

The drainage process in the gas diffusion layer (GDL) of proton exchange membrane (PEM) fuel cells is investigated with an ex situ experimental approach. The drainage process is investigated for stable displacement, capillary fingering, and viscous fingeri ...

IEEE2021

Generation of elastic geodesic gridshells with anisotropic cross sections

Corentin Jean Dominique Fivet, Nicolas Robin Montagne, Olivier Baverel

Geodesic gridshells are shell structures made of continuous elements following geodesic lines. Their properties ease the use of beams with anisotropic cross-sections by avoiding bending about their strong axis. However, such bending may arise when flatteni ...

2021

Switchover phenomenon induced by epidemic seeding on geometric networks

Gergely Odor

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the id ...

2021

Scale-dependent measure of network centrality from diffusion dynamics

Alexis Arnaudon

Classic measures of graph centrality capture distinct aspects of node importance, from the local (e.g., degree) to the global (e.g., closeness). Here we exploit the connection between diffusion and geometry to introduce a multiscale centrality measure. A n ...

AMER PHYSICAL SOC2020

Simplicity in complex networks: a path-based centrality

Nikolaos Geroliminis, Leonardo Bellocchi

Understanding travel behaviour in transportation system is key challenge to calibrate and simulate the usage of urban mobility networks. We define in this work a path-based centrality based on the simplicity of the path between two locations in road networ ...

2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search