SearcharxivSearch

arXiv subjects

Bohao Yao

Publications and source records attributed to Bohao Yao.

3 recordsLinked to original sources

Regression Identifiability and Edge Interventions in Linear Structural Equation Models

In this paper, we introduce a new identifiability criteria for linear structural equation models, which we call regression identifiability. We provide necessary and sufficient graphical conditions for a directed edge to be regression identifiable. Suppose $Σ^*$ corresponds to the covariance matrix of the graphical model $G^*$ obtained by performing an edge intervention to $G$ with corresponding covariance matrix $Σ$. We first obtain necessary and sufficient conditions for $Σ^*$ to be identifiable given $Σ$. Using regression identifiability, we obtain necessary graphical conditions for $Σ^*$ to be identifiable given $Σ$. We also identify what would happen to an individual data point if there were such an intervention. Finally, we provide some statistical problems where our methods could be used, such as finding constraints and simulating interventional data from observational data.

math.ST

Algebraic Properties of Gaussian HTC-identifiable Graphs

In this paper, we explore some algebraic properties of linear structural equation modelsthat can be represented by an HTC-identifiable graph. In particular, we prove that all mixedgraphs are HTC-identifiable if and only if all the regression coefficients can be recovered fromthe covariance matrix using straightforward linear algebra operations. We also find a set ofpolynomials that generates the ideal that encompasses all the equality constraints of the modelon the cone of positive definite matrices. We further prove that this set of polynomials are theminimal generators of said ideal for a subset of HTC-identifiable graphs.

math.ST

An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs

We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding Hamiltonian cycles in cubic planar graphs. The worst case time complexity of our algorithm is O$(2^n)$.

math.CO