Related papers: Comments on Six Degrees of Separation based on the…
In this article we discuss six degrees of separation, which has been proposed by Milgram, from a theoretical point of view. Simply if one has $k$ friends, the number $N$ of indirect friends goes up to $\sim k^d$ in $d$ degrees of…
Milgram Condition proposed by Aoyama et al. plays an important role on the analysis of "six degrees of separation". We have shown that the relations between Milgram condition and the generalized clustering coefficient, which was introduced…
We introduce a series of generalized clustering coefficients based on String formalism given by Aoyama, using adjacent matrix in networks. We numerically evaluate Milgram condition proposed in order to explore q-th degrees of separation in…
We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their…
The phenomenon of six degrees of separation is an old but attractive subject. The deep understanding has been uncovered yet, especially how closed paths included in a network affect six degrees of separation are an important subject left…
The proposal of Six Degrees of Separation makes people realize that the world is not as big as we imagined. Even if the world's population now exceeds 7 billion, two strangers can still get in touch through a limited intermediary. When…
The phenomenon of six degrees of separation is an old but interesting problem. The considerations of the clustering coefficient reflecting triangular structures and its extension to square one to six degrees of separation have been…
Frigyes Karinthy, in his 1929 short story "L\'aancszemek" ("Chains") suggested that any two persons are distanced by at most six friendship links. (The exact wording of the story is slightly ambiguous: "He bet us that, using no more than…
Stanley Milgram's small world experiment presents "six degrees of separation" of our world. One phenomenon of the experiment still puzzling us is that how individuals operating with the social network information with their characteristics…
A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most…
Complex networks has been a hot topic of research over the past several years over crossing many disciplines, starting from mathematics and computer science and ending by the social and biological sciences. Random graphs were studied to…
In 2002, Kleinberg proposed three axioms for distance-based clustering, and proved that it was impossible for a clustering method to satisfy all three. While there has been much subsequent work examining and modifying these axioms for…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
Microcanonical Monte Carlo simulations of a polydisperse soft-spheres model for liquids and colloids have been performed for very large polydispersity, in the region where a phase-separation is known to occur when the system (or part of it)…
Particle competition and cooperation (PCC) is a graph-based semi-supervised learning approach. When PCC is applied to interactive image segmentation tasks, pixels are converted into network nodes, and each node is connected to its k-nearest…
Social media filters combined with recommender systems can lead to the emergence of filter bubbles and polarized groups. In addition, segregation processes of human groups in certain social contexts have been shown to share some…
We study gradient bounds and other functional inequalities for the diffusion semigroup generated by Kolmogorov type operators. The focus is on two different methods: coupling techniques and generalized $\Gamma$-calculus techniques. The…
Three distant labs A, B and C, having no prior entanglement can establish a shared GHZ state, when one of them say A sends two particles to B and C for their local actions. The mediating particles remain separable from each other and from…
We present an algorithm of clustering of many-dimensional objects, where only the distances between objects are used. Centers of classes are found with the aid of neuron-like procedure with lateral inhibition. The result of clustering does…
According to the small-world concept, the entire world is connected through short chains of acquaintances. In popular imagination this is captured in the phrase six degrees of separation, implying that any two individuals are, at most, six…