arXiv Analytics

Sign in

arXiv:1512.08479 [math.PR]AbstractReferencesReviewsResources

Invariance, quasi-invariance and unimodularity for random graphs

Vadim A. Kaimanovich

Published 2015-12-28Version 1

We interpret the probabilistic notion of unimodularity for measures on the space of rooted locally finite connected graphs in terms of the theory of measured equivalence relations. It turns out that the right framework for this consists in considering quasi-invariant (rather than just invariant) measures with respect to the root moving equivalence relation. We define a natural modular cocycle of this equivalence relation, and show that unimodular measures are precisely those quasi-invariant measures whose Radon--Nikodym cocycle coincides with the modular cocycle. This embeds the notion of unimodularity into the very general dynamical scheme of constructing and studying measures with a prescribed Radon--Nikodym cocycle.

Journal: Russian version: Zapiski Nauchnykh Seminarov POMI, vol. 441 (2015), 210-238
Categories: math.PR, math.DS
Related articles: Most relevant | Search more
arXiv:2007.15574 [math.PR] (Published 2020-07-30)
On the modularity of 3-regular random graphs and random graphs with given degree sequences
arXiv:1611.10167 [math.PR] (Published 2016-11-30)
Thresholds for contagious sets in random graphs
arXiv:2205.03551 [math.PR] (Published 2022-05-07)
Subcritical epidemics on random graphs