Determinantal random subgraphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2022

Determinantal random subgraphs


We define two natural families of determinantal random subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of components, the other by connected spanning subgraphs with fixed number of independent cycles. Each family generalizes the uniform spanning tree and the generating functions of these probability measures generalize the classical Kirchhoff and Symanzik polynomials. We emphasize the matroidal nature of this construction, as well as possible generalisations.
Fichier principal
Vignette du fichier
determinantal-random-subgraphs.pdf (788.17 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03899489 , version 1 (14-12-2022)



Adrien Kassel, Thierry Lévy. Determinantal random subgraphs. 2022. ⟨hal-03899489⟩
111 View
49 Download



Gmail Mastodon Facebook X LinkedIn More