Showing stat.MEShow all
2 papers · 1 filter
stat.ME2026
Decorated graphons for temporal network estimation
Charles Dufour, Sofia C. Olhede
We propose a unified nonparametric framework for modeling time-evolving networks using decorated graphons (also known as probability-graphons): symmetric functions that assign to e…
stat.ME2024
Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks
Charles Dufour, Sofia C. Olhede
We introduce the first doubly non-parametric estimation method for decorated graphons, a generalisation of graphons that encodes edge weights, edge types, and other edge-level attr…