2 problems
- 0 votes0 replies0 views
Conjecture on combining edges and node attributes across multiple correlated graphs
Consider a collection of multiple correlated graphs, possibly with node attributes, and suppose that their edge sets and node attributes can be combined. Multi-graph aggregation co…
- 0 votes0 replies0 views
Tight noise thresholds for root confidence sets in preferential and uniform attachment
Noise-threshold conjecture. For linear preferential attachment (LPA), corresponding to and , if , then