arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0909.3344math.COmath.PR
收藏

关于随机几何有向图的度序列

On the Degree Sequence of Random Geometric Digraphs

Yilun Shang

摘要:

通过在$\mathbb{R}^2$中随机独立地取$\{X_1,X_2,... X_n\}$,构造了一个随机几何有向图$G_n$.每个顶点$X_i$在半径为$r$(以顶点$X_i$为原点)的圆中被随机分配具有中心角$α$和倾角$Y_i$的扇区$S_i$。如果$X_j$落在$S_i$中,则存在从顶点$X_i$到$X_j$的弧。假设$k$是固定的,并且$\{k_n\}$是具有$1\ll k_n\ll n^{1/2}$的序列,作为$n\to\infty$。我们证明了$G_n$中的出度和入度的$k-$和$k_n-$最近邻距离的中心极限定理。我们还表明,该模型的度分布,这与潜在的点过程的概率分布,可以是均匀的或非均匀的。我们的工作应该提供有价值的见解替代机制包装在现实世界的复杂网络。

英文摘要:

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle $α$ with inclination $Y_i$, in a circle of radius $r$ (with vertex $X_i$ as the origin). An arc is present from vertex $X_i$ to $X_j$, if $X_j$ falls in $S_i$. Suppose $k$ is fixed and $\{k_n\}$ is a sequence with $1\ll k_n\ll n^{1/2}$, as $n\to\infty$. We prove central limit theorems for $k-$ and $k_n-$nearest neighbor distance of out- and in-degrees in $G_n$. We also show that the degree distribution of this model, which varies with the probability distribution of the underlying point processes, can be either homogeneous or inhomogeneous. Our work should provide valuable insights for alternative mechanisms wrapped in real-world complex networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑