UC Santa Barbara computer scientist Daniel Lokshtanov is advancing fundamental understanding of computational efficiency through groundbreaking research on quasi-polynomial time algorithms, supported ...

We define a latent structure random graph as a random dot product graph (RDPG) in which the latent position distribution incorporates both probabilistic and geometric constraints, delineated by a ...

A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes ...