Výsledky vyhledávání - "Clemens, Jason"

Dissertation/ Thesis

Spanning tree modulus: deflation and a hierarchical graph structure

Autor: Clemens, Jason

Doctor of Philosophy
Department of Mathematics
Nathan Albin
The concept of discrete $p$-modulus provides a general framework for understanding arbitrary families of objects on a graph. The $p$-modulus provides a sense of ``structure''

Externí odkaz: http://hdl.handle.net/2097/39115

Zobrazit plný text záznamu

Report

Sobolev spaces

Autor: Clemens, Jason

Master of Science
Department of Mathematics
Marianne Korten
The goal for this paper is to present material from Gilbarg and Trudinger’s Elliptic Partial Differential Equations of Second Order chapter 7 on Sobolev spaces, in a manner

Externí odkaz: http://hdl.handle.net/2097/18186

Zobrazit plný text záznamu

Report

Fairest edge usage and minimum expected overlap for random spanning trees

Autor: Albin, Nathan, Clemens, Jason, Hoare, Derek, Poggi-Corradini, Pietro, Sit, Brandon, Tymochko, Sarah

Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize the edges as

Externí odkaz: http://arxiv.org/abs/1805.10112

Zobrazit plný text záznamu

Report

Blocking duality for $p$-modulus on networks and applications

Autor: Albin, Nathan, Clemens, Jason, Fernando, Nethali, Poggi-Corradini, Pietro

This paper explores the implications of blocking duality---pioneered by Fulkerson et al.---in the context of $p$-modulus on networks. Fulkerson's blocking duality is an analogue on networks to the method of conjugate families of curves in the plane.

Externí odkaz: http://arxiv.org/abs/1612.00435

Zobrazit plný text záznamu