activity
20072026
most citedMetrics for Graph Comparison: A Practitioner's Guide

201 citations · 236 across the 12 of their papers we have counts for

collaborators

17 papers

math.PR2026

Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models

Connor Loehde-Woolard, François G. Meyer

We study the entropy of random graphs generated by piecewise Hölder continuous graphons. We first present a result on the rate of convergence of the normalized entropy as the size…

stat.ML2024

When does the mean network capture the topology of a sample of networks?

François G Meyer

The notion of Fréchet mean (also known as "barycenter") network is the workhorse of most machine learning algorithms that require the estimation of a "location" parameter to analys…

math.PR2022

Sharp Threshold for the Frechet Mean (or Median) of Inhomogeneous Erdos-Renyi Random Graphs

Francois G. Meyer

We address the following foundational question: what is the population, and sample, Frechet mean (or median) graph of an ensemble of inhomogeneous Erdos-Renyi random graphs? We pro…

stat.AP2019★ 201 cited

Metrics for Graph Comparison: A Practitioner's Guide

Peter Wills, Francois G. Meyer

Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network a…

cs.SI2017★ 2 cited

Detecting Topological Changes in Dynamic Community Networks

Peter Wills, Francois G. Meyer

The study of time-varying (dynamic) networks (graphs) is of fundamental importance for computer network analytics. Several methods have been proposed to detect the effect of signif…

q-bio.NC2017★ 1 cited

Decoding Epileptogenesis in a Reduced State Space

François G. Meyer, Alexander M. Benison, Zachariah Smith +1

We describe here the recent results of a multidisciplinary effort to design a biomarker that can actively and continuously decode the progressive changes in neuronal organization l…