The Contact Process with Added Edges
نویسنده
چکیده
We show that the critical value for the contact process on a vertex-transitive graph G with finitely many edges added to it is the same as the critical value for the contact process on G. This gives a partial answer to a conjecture of Pemantle and Stacey.
منابع مشابه
The Critical Value of the Contact Process with Added and Removed Edges
We show that the critical value for the contact process on a vertex-transitive graph G with finitely many edges added and/or removed is the same as the critical value for the contact process on G. This gives a partial answer to a conjecture of Pemantle and Stacey.
متن کاملتحلیل ارتعاش آزاد سازههای شناور بسیار بزرگ دایرهای شکل به روش اجزاء محدود
Using finite element method, free vibration of very large circular floating structures is investigated based on the first order shear deformation theory. The very large floating structure is modeled as an elastic plate with free edges. The free vibration of a circular plate in contact with air (the dry plate) is investigated and the natural frequencies and mode shapes of the plate are determine...
متن کاملModeling of heat generations for different tool profiles in friction stir welding: study of tool geometry and contact conditions
In this work, improved heat generation models are developed for straight and tapered shoulder geometries with different tool pin profiles in friction stir welding. The models are developed considering the welding process as a combination of the pure sliding and the pure sticking conditions. From the results, the amount of heat generation is directly proportional to the number of edges in the pi...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملUsing an Evaluator Fixed Structure Learning Automata in Sampling of Social Networks
Social networks are streaming, diverse and include a wide range of edges so that continuously evolves over time and formed by the activities among users (such as tweets, emails, etc.), where each activity among its users, adds an edge to the network graph. Despite their popularities, the dynamicity and large size of most social networks make it difficult or impossible to study the entire networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004