In this paper, we study some functional inequalities (such as Poincaré inequality, logarithmic Sobolev inequality, generalized Cheeger isoperimetric inequality, transportation-information inequality and transportation-entropy inequality) for reversible nearest-neighbor Markov processes on connected finite graphs by means of (random) path method. We provide estimates of the involved constants.

A vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P . In 1988 H. Broersma stated a result implying that every n-vertex kconnected graph G such that σ(k+2)(G) ≥ n− 2k − 1 contains a dominating path. We show that every n-vertex k-connected graph with σ2(G) ≥ 2n k+2 + f(k) contains a dominating path of length at most O(|T |), where T is a minimum do...

Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefits on performance have been recognized, an uneven overlay zone distribution has emerged. Recent work has shown that topology-aware neighbor selection during construction can aggravate the unbalance of zone distribution ...

The current paper proposes a fast stereo matching algorithm based on a pixel-wise matching strategy that can produce a stable and accurate disparity map. Since the differences between a pair of stereo images are only small and such differences are just caused by horizontal shifts in a certain order, matching using a large window is not required within a given search range. Therefore, the curren...

In MANET mobile node is responsible for route establishment using wireless link where each node behave like both as a host and router. MANET encounter by number of security threat because of its open untrusted environment with little security arrangement, whether security over MANET is not to be enhance up to satisfactory level because of its characteristics. Among all of security threat worm h...

In this paper we calculate the exact cumulative distribution function (CDF) of path distance (L1 norm) between a randomly selected intersection and k-th nearest node Cox point process driven by Manhattan Poisson line process. The CDF is expressed as sum over integer partition $p\!\left(k\righ...

Wireless networks offer more flexibility and adapt easily to changes in the configuration of the network. Wireless ad hoc network is a decentralized type of wireless network. Mobile ad hoc network is a type of ad hoc network, in which each and every node can change its location. Frequent link breakages exist due to its high mobility of nodes which leads to frequent path failures and route disco...

In the context of classifying cyberbullying comments, we introduce a k-nearest neighbor/support vector machine hybrid model. A crucial insight into the training of support vector machines is that the training and the resulting model only depend on a few select points of the training data the support vectors that represent constraints on the implicit decision surfaces of the models. As part of o...