{"id":{"repo_id":"rice","oai_identifier":"oai:repository.rice.edu:1911/96173"},"canonical_url":"https://search.dev.ndltd.org/etd/rice/oai:repository.rice.edu:1911/96173","repository":{"repo_id":"rice","name":"Rice University","base_url":"https://repository.rice.edu/server/oai/request"},"display":{"title":"A Mass Minimizing Flow for Real-Valued Flat Chains with Applications to Transport Networks","abstract":"An oriented transportation network can be modeled by a 1-dimensional chain whose boundary is the difference between the demand and supply distributions, represented by weighted sums of point masses. To accommodate efficiencies of scale into the model, one uses a suitable Mα norm for transportation cost. One then finds that the minimal cost network has a branching structure since the norm favors higher multiplicity edges, representing shared transport. In this thesis, we construct a continuous flow that evolves some initial such network to reduce transport cost without altering its supply and demand distributions. Instead of limiting our scope to transport networks, we construct this M^α mass reducing flow for real-valued flat chains by finding a real current of locally finite mass with the property that its restrictions are flat chains; the slices of such a restriction dictate the flow. Keeping the boundary fixed, this flow reduces the M^α mass of the initial chain and is Lipschitz continuous under the flat-α norm. To complete the thesis, we apply this flow to transportation networks, showing that the flow indeed evolves branching transport networks to be more cost efficient.","abstract_html":"An oriented transportation network can be modeled by a 1-dimensional chain whose boundary is the difference between the demand and supply distributions, represented by weighted sums of point masses. To accommodate efficiencies of scale into the model, one uses a suitable Mα norm for transportation cost. One then finds that the minimal cost network has a branching structure since the norm favors higher multiplicity edges, representing shared transport. In this thesis, we construct a continuous flow that evolves some initial such network to reduce transport cost without altering its supply and demand distributions. Instead of limiting our scope to transport networks, we construct this M^α mass reducing flow for real-valued flat chains by finding a real current of locally finite mass with the property that its restrictions are flat chains; the slices of such a restriction dictate the flow. Keeping the boundary fixed, this flow reduces the M^α mass of the initial chain and is Lipschitz continuous under the flat-α norm. To complete the thesis, we apply this flow to transportation networks, showing that the flow indeed evolves branching transport networks to be more cost efficient.","abstract_has_math":false,"creators":["Downes, Carol Ann"],"institution":"Rice University","degree_name":"Doctor of Philosophy","degree_level":"Doctoral","degree_discipline":"Natural Sciences","degree_department":null,"school":null,"contributors":[],"advisors":["Hardt, Robert"],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-04-21","date_published":"2017-04-21","updated_at":"2026-07-24T04:10:36Z","subjects":["Geometric Measure Theory","Geometric Flows","Optimal Transport Theory"],"languages":["eng"],"rights":["Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1911/96173","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hardt, Robert"]},{"key":"dc:creator","label":"Author","values":["Downes, Carol Ann"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-08-02T14:52:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-08-02T14:52:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2017-04-21"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Natural Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Rice University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Geometric Measure Theory","Geometric Flows","Optimal Transport Theory"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1911/96173"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["An oriented transportation network can be modeled by a 1-dimensional chain whose boundary is the difference between the demand and supply distributions, represented by weighted sums of point masses. To accommodate efficiencies of scale into the model, one uses a suitable Mα norm for transportation cost. One then finds that the minimal cost network has a branching structure since the norm favors higher multiplicity edges, representing shared transport. In this thesis, we construct a continuous flow that evolves some initial such network to reduce transport cost without altering its supply and demand distributions. Instead of limiting our scope to transport networks, we construct this M^α mass reducing flow for real-valued flat chains by finding a real current of locally finite mass with the property that its restrictions are flat chains; the slices of such a restriction dictate the flow. Keeping the boundary fixed, this flow reduces the M^α mass of the initial chain and is Lipschitz continuous under the flat-α norm. To complete the thesis, we apply this flow to transportation networks, showing that the flow indeed evolves branching transport networks to be more cost efficient."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A Mass Minimizing Flow for Real-Valued Flat Chains with Applications to Transport Networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hardt, Robert"],"dc:creator":["Downes, Carol Ann"],"dc:date.accessioned":["2017-08-02T14:52:35Z"],"dc:date.available":["2017-08-02T14:52:35Z"],"dc:date.issued":["2017-04-21"],"dc:description.abstract":["An oriented transportation network can be modeled by a 1-dimensional chain whose boundary is the difference between the demand and supply distributions, represented by weighted sums of point masses. To accommodate efficiencies of scale into the model, one uses a suitable Mα norm for transportation cost. One then finds that the minimal cost network has a branching structure since the norm favors higher multiplicity edges, representing shared transport. In this thesis, we construct a continuous flow that evolves some initial such network to reduce transport cost without altering its supply and demand distributions. Instead of limiting our scope to transport networks, we construct this M^α mass reducing flow for real-valued flat chains by finding a real current of locally finite mass with the property that its restrictions are flat chains; the slices of such a restriction dictate the flow. Keeping the boundary fixed, this flow reduces the M^α mass of the initial chain and is Lipschitz continuous under the flat-α norm. To complete the thesis, we apply this flow to transportation networks, showing that the flow indeed evolves branching transport networks to be more cost efficient."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["https://hdl.handle.net/1911/96173"],"dc:language.iso":["eng"],"dc:rights":["Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder."],"dc:subject":["Geometric Measure Theory","Geometric Flows","Optimal Transport Theory"],"dc:title":["A Mass Minimizing Flow for Real-Valued Flat Chains with Applications to Transport Networks"],"dc:type":["Thesis"],"thesis:degree_discipline":["Natural Sciences"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["Rice University"]},"updated_at":"2026-07-24T04:10:36Z"}