東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Statistical Topology of Embedded Graphs.

Schweinhart, Benjamin.

FindBook

Google Book

Amazon

博客來

Statistical Topology of Embedded Graphs.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Statistical Topology of Embedded Graphs./
作者:	Schweinhart, Benjamin.
面頁冊數:	138 p.
附註:	Source: Dissertation Abstracts International, Volume: 77-03(E), Section: B.
Contained By:	Dissertation Abstracts International77-03B(E).
標題:	Applied mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3729732
ISBN:	9781339156866

Statistical Topology of Embedded Graphs.
Schweinhart, Benjamin.

Statistical Topology of Embedded Graphs. - 138 p.

Source: Dissertation Abstracts International, Volume: 77-03(E), Section: B.

Thesis (Ph.D.)--Princeton University, 2015.

Complex systems with interesting topology and geometry abound in the physical and mathematical sciences. This thesis explores several methods for their analysis, namely swatches, persistent homology, and the knotting of embedded graphs. We begin by describing curvature flow on embedded graphs, and methods for simulating it in two and three dimensions. This complex system will serve as a case study for the remainder of the thesis.

ISBN: 9781339156866Subjects--Topical Terms:

2122814
Applied mathematics.

Statistical Topology of Embedded Graphs.
LDR:02468nmm a2200313 4500 001 2073367
005 20160915132432.5
008 170521s2015 ||||||||||||||||| ||eng d
020 $a 9781339156866
035 $a (MiAaPQ)AAI3729732
035 $a AAI3729732
040 $a MiAaPQ $c MiAaPQ
100 1 $a Schweinhart, Benjamin. $3 3188603
245 1 0 $a Statistical Topology of Embedded Graphs.
300 $a 138 p.
500 $a Source: Dissertation Abstracts International, Volume: 77-03(E), Section: B.
500 $a Adviser: Robert D. MacPherson.
502 $a Thesis (Ph.D.)--Princeton University, 2015.
520 $a Complex systems with interesting topology and geometry abound in the physical and mathematical sciences. This thesis explores several methods for their analysis, namely swatches, persistent homology, and the knotting of embedded graphs. We begin by describing curvature flow on embedded graphs, and methods for simulating it in two and three dimensions. This complex system will serve as a case study for the remainder of the thesis.
520 $a The method of swatches characterizes the local topology of a regular cell complex in terms of probability distributions of local configurations. It is used to define a distance on cell complexes, which has many applications. Convergence in this distance is related to the concept of a Benjamini-Schramm graph limit, and we use it to formalize a universality conjecture about the long-term behavior of curvature-flow on graphs.
520 $a Persistent homology is a powerful tool for studying complex geometric structures. It establishes a correspondence between geometric features of a subset of a metric space and topological features of its epsilon-neighborhoods. This correspondence is represented by a scatter plot of feature points, which may be used to define many interesting statistics including an analogue of fractal dimension. We also describe a tree structure for the (n -- 1)-dimensional persistent homology of a subset of n-dimensional space, and apply it to compare two types of embedded graphs.
520 $a We conclude by proposing a definition for unknotted embedded graphs, and examining the relationship between curvature flow and knottedness in graphs.
590 $a School code: 0181.
650 4 $a Applied mathematics. $3 2122814
650 4 $a Theoretical mathematics. $3 3173530
690 $a 0364
690 $a 0642
710 2 $a Princeton University. $b Mathematics. $3 2049791
773 0 $t Dissertation Abstracts International $g 77-03B(E).
790 $a 0181
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3729732