Quasi-Stationary Distributions for the Voter Model on Complete Bipartite Graphs

نویسندگان

چکیده

We consider the discrete-time voter model on complete bipartite graphs and study quasi-stationary distribution (QSD) for as size of one partitions tends to infinity while other partition remains fixed. show that QSDs converge weakly a nontrivial limit which features consensus with exception random number dissenting vertices in large partition. Moreover, we explicitly calculate law dissenters it follows heavy-tailed Sibuya parameter depending small Our results rely analogue well-known duality between continuous-time coalescing walks develop paper.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

-Approximation for Quasi-Bipartite Graphs

Let G = (V, E) be an undirected simple graph and w : E 7→ IR+ be a non-negative weighting of the edges of G. Assume V is partitioned as R ∪ X . A Steiner tree is any tree T of G such that every node in R is incident with at least one edge of T . The metric Steiner tree problem asks for a Steiner tree of minimum weight, given that w is a metric. When X is a stable set of G, then (G, R, X) is cal...

متن کامل

Quasi-stationary distributions

This paper contains a survey of results related to quasi-stationary distributions, which arise in the setting of stochastic dynamical systems that eventually evanesce, and which may be useful in describing the long-term behaviour of such systems before evanescence. We are concerned mainly with continuous-time Markov chains over a finite or countably infinite state space, since these processes m...

متن کامل

Quasi-stationary distributions as centrality measures of reducible graphs

Random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank the problem was solved by introduction of uniform random jumps with some probability. Up to the present, there is no clear criterion for the choice this parameter. We propos...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ALEA-Latin American Journal of Probability and Mathematical Statistics

سال: 2021

ISSN: ['1980-0436']

DOI: https://doi.org/10.30757/alea.v18-19