2 citations · 2 across the 13 of their papers we have counts for
4 papers · 1 filter
-Skewed Maximal Spanning Forests
Shirshendu Chatterjee, Yang Chen, Grigory Terlov
The Free -Maximal Spanning Forest (FMaxSF) is a weighted generalization of the classical Free Minimal Spanning Forest (FMSF) that is able to detect nonhyperfiniteness i…
Interface between competing random walks on a cycle
Shirshendu Chatterjee, Nadya Nabahi, Grigory Terlov
We consider a competition between two independent random walks on a cycle of length . Each vertex is claimed by the walker that visits it first, and remains claimed thereafter.…
Limiting distributions of triangle counts in linear preferential attachment models
Partha S. Dey, Grigory Terlov
We derive distributional approximations for the number of triangles in the linear preferential attachment model , where and , with explicit rates…
Whitney's 2-isomorphism theorem for graphings
Márton Borbényi, Grigory Terlov, László Márton Tóth
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. For locally finite graphings, we define a weak isomorphism to be an edge-measur…