O. Solé-Pi

activity

20222026

collaborators

Showing 2025Show all

3 papers · 1 filter

math.CO2025

Minor-excluded graphs and soficity

Oriol Solé-Pi

A random rooted graph is said to be sofic if it is the Benjamini-Schramm limit of a sequence of finite graphs. Given any finite graph $H$ , we prove that every one-ended, unimodular…

math.PR2025

Sharp threshold for network recovery from voter model dynamics

Hang Du, Seokmin Ha, Oriol Solé-Pi

We investigate the problem of recovering a latent directed Erdős-Rényi graph $G^{*} \sim G (n, p)$ from observations of discrete voter model trajectories on $G^{*}$ , where $n p$ g…

math.CO2025

On the crossing profile of rectilinear drawings of $K_{n}$

Isaac Chen, Oriol Solé-Pi

We introduce the \textit{crossing profile} of a drawing of a graph. This is a sequence of integers whose $(k + 1)^{th}$ entry counts the number of edges in the drawing which a…

Minor-excluded graphs and soficity

Sharp threshold for network recovery from voter model dynamics

On the crossing profile of rectilinear drawings of Kn​

On the crossing profile of rectilinear drawings of $K_{n}$