2 citations · 2 across the 3 of their papers we have counts for
4 papers
Cascade Surviving Cores via Local Limits
Souvik Dhara, Manish Pandey, Leonard J. Schulman
We consider a general class of cascading processes on marked networks, in which vertices are iteratively deleted according to a local vertex property. Under marked local-weak conve…
Lower Bounds on the Size of Markov Equivalence Classes
Erik Jahn, Frederick Eberhardt, Leonard J. Schulman
Causal discovery algorithms typically recover causal graphs only up to their Markov equivalence classes unless additional parametric assumptions are made. The sizes of these equiva…
Causal Identification in Time Series Models
Erik Jahn, Karthik Karnik, Leonard J. Schulman
In this paper, we analyze the applicability of the Causal Identification algorithm to causal time series graphs with latent confounders. Since these graphs extend over infinitely m…
The Symmetric Group Defies Strong Fourier Sampling: Part I
Cristopher Moore, Alexander Russell, Leonard J. Schulman
We resolve the question of whether Fourier sampling can efficiently solve the hidden subgroup problem. Specifically, we show that the hidden subgroup problem over the symmetric gro…