{"id":{"repo_id":"ku","oai_identifier":"oai:kuscholarworks.ku.edu:1808/37577"},"canonical_url":"https://search.dev.ndltd.org/etd/ku/oai:kuscholarworks.ku.edu:1808/37577","repository":{"repo_id":"ku","name":"University of Kansas","base_url":"https://kuscholarworks.ku.edu/server/oai/request"},"display":{"title":"Probabilistic Firefighting on the Integer Lattice","abstract":"In this paper we examine the firefighting problem of graph theory and extend results to setups where firefighters (and then fires) come according to random sequences of coin flips. To solve the problem, we find it helpful to extend firefighting to directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting.","abstract_html":"In this paper we examine the firefighting problem of graph theory and extend results to setups where firefighters (and then fires) come according to random sequences of coin flips. To solve the problem, we find it helpful to extend firefighting to directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting.","abstract_has_math":false,"creators":["Lambert, Isaac Edward"],"institution":"University of Kansas","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Schweig, Jay"],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-01-01","date_published":"2012-01-01","updated_at":"2026-07-24T02:45:07Z","subjects":["Mathematics"],"languages":["en"],"rights":["Copyright held by the author."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["http://dissertations.umi.com/ku:12363"],"render_values":[{"text":"http://dissertations.umi.com/ku:12363","href":"http://dissertations.umi.com/ku:12363","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/1808/37577","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Schweig, Jay"]},{"key":"dc:creator","label":"Author","values":["Lambert, Isaac Edward"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-04-15T15:07:58Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-04-15T15:07:58Z"]},{"key":"dc:date.issued","label":"Date","values":["2012-01-01"]},{"key":"dc:publisher","label":"Institution","values":["University of Kansas"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright held by the author."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["http://dissertations.umi.com/ku:12363"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1808/37577"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this paper we examine the firefighting problem of graph theory and extend results to setups where firefighters (and then fires) come according to random sequences of coin flips. To solve the problem, we find it helpful to extend firefighting to directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting."]},{"key":"dc:title","label":"Title","values":["Probabilistic Firefighting on the Integer Lattice"]}]}],"canonical_facts":{"dc:contributor.advisor":["Schweig, Jay"],"dc:creator":["Lambert, Isaac Edward"],"dc:date.accessioned":["2026-04-15T15:07:58Z"],"dc:date.available":["2026-04-15T15:07:58Z"],"dc:date.issued":["2012-01-01"],"dc:description.abstract":["In this paper we examine the firefighting problem of graph theory and extend results to setups where firefighters (and then fires) come according to random sequences of coin flips. To solve the problem, we find it helpful to extend firefighting to directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting."],"dc:identifier.other":["http://dissertations.umi.com/ku:12363"],"dc:identifier.uri":["https://hdl.handle.net/1808/37577"],"dc:language.iso":["en"],"dc:publisher":["University of Kansas"],"dc:rights":["Copyright held by the author."],"dc:subject":["Mathematics"],"dc:title":["Probabilistic Firefighting on the Integer Lattice"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T02:45:07Z"}