11 citations · 53 across the 29 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…
How many contacts can exist between oriented squares of various sizes?
Sean Dewar
A homothetic packing of squares is any set of various-size squares with the same orientation where no two squares have overlapping interiors. If all squares have the same size…
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…
Graph rigidity properties of Ramanujan graphs
Sebastian M. Cioabă, Sean Dewar, Georg Grasegger +1
A recent result of Cioabă, Dewar and Gu implies that any -regular Ramanujan graph with is globally rigid in . In this paper, we extend these results and…
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…
Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
Sean Dewar
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isom…