The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this note we look at the degree distribution of graphs created from graphs with Zipfian degree distributions using some standard graph theoretical operations. Introduction: The probability distribution on a set S = { 1, 2, ....

introduction: the study on psychology of marriage rooted in the social issues. the field has also found its way to biomedicine. the current research, based on the document-term clustering methods, focus on term-proximity of documents that were related to the field of psychology of marriage in biomedicine literature. methods: the co-occurrence frequency of terms within the two different corpuses...

Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the readability decreases when large-scale graphs are drawn. To maintain the readability in drawing large-scale graphs, we developed “sphere anchored maps,” in which nodes in one set are arranged on a sphere. We describe th...

background: alopecia areata (aa) is a noncicatricial (nonscarring) alopecia. the association between aa and celiac disease (cd) is debatable. several studies declare the relationship between aa and cd as measurement of celiac autoantibodies (anti‑gliadin iga and anti‑gliadin igg), but a few studies consider anti‑tissue transglutaminase iga. the aim of this study was to evaluate the frequency di...

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. We construct saturated simple topological graphs with n vertices and O(n) edges. For every k > 1, we give similar constructions for k-simple...

In this paper, we present a simple non-parametric method for learning the structure of undirected graphs from data that drawn from an underlying unknown distribution. We propose to use Brownian distance covariance to estimate the conditional independences between the random variables and encodes pairwise Markov graph. This framework can be applied in high-dimensional setting, where the number o...

In this study, based on the Hirota bilinear form, exact analytic solutions of (3 + 1) dimensional Vakhnenko–Parkes equation with various physical properties were constructed help Maple package program and symbolic computation. These are type multi-waves, breather wave, lump–kink, lump–periodic interaction (between lump hyperbolic wave solutions). The have expanded enriched solution forms new mo...

We study the codeword distribution for a consciense type competitive learning algorithm, Frequency Sensitive Competitive Learning (FSCL), using one dimensional input data. We prove that the asymptotic codeword density in the limit of large number of codewords is given by a power law of the form Q(x) = C P (x) , where P (x) is the input data density and depends on the algorithm and the form of t...