搜索结果: 1-15 共查到“Random graphs”相关记录32条 . 查询时间(0.072 秒)
HodgeRank on Random Graphs for Subjective Video Quality Assessment
Video Quality Assessment Paired Comparison HodgeRank Random Graphs Persistence Homology
2016/1/25
This paper introduces a novel framework, HodgeR-ank on Random Graphs (HRRG), based on paired comparison,for subjective video quality assessment. Two types of random graph models are studied, i.e., Erd...
HodgeRank on Random Graphs for Subjective Video Quality Assessment
Video Quality Assessment Paired Comparison HodgeRank Random Graphs Persistence Homology
2016/1/20
This paper introduces a novel framework, HodgeR-ank on Random Graphs (HRRG), based on paired comparison,for subjective video quality assessment. Two types of random graph models are studied, i.e., Erd...
Reconstruction for models on random graphs
Random variables algorithms the random sequence diagram
2015/8/21
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Several theoretical results (a...
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. ...
Gibbs Measures and Phase Transitions on Sparse Random Graphs
Random graphs Ising model Gibbs measures Phase transitions Spin models Local weak convergence
2015/8/20
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sp...
Mixing times for random walks on geometric random graphs
Random geometric random graph nodes wireless network model and threshold properties random walk figure d dimension
2015/8/11
A geometric random graph, G^d(n,r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each oth...
Mixing Times for Random Walks on Geometric Random Graphs
Mixing Times Random Walks Geometric Random Graphs
2015/7/10
A geometric random graph, G^d(n,r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each oth...
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS
Figure restrictions and can exchange random graph
2015/7/8
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS。
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES
Sequential sampling algorithms the random graph degree
2015/7/8
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES。
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE。
For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G) \geq b(G)$ for any $G$, and a classic result of Mantel from 1907...
Cover times for sequences of Markov chains on random graphs
Random walk Cover time Maximal hitting time Random graph
2012/6/15
We provide conditions that classify cover times for sequences of random walks on random graphs into two types: One type (type 1) is the class of cover times approximated by the maximal hitting times s...
On rainbow-k-connectivity of random graphs
Rainbow connectivity Random graph Graph algorithms Sharp threshold function Probabilistic method
2012/12/4
A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k 1, the rainbow-k-connectivity of a graph G, denoted by rck(G), is the minimum number of colors...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...
Abstract: A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the characters o...