Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
Semidefinite programming (SDP) problems are challenging to solve because of their high
dimensionality. However, solving sparse SDP problems with small tree-width are known to …
dimensionality. However, solving sparse SDP problems with small tree-width are known to …
On the tree-depth and tree-width in heterogeneous random graphs
Y Shang - 2022 - projecteuclid.org
In this note, we investigate the tree-depth and tree-width in a heterogeneous random graph
obtained by including each edge e_ij (i≠j) of a complete graph K_n over n vertices …
obtained by including each edge e_ij (i≠j) of a complete graph K_n over n vertices …
The emergence of a giant rainbow component
The random coloured graph $ G_c (n, p) $ is obtained from the Erd\H {o} sR\'{e} nyi binomial
random graph $ G (n, p) $ by assigning to each edge a colour from a set of $ c $ colours …
random graph $ G (n, p) $ by assigning to each edge a colour from a set of $ c $ colours …
Local treewidth of random and noisy graphs with applications to stopping contagion in networks
H Mehta, D Reichman - arXiv preprint arXiv:2204.07827, 2022 - arxiv.org
We study the notion of local treewidth in sparse random graphs: the maximum treewidth over
all $ k $-vertex subgraphs of an $ n $-vertex graph. When $ k $ is not too large, we give …
all $ k $-vertex subgraphs of an $ n $-vertex graph. When $ k $ is not too large, we give …