Ask a Librarian

Threre are lots of ways to contact a librarian. Choose what works best for you.

HOURS TODAY

11:00 am - 3:00 pm

Reference Desk

CONTACT US BY PHONE

(802) 656-2022

Voice

(802) 503-1703

Text

MAKE AN APPOINTMENT OR EMAIL A QUESTION

Schedule an Appointment

Meet with a librarian or subject specialist for in-depth help.

Email a Librarian

Submit a question for reply by e-mail.

WANT TO TALK TO SOMEONE RIGHT AWAY?

Library Hours for Friday, May 3rd

All of the hours for today can be found below. We look forward to seeing you in the library.
HOURS TODAY
8:00 am - 9:00 pm
MAIN LIBRARY

SEE ALL LIBRARY HOURS
WITHIN HOWE LIBRARY

MapsM-Th by appointment, email govdocs@uvm.edu

Media Services8:00 am - 4:30 pm

Reference Desk11:00 am - 3:00 pm

OTHER DEPARTMENTS

Special Collections10:00 am - 5:00 pm

Dana Health Sciences Library7:30 am - 6:00 pm

 

CATQuest

Search the UVM Libraries' collections

UVM Theses and Dissertations

Browse by Department
Format:
Online
Author:
Zhu, Damin
Dept./Program:
Mathematics and Statistics
Year:
2023
Degree:
Ph. D.
Abstract:
This dissertation consists of two studies. The first develops theory for a new method for estimating regression parameters using generalized estimating equations (GEE) with panel data prone to covariate measurement error. The focus is on logistic regression, though the method is applicable to other models. The method requires availability ofinstrumental variables (IV) to identify model parameters. Simulations are performed to assess the performance of the proposed estimator. The method, abbreviated GEEIV, is able to accurately estimate logistic regression parameters masked by measurement error in a variety of population configurations. In the second study, an algorithm is proposed to estimate the number of latent defective edges in large hypergraphs. The new statistical method combines the strength of sampling strategies and an existing algorithmic method known for efficient latent edge identification for small graphs. Our statistical approach strikes a balance between computational time consumption and estimation power, with the flexibility to adapt to several assumption violations. Simulations are performed on both synthetic data and a simulator loaded with US western grid structures. The new algorithm was able give unbiased estimates using relatively little computational time for the synthetic data for a wide range of combinations of graph sizes, defective graph edges and defective edge distributions. Simulation results from US western grid data agreed with a previous study on relatively small latent edge sets. On a large edge set, previous studies were not able to provide a reasonable estimate. The new algorithm was able to give estimates and confidence intervals for the larger problem.