Arriving and Convert Times in Hyper-networks
Journal Title: Scholars Journal of Physics, Mathematics and Statistics - Year 2014, Vol 1, Issue 2
Abstract
In hyper-networks, arriving time and the convert distance are used to measure the structure of hyper-graphs. For two vertices u and v, the arriving time is defined as the expected time for it takes a random walk to travel from u to v. The convert distance is a symmetrized version denoted as = + . In this article, we consider the characters of arriving times and convert distances when the number n of vertices in the hyper-networks tends to . We discuss random geometric hyper-graphs, such as -hyper-graphs, k-NN hyper-graphs and Gaussian similarity hyper-graphs, and the hyper-graphs with a given expected degree distribution or other special hyper-graphs structures. Several results on convergence are determined, and these illustrate the promising application prospects for hyper-networks algorithm.
Authors and Affiliations
Linli Zhu, Yun Gao, Wei Gao
Keywords
Related Articles
- EP ID EP383420
- DOI -
- Views 121
- Downloads 0
Positron-Impact Excitation of The Lowest Autoionizing State in Rubidium Atom Using Distorted Wave Method
Many calculations on atomic collisions and scattering processes have been performed on electron impact excitation of the lowest autoionizing state of rubidium, but not much attempt has been made with positron impact whic...
Improving the Qualities of Teaching Probability Theory and Statistics
Probability Theory and Statistics is one of the important and fundamental courses for all science and engineering students. In this paper, we consider how to enhance Probability Theory and Statistics teaching. Furthermor...
Forecasting Monthly Water Production in Gaza City Using a Seasonal ARIMA Model
This paper aimed to analyze seasonal time series data on monthly water production in the Gaza Strip during the period between 2006 and 2012 using the Box-Jenkins methodology. A model was proposed that could forecast futu...
How to prove the Riemann Hypothesis
I have already discovered a simple proof of the Riemann Hypothesis. The hypothesis states that the nontrivial zeros of the Riemann zeta function have real part equal to 0.5 . I assume that any such zero is s =a+ bi .I us...
Global Optimization and Filled Function Method
Traditional nonlinear programming method is only used to educe the local optimization but fails to successfully solve global optimization problem. Filled function method combines itself with local minimization algorithm...