Erin Meger

Erin Meger

Auto-generated profile, based on publicly available information

Erin Meger

School of Computing Queen's University Kingston ON

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 December 2021 in The Open/Technology in Education, Society, and Scholarship Association Journal
Verified
Journal Article
Open access
PDF file
EMErin Meger
Erin Meger
MSMichelle Schwartz
Michelle Schwartz
WFWendy Freeman
Wendy Freeman
This paper provides an analysis of interviews with seven faculty members who engaged in creating Open textbooks funded by government grants at a university in Canada in 2018. Using four values—access and equity, community and connection, agency and ownership, and risk and responsibility—identified by Sinkinson (2018), McAndrew (2018), and Keyek-Fransen (2018), we traced the ways in which university faculty members’ understanding of Open changed through the process of Open Educational Resource creation. As a teaching support-focused unit, we explore ways to provide our faculty and instructors with meaningful opportunities to develop their Open pedagogy. These findings reconceive the way that Open Educational Practice can be promoted at our University and others. Instead of focusing solely on OER creation, our faculty started engaging in thinking through the different conceptions of Open educational practice and identifying which concepts resonated with them. By reframing the ways in which faculty thought about Open Educational Practices, we have been better able to address the ways in which we support them.

3 May 2023 in La Matematica
Verified
Journal Article
Closed access
PDF file
DCD. Cox
D. Cox
EME. Meger
E. Meger
MMM. E. Messinger
M. E. Messinger

15 April 2023 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
PDPat Devlin
Pat Devlin
EMErin Meger
Erin Meger
ARAbigail Raz
Abigail Raz
PPPolymath Reu Participants
Polymath Reu Participants

16 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
CBChristopher Brice
Christopher Brice
EMErin Meger
Erin Meger
NNNhat-Dinh Nguyen
Nhat-Dinh Nguyen
ARAllen Rakhamimov
Allen Rakhamimov
ARAbigail Raz
Abigail Raz
Modeling how information travels throughout a network has vast applications across social sciences, cybersecurity, and graph-based neural networks. In this paper, we consider the zero forcing model for information diffusion on iterative deterministic complex network models. In particular, we continue the exploration of the Iterative Local Transitive (ILT) model and the Iterative Local Anti-Transitive (ILAT) model, both introduced by Bonato et. al. in 2009 and 2017, respectively. These models use ideas from Structural Balance Theory to generate edges through a notion of cloning where ``the friend of my friend is my friend'' and anticloning where ``the enemy of my enemy is my friend.'' Zero forcing, introduced independently by Burgarth and Giovanetti and a special working group at AIM in 2007 and 2008, begins with some set of forced vertices, the remaining are unforced. If a forced vertex has a single unforced neighbor, that neighbor becomes forced. The minimum number of vertices in a starting set required to guarantee all vertices eventually become forced is the zero forcing number of the graph. The maximum number of vertices in a starting set such that the graph cannot become fully forced is the failed zero forcing number of a graph. In this paper we provide bounds for both the zero forcing and failed zero forcing number of graphs created using both the ILT and ILAT models. In particular, we show that in the case of ILAT graphs the failed zero forcing number can only take on one of four values, dependent on the number of vertices of the graph. Finally, we briefly consider another information diffusion model, graph burning, on a more general iterated graph model.