10 citations · 30 across the 19 of their papers we have counts for
27 papers
Matroid lifts and representability
Daniel Irving Bernstein, Zach Walsh
A 1965 result of Crapo shows that every elementary lift of a matroid can be constructed from a linear class of circuits of . In a recent paper, Walsh generalized this constr…
Maximum likelihood thresholds of generic linear concentration models
Daniel Irving Bernstein, Steven J. Gortler, Louis Theran
The maximum likelihood threshold of a statistical model is the minimum number of datapoints required to fit the model via maximum likelihood estimation. In this paper we determine…
Computing maximum likelihood thresholds using graph rigidity
Daniel Irving Bernstein, Sean Dewar, Steven J. Gortler +3
The maximum likelihood threshold (MLT) of a graph is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding…
is fully reconstructible in
Daniel Irving Bernstein, Steven J. Gortler
A graph is fully reconstructible in if the graph is determined from its -dimensional measurement variety. The full reconstructibility problem has been solved…
Maximum likelihood thresholds via graph rigidity
Daniel Irving Bernstein, Sean Dewar, Steven J. Gortler +3
The maximum likelihood threshold (MLT) of a graph is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding…
Generic symmetry-forced infinitesimal rigidity: translations and rotations
Daniel Irving Bernstein
We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists o…