arXiv subjects

Hiroyoshi Miwa

Publications and source records attributed to Hiroyoshi Miwa.

3 recordsLinked to original sources

arXiv2014

Homesick Lévy walk: A mobility model having Ichi-go Ichi-e and scale-free properties of human encounters

In recent years, mobility models have been reconsidered based on findings by analyzing some big datasets collected by GPS sensors, cellphone call records, and Geotagging. To understand the fundamental statistical properties of the frequency of serendipitous human encounters, we conducted experiments to collect long-term data on human contact using short-range wireless communication devices which many people frequently carry in daily life. By analyzing the data we showed that the majority of human encounters occur once-in-an-experimental-period: they are Ichi-go Ichi-e. We also found that the remaining more frequent encounters obey a power-law distribution: they are scale-free. To theoretically find the origin of these properties, we introduced as a minimal human mobility model, Homesick Lévy walk, where the walker stochastically selects moving long distances as well as Lévy walk or returning back home. Using numerical simulations and a simple mean-field theory, we offer a theoretical explanation for the properties to validate the mobility model. The proposed model is helpful for evaluating long-term performance of routing protocols in delay tolerant networks and mobile opportunistic networks better since some utility-based protocols select nodes with frequent encounters for message transfer.

physics.soc-ph↗

arXiv2005

Geographical threshold graphs with small-world and scale-free properties

Many real networks are equipped with short diameters, high clustering, and power-law degree distributions. With preferential attachment and network growth, the model by Barabasi and Albert simultaneously reproduces these properties, and geographical versions of growing networks have also been analyzed. However, nongrowing networks with intrinsic vertex weights often explain these features more plausibly, since not all networks are really growing. We propose a geographical nongrowing network model with vertex weights. Edges are assumed to form when a pair of vertices are spatially close and/or have large summed weights. Our model generalizes a variety of models as well as the original nongeographical counterpart, such as the unit disk graph, the Boolean model, and the gravity model, which appear in the contexts of percolation, wire communication, mechanical and solid physics, sociology, economy, and marketing. In appropriate configurations, our model produces small-world networks with power-law degree distributions. We also discuss the relation between geography, power laws in networks, and power laws in general quantities serving as vertex weights.

cond-mat.dis-nn↗

arXiv2004

Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights

Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks proposed by Caldarelli et al. (2002). Power-law degree distributions, particularly with the dynamically stable scaling exponent 2, realistic clustering, and short path lengths are produced for many types of weight distributions. Thresholding mechanisms can underlie a family of real complex networks that is characterized by cooperativeness and the baseline scaling exponent 2. It contrasts with the class of growth models with preferential attachment, which is marked by competitiveness and baseline scaling exponent 3.

cond-mat.other↗