4 problems
- 0 votes0 replies0 views
Signed-graphex coupling conjecture
Let be signed graphexes on sigma-finite Borel spaces, let everywhere, and suppose that the weak kernel distance satisf…
- 0 votes0 replies0 views
Signed-graphex identification conjecture
Let be signed graphexes, and let the weak kernel metric identify graphexes up to its equivalence relation. For a signed graphex , write…
- 0 votes0 replies0 views
The common-pullback characterization of graphex equivalence
Let two graphexes be equivalent when they generate the same random graph process in law, and let a pullback be the graphex obtained by composing its components with a measurable ma…
- 0 votes0 replies0 views
Non-equivalence of cut-metric and graphex convergence
Let integrable graphons be equipped with the metrics and , and let and denote the convergen…