Non-uniform random spanning trees on weighted graphs

被引：4
|
作者：
Mosbah, M [1 ]
Saheb, N [1 ]
机构：
[1] Univ Bordeaux 1, LABRI, CNRS, F-33405 Talence, France
来源：
THEORETICAL COMPUTER SCIENCE | 1999年 / 218卷 / 02期
关键词：
D O I：
10.1016/S0304-3975(98)00325-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study random walks on undirected graphs with weighted edges. Our main result shows that any spanning tree defined by the edges corresponding to a first visit of a vertex, appears with a probability proportional to its weight, which is the product of the weight of its edges. This provides an algorithm for generating non uniform random spanning trees in a weighted graph. The technique used here is based on linear equations over regular expressions and finite automata theory. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：263 / 271
页数：9
相关论文
共 50 条
  • [31] NON-RANDOM OR NON-UNIFORM
    KAISER, AB
    INFECTION CONTROL AND HOSPITAL EPIDEMIOLOGY, 1985, 6 (04): : 138 - 138
  • [32] Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns
    Foucart, Simon
    Needell, Deanna
    Pathak, Reese
    Plan, Yaniv
    Wootters, Mary
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (02) : 1264 - 1290
  • [33] The GHP scaling limit of uniform spanning trees of dense graphs
    Archer, Eleanor
    Shalev, Matan
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (01) : 149 - 190
  • [34] Weighted spanning trees on some self-similar graphs
    D'Angeli, Daniele
    Donno, Alfredo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [35] Heavy cycles and spanning trees with few leaves in weighted graphs
    Li, Binlong
    Zhang, Shenggui
    APPLIED MATHEMATICS LETTERS, 2011, 24 (06) : 908 - 910
  • [36] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
    Yue Liu
    Jing Huang
    Graphs and Combinatorics, 2009, 25 : 753 - 758
  • [37] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
    Liu, Yue
    Huang, Jing
    GRAPHS AND COMBINATORICS, 2009, 25 (05) : 753 - 758
  • [38] Coloring random 3-colorable graphs with non-uniform edge probabilities
    Brandes, Ulrik
    Lerner, Eirgen
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 202 - 213
  • [39] RANDOM-CLUSTER MEASURES AND UNIFORM SPANNING-TREES
    HAGGSTROM, O
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1995, 59 (02) : 267 - 275
  • [40] Optimal path and minimal spanning trees in random weighted networks
    Braunstein, Lidia A.
    Wu, Zhenhua
    Chen, Yiping
    Buldyrev, Sergey V.
    Kalisky, Tomer
    Sreenivasan, Sameet
    Cohen, Reuven
    Lopez, Eduardo
    Havlin, Shlomo
    Stanley, H. Eugene
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2007, 17 (07): : 2215 - 2255
12345