Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
1 hits
in 72,227,055 documents
in 0.18 seconds
Please leave the following field blank:
Home
»
Search: Sebastian Maurice Carstens
Hit List
Hit list
1.
Percolation analysis of the twodimensional WidomRowlinson lattice model
Title:
Percolation analysis of the twodimensional WidomRowlinson lattice model
Author:
Carstens, Sebastian Maurice
Carstens, Sebastian Maurice
Minimize authors
Description:
We consider the twodimensional WidomRowlinson lattice model. This discrete spin model describes a surface on Which a one to one mixture of two gases is sprayed. These gases shall be strongly repelling on short distances. We indicate the amount of gas by a positive parameter, the so called activity. The main result of this thesis states that gi...
We consider the twodimensional WidomRowlinson lattice model. This discrete spin model describes a surface on Which a one to one mixture of two gases is sprayed. These gases shall be strongly repelling on short distances. We indicate the amount of gas by a positive parameter, the so called activity. The main result of this thesis states that given an activity larger than 2, there are at most two ergodic WidomRowlinson measures if the underlying graph is the star lattice. This falls naturally into two parts: The first part is quite general and establishes a new sufficient condition for the existence of at most two ergodic WidomRowlinson measures. This condition demands the existence of 1*lassos, i.e., 1*circuits 1*connected to the boundary, with probability bounded away from zero. Our approach is based upon the infinite cluster method. More precisely, we prevent the (co)existence of infinite clusters of certain types. To this end, we first have to improve the existing results in this direction, which will be done in a general setting for twodimensional dependent percolation. The second part is devoted to verify the sufficient condition of the first part for activities larger than 2. To this end, we have to compare the probabilities of configurations exhibiting 1*lassos to the ones exhibiting 0lassos. This will be done by constructing an injection that fills certain parts of 0circuits with 1spins and, hereby, forms a 1*lasso.
Minimize
Publisher:
LudwigMaximiliansUniversität München
Year of Publication:
20120601
Document Type:
Dissertation ; NonPeerReviewed
Subjects:
Fakultät für Mathematik ; Informatik und Statistik
Fakultät für Mathematik ; Informatik und Statistik
Minimize
DDC:
510 Mathematics
(computed)
Relations:
http://edoc.ub.unimuenchen.de/14534/
URL:
http://edoc.ub.unimuenchen.de/14534/1/Carstens_Sebastian_M.pdf
http://nbnresolving.de/urn:nbn:de:bvb:19145341
http://edoc.ub.unimuenchen.de/14534/1/Carstens_Sebastian_M.pdf
http://nbnresolving.de/urn:nbn:de:bvb:19145341
Minimize
Content Provider:
University of Munich: Digital theses
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
New Search »
Currently in BASE: 72,227,055 Documents of 3,466
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,227,055 Documents of 3,466 Content Sources
http://www.basesearch.net