搜索结果: 1-10 共查到“概率论 graph”相关记录10条 . 查询时间(0.031 秒)
This paper studies the formation of risk-sharing networks through costly social
investments, identifying endogenous inequality and a misallocation of resources as possible
downsides to such agreemen...
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
Markov connected graph edge tags transition rates
2015/7/8
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution ...
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS
Figure restrictions and can exchange random graph
2015/7/8
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS。
UNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS
Limit theorem the monochromatic edge evenly random colors random graph
2015/7/7
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. The limit theorems are universal depending solely on the limiting behavior ...
Weights and degrees in a random graph model based on 3-interactions
Martingale random graph preferential attachment scale-free property
2012/6/19
In a random graph model based on 3-interactions we give the joint asymptotic distribution of weights and degrees and prove scale-free property for the model. Moreover, we determine the asymptotics of ...
Abstract: Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presenc...
The component sizes of a critical random graph with pre-described degree sequence
Critical random graph random multigraph with given vertex degrees
2011/1/20
Consider a critical random multigraph Gn constructed by the con guration model such that its vertex degrees are independent random variables with the same distribution (criticality means that the se...
Giant vacant component left by a random walk in a random d-regular graph
Random walk vacant set regular graph expanders random interlacement
2011/2/25
We study the trajectory of a simple random walk on a d-regular graph with d ≥ 3 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular grap...
Markov processes on the path space of the Gelfand-Tsetlin graph and on its boundary
Markov processes Gelfand-Tsetlin graph boundary
2010/12/3
We construct a four-parameter family of Markov processes on infinite Gelfand-Tsetlin schemes that preserve the class of central (Gibbs) measures. Any process in the family induces a Feller Markov proc...
Quasi-randomness of graph balanced cut properties
Quasi-randomness graph balanced cut properties
2010/12/6
Quasi-random graphs can be informally described as graphs whose edge distribution closely
resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster
proved the fol...