For two probability distributions with finite alphabets, a small variational distance between them does not imply that the difference between their entropies is small if one of the alphabet sizes is unknown. This fact, seemingly contradictory to the continuity of entropy for finite alphabet, is clarified in the current paper by means of certain bounds on the entropy difference between two proba...

In this paper a basic skill vector characterization of occupations is used to examine the relation between human capital specificity and occupational mobility. Specifically, the paper asks, how much occupational mobility is simply moving a given skill or task set around different occupations that use the same skill set, and how much involves major shifts in the skill vectors? The loss of specif...

BACKGROUND An important event in many young people's lives is moving out of the parental home. This event is often operationalized as the distance between parents and their children, i.e., parent-child proximity. METHODS The present study (N = 1,451) analyzed correlates of parent-child proximity through the lens of human value theory (Schwartz, Advances in experimental social psychology, 1992...

Distance-based algorithms for both clustering and prediction are popular within the machine learning community. These algorithms typically deal with attributevalue (single-table) data. The distance functions used are typically hard-coded. We are concerned here with generic distance-based learning algorithms that work on arbitrary types of structured data. In our approach, distance functions are...

Metric is one of the fundamental tools for understanding space. It gives induced topology to the space and it is the most basic way to provide the space with topology. Different metrics make different topologies. The shape of the space largely depends on its metric. In understanding genetic algorithms, metric is also basic and important. In genetic algorithms, a good distance measure not only h...

Object lookup is a basic problem in P2P network. Long-distance connections have been used to construct a searchable P2P network according to the small-world paradigm. Long-distance connections based on distance can achieve a searchable P2P network in theorem. However, it is hard to measure the lattice distance between two peers in real P2P network. On the other hand, it is easy to construct ran...

Distance on graph is a very useful concept [1]. Both the shortest path distance [2], resistance distance [3] and the mean first-passage distance of a random walker [4-7] can reflect the intrinsic properties of the graph. However, conventional first-passage distance on a graph is based on the basic assumption that the whole network is closed, which means the random walker cannot escape from the ...