Publications associées à Growing a Graph Matching from a Handful of Seeds

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

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

MDPI2024

Pyroresistive response of percolating conductive polymer composites

Claudio Grimaldi

The pyroresistive response of conductive polymer composites (CPCs) has attracted much interest because of its potential applications in many electronic devices requiring a significant responsiveness to changes in external physical parameters such as temper ...

Amer Physical Soc2024

Molecular hypergraph neural networks

Philippe Schwaller, Junwu Chen

Graph neural networks (GNNs) have demonstrated promising performance across various chemistry-related tasks. However, conventional graphs only model the pairwise connectivity in molecules, failing to adequately represent higher order connections, such as m ...

Aip Publishing2024

Fast and Future: Towards Efficient Forecasting in Video Semantic Segmentation

Evann Pierre Guy Courdier

Deep learning has revolutionized the field of computer vision, a success largely attributable to the growing size of models, datasets, and computational power. Simultaneously, a critical pain point arises as several computer vision applications are deploye ...

EPFL2024

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

Matteo Raviola

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

Cambridge Univ Press2024

Primary and secondary order parameters in the fully frustrated transverse-field Ising model on the square lattice

Frédéric Mila

Using quantum Monte Carlo simulations and field-theory arguments, we study the fully frustrated transversefield Ising model on the square lattice for the purpose of quantitatively relating two different order parameters to each other. We consider a "primar ...

Amer Physical Soc2024

THE PHASE TRANSITION FOR PLANAR GAUSSIAN PERCOLATION MODELS WITHOUT FKG

Alejandro Rivera

We develop techniques to study the phase transition for planar Gaussian percolation models that are not (necessarily) positively correlated. These models lack the property of positive associations (also known as the 'FKG inequality'), and hence many classi ...

Inst Mathematical Statistics-Ims2023

Percolation and phase behavior in cellulose nanocrystal suspensions from nonlinear rheological analysis

Tiffany Abitbol

We examine the influence of surface charge on the percolation, gel-point and phase behavior of cellulose nanocrystal (CNC) suspensions in relation to their nonlinear rheological material response. Desulfation decreases CNC surface charge density which lead ...

ELSEVIER SCI LTD2023

Metastability of the Potts Ferromagnet on Random Regular Graphs

Jean Bernoulli Ravelomanana

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

SPRINGER2023

Equivariant Neural Architectures for Representing and Generating Graphs

Clément Arthur Yvon Vignac

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

EPFL2023

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

Ali H. Sayed, Michele Cirillo

This work addresses the problem of learning the topology of a network from the signals emitted by the network nodes. These signals are generated over time through a linear diffusion process, where neighboring nodes exchange messages according to the underl ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

A continuum approximation approach to the depot location problem in a crowd-shipping system

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Equilibria in Network Constrained Energy Markets

Leonardo Massai

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

Elsevier2023

Modeling and Optimization of Ridesplitting Operations

Caio Vitor Beojone

Ridesourcing has driven a lot of attention in recent years with the expansion of companies like Uber, Lift, and many others around the world. Companies use mobile applications connected through the internet to match drivers and their passengers real-time. ...

EPFL2023

Eight-vertex criticality in the interacting Kitaev chain

Frédéric Mila, Natalia Chepiga

We show that including pairing and repulsion into the description of one-dimensional spinless fermions, as in the domain wall theory of commensurate melting or the interacting Kitaev chain, leads, for strong enough repulsion, to a line of critical points i ...

AMER PHYSICAL SOC2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

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

EPFL2023

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Thanh Trung Huynh

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

Privacy-Preserving Machine Learning on Graphs

Sina Sajadmanesh

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

EPFL2023

Network Alignment With Holistic Embeddings

Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Chi Thang Duong, Thanh Trung Huynh

Network alignment is the task of identifying topologically and semantically similar nodes across (two) different networks. It plays an important role in various applications ranging from social network analysis to bioinformatic network interactions. Howeve ...

IEEE COMPUTER SOC2023

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022