3 citations · 5 across the 2 of their papers we have counts for
3 papers
math.CO2013
On Weak Limits and Unimodular Measures
Igor Artemenko
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed b…
math.CO2012★ 2 cited
Graphings and Unimodularity
Igor Artemenko
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By do…
math.CO2011★ 3 cited
Weak Convergence of Laws of Finite Graphs
Igor Artemenko
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, whic…