| Project/Area Number |
23540155
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Tsuda College |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2013: ¥390,000 (Direct Cost: ¥300,000、Indirect Cost: ¥90,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | loop erased random walk / hitting matrix / ダイマー模型 / 全域木 |
|---|
| Research Abstract |
Perfect matchings on planar bipartite graphs have been extensively studied as the dimer models in statistical mechanics. Almost no results are known for the case in which the underlying graphs are non-bipartite. In this study, we investigate the perfect matchings on the graphs which can be obtained by adding some extra edges to
the planar bipartite graphs, such as square graphs and hexagonal graphs. Extra edges connecting nearest black(or white) vertices. Therefore the perfect matchings on such graphs can be considered as perfect matchings containing impurities in some sence.
Generalizing our own results which describes the models with only one, we obtained some results on the cases in which multiple impurities exist. But these results are limited when compared to the single impurity case.
|
