عنوان

Smooth Selection Principles, Simplicial Complexes, and Everything In Between

شماره

TLpq2305192354

زبان متن نوشتاري يا گفتاري و مانند آن

انگلیسی

عنوان اصلي

Smooth Selection Principles, Simplicial Complexes, and Everything In Between

نام عام مواد

[Thesis]

نام نخستين پديدآور

Guillén Pegueroles, Bernat

نام ساير پديدآوران

Fefferman, Charles L.

نام ناشر، پخش کننده و غيره

Princeton University

تاریخ نشرو بخش و غیره

2019

نام خاص و کميت اثر

159

جزئيات پايان نامه و نوع درجه آن

Ph.D.

کسي که مدرک را اعطا کرده

Princeton University

امتياز متن

2019

متن يادداشت

This thesis is divided in three chapters, each of them completely self-contained, detailing the progress done in three projects. In the first chapter, we develop efficient algorithms for the approximate smooth selection principle, extending work previously done by Fefferman, Israel and Luli [Geometric and Functional Analysis 26.2 (2016): 422-477]. We present complete proof of correctness and efficiency. This is the longest (by far) chapter of the thesis and includes full technical details of the algorithms. We encourage the reader to read the pedagogic explanation of the algorithm in the introduction of the chapter. In the second chapter, we explore contagion and opinion dynamics on simplicial complexes, extending thus the theory of complex contagion. We present some analytical methods, computational algorithms and inference tools. The third chapter is fully experimental, and we study the effect of the shape of a domain on the solutions to competition-diffusion equations. It includes some work in progress on a software package to assist conservation ecologists in the design of conservation areas.

موضوع مستند نشده

Applied mathematics

موضوع مستند نشده

Ecology

موضوع مستند نشده

Statistics

مستند نام اشخاص تاييد نشده

Fefferman, Charles L.

مستند نام اشخاص تاييد نشده

Guillén Pegueroles, Bernat

نام الکترونيکي

فرمت انتشار

p

نوع ماده

[Thesis]

کد کاربرگه

276903

سطح دسترسي

a

تكميل شده

Y