19 citations · 76 across the 28 of their papers we have counts for
6 papers · 1 filter
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…
Rigidity of symmetric frameworks on the cylinder
Anthony Nixon, Bernd Schulze, Joseph Wall
A bar-joint framework is the combination of a finite simple graph and a placement . The framework is rigid if the only edge-length pr…
Global Rigidity of Line Constrained Frameworks
James Cruickshank, Fatemeh Mohammadi, Harshit J Motwani +2
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in . In our setting we allow multiple ver…
Universal Rigidity of Ladders on the line
Bryan Chen, Robert Connelly, Steven J. Gortler +2
In "Universal rigidity on the line, point orde" it is shown, answering a question of Jordán and Nguyen, that universal rigidity of a generic bar-joint framework in R^1 depends on m…
Uniquely realisable graphs in analytic normed planes
Sean Dewar, John Hewetson, Anthony Nixon
A bar-joint framework in the Euclidean space is globally rigid if it is the unique realisation, up to rigid congruences, of in with the ed…
Quotient graphs of symmetrically rigid frameworks
Sean Dewar, Georg Grasegger, Eleftherios Kastis +1
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in that admit some non-trivial s…