Johns Hopkins Whiting School of Engineering
  • Home
  • Register
  • Schedule
  • Past Events

Expected Survival Time of a Probabilistic Counting-out Game on a Line

Introduction  There are n people in a line at positions 1, 2,…, ?. For each round, we randomly select a person at position ?, where7? is odd, to leave the line, and shift the people at position ? such7that ? >? to position (? − 1). Authors Tingting OuMichelle...

Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices

A subset of the efficient dominating set on the (4^4) Z-stacked lattice Introduction On a graph, a vertex v dominates vertex ?′ if v=?′ or ? is adjacent to ?′. An efficient dominating set of a graph is a subset of the graph’s vertices D such that every vertex in the...


Stay Connected

  • Follow
  • Follow
  • Follow
  • Follow
  • Follow

Privacy Statement – Accessibility – University Policies – Copyright Compliance Policy

2021 Johns Hopkins University. All rights reserved.