数据库管理期刊(JDM)发布关于数据库管理、系统分析和设计以及软件工程的各个方面的原创性研究。JDM的主要任务是帮助改进和发展与信息技术和信息资源管理有关的理论和实践。该期刊既面向学术研究人员,又面向实践IT专业人士。 官网地址:https://dblp.uni-trier.de/db/journals/jdm/

最新论文

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 Carlo (MCMC) algorithm in the space of all balanced realizations of an {\em arbitrary} graphical JDM mixes rapidly, i.e., the relaxation time of the chain is bounded from above by a polynomial in the number of nodes $n$. To prove fast mixing, we first prove a general factorization theorem similar to the Martin-Randall method for disjoint decompositions (partitions). This theorem can be used to bound from below the spectral gap with the help of fast mixing subchains within every partition and a bound on an auxiliary Markov chain between the partitions. Our proof of the general factorization theorem is direct and uses conductance based methods (Cheeger inequality).

0
0
下载
预览
Top