کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10997879 1342646 2018 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Locality of connective constants
ترجمه فارسی عنوان
محل ثابت ثابت
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی
The connective constant μ(G) of a quasi-transitive graph G is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin (and a further condition is satisfied). The proof is based on a generalized bridge decomposition of self-avoiding walks, which is valid subject to the assumption that the underlying graph is quasi-transitive and possesses a so-called unimodular graph height function.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 341, Issue 12, December 2018, Pages 3483-3497
نویسندگان
, ,