Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 14 July 2020Accepted: 30 August 2021Published online: 06 January 2022Keywordsgraph sampling, switch Markov chain, joint degree matrixAMS Subject Headings68Q25, 05C80, 68R10Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
منابع مشابه
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences
We show that the switch Markov chain for sampling simple undirected, as well as bipartite, graphs with a given degree sequence is rapidly mixing when the degree sequence is strongly stable. Strong stability is closely related to the notion of P-stability introduced by Jerrum and Sinclair (1990), and is satisfied by all degree sequences for which the switch chain is known to be rapidly mixing ba...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولA decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix
A joint degree matrix (JDM) specifies the number of connections between nodes of given degrees in a graph, for all degree pairs and uniquely determines the degree sequence of the graph. We consider the space of all balanced realizations of an arbitrary JDM, realizations in which the links between any two degree groups are placed as uniformly as possible. We prove that a swap Markov Chain Monte ...
متن کاملMarkov chain mixing and coupling
Recall from Lecture 2: Definition 0.1. Let S be a countable set and (X n) a sequence of random variables taking values in S. We say that (X n) is a Markov chain if it has the Markov property.
متن کاملRapid Mixing in Markov Chains
A wide class of "counting" problems have been studied in Computer Science. Three typical examples are the estimation of (i) the permanent of an n x n 0-1 matrix, (ii) the partition function of certain n— particle Statistical Mechanics systems and (iii) the volume of an n— dimensional convex set. These problems can be reduced to sampling from the steady state distribution of implicitly defined M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2022
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1352697