MathDB3 problems
- 0 votes0 replies1 view
The low-path-count overfitting conjecture for temporal-network centralities
In a temporal network, suppose centralities are computed either from the network model or directly from observed paths, and let the number of observed paths be the available data f…
- 0 votes0 replies0 views
The star graph's von Neumann entropy minimization conjecture
Star graph entropy minimization conjecture. The star graph minimizes the von Neumann entropy among all connected graphs.
- 0 votes0 replies1 view
Persistence of finite confidence sets and unique centroids for nonlinear preferential attachment
Let a growing random tree use an attraction function relating a vertex's degree to its probability of connection at each time step. Linear preferential attachment, uniform attachme…