Author
Kimmo Kaski
Other affiliations: Helsinki University of Technology, The Turing Institute, Temple University ...read more
Bio: Kimmo Kaski is an academic researcher from Aalto University. The author has contributed to research in topics: Social network & Artificial neural network. The author has an hindex of 66, co-authored 525 publications receiving 18668 citations. Previous affiliations of Kimmo Kaski include Helsinki University of Technology & The Turing Institute.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is found that, when it comes to information diffusion, weak and strong ties are both simultaneously ineffective, and this coupling significantly slows the diffusion process, resulting in dynamic trapping of information in communities.
Abstract: ncovering the structure and function of communication networks has always been constrained by the practical difficulty of mapping out interactions among a large number of individuals. Indeed, most of our current understanding of com- munication and social networks is based on questionnaire data, reaching typically a few dozen individuals and relying on the individual's opinion to reveal the nature and the strength of the ties. The fact that currently an increasing fraction of human interactions are recorded, from e-mail (1-3) to phone records (4), offers unprecedented opportunities to uncover and explore the large scale characteristics of communication and social networks (5). Here we take a first step in this direction by exploiting the widespread use of mobile phones to construct a map of a society-wide communication network, capturing the mobile interaction patterns of millions of individuals. The data set allows us to explore the relationship between the topology of the network and the tie strengths between individuals, informa- tion that was inaccessible at the societal level before. We demonstrate a local coupling between tie strengths and network topology, and show that this coupling has important conse- quences for the network's global stability if ties are removed, as well as for the spread of news and ideas within the network. A significant portion of a country's communication network wasreconstructedfrom18weeksofallmobilephonecallrecords among 20% of the country's entire population, 90% of whose
1,920 citations
TL;DR: This paper applies motif scores and clustering coefficient to financial and metabolic networks and finds that inclusion of weights may considerably modify the conclusions obtained from the study of unweighted characteristics.
Abstract: The local structure of unweighted networks can be characterized by the number of times a subgraph appears in the network. The clustering coefficient, reflecting the local configuration of triangles, can be seen as a special case of this approach. In this paper we generalize this method for weighted networks. We introduce subgraph ``intensity'' as the geometric mean of its link weights and ``coherence'' as the ratio of the geometric to the corresponding arithmetic mean. Using these measures, motif scores and clustering coefficient can be generalized to weighted networks. To demonstrate these concepts, we apply them to financial and metabolic networks and find that inclusion of weights may considerably modify the conclusions obtained from the study of unweighted characteristics.
957 citations
TL;DR: The time evolution of information propagation is followed through communication networks by using empirical data on contact sequences and the susceptible-infected model and introducing null models where event sequences are appropriately shuffled to distinguish between the contributions of different impeding effects.
Abstract: While communication networks show the small-world property of short paths, the spreading dynamics in them turns out slow. Here, the time evolution of information propagation is followed through communication networks by using empirical data on contact sequences and the susceptible-infected model. Introducing null models where event sequences are appropriately shuffled, we are able to distinguish between the contributions of different impeding effects. The slowing down of spreading is found to be caused mainly by weight-topology correlations and the bursty activity patterns of individuals.
700 citations
TL;DR: The time dependence of the recently introduced minimum spanning tree description of correlations between stocks, called the "asset tree", has been studied in order to reflect the financial market taxonomy and the basic structure of the tree topology is very robust with respect to time.
Abstract: The time dependence of the recently introduced minimum spanning tree description of correlations between stocks, called the ‘‘asset tree’’ has been studied in order to reflect the financial market taxonomy. The nodes of the tree are identified with stocks and the distance between them is a unique function of the corresponding element of the correlation matrix. By using the concept of a central vertex, chosen as the most strongly connected node of the tree, an important characteristic is defined by the mean occupation layer. During crashes, due to the strong global correlation in the market, the tree shrinks topologically, and this is shown by a low value of the mean occupation layer . The tree seems to have a scale-free structure where the scaling exponent of the degree distribution is different for ‘‘business as usual’’ and ‘‘crash’’ periods. The basic structure of the tree topology is very robust with respect to time. We also point out that the diversification aspect of portfolio optimization results in the fact that the assets of the classic Markowitz portfolio are always located on the outer leaves of the tree. Technical aspects such as the window size dependence of the investigated quantities are also discussed.
695 citations
TL;DR: A comparative study of the several suggestions of the clustering coefficient, which is one of the central characteristics in the complex network theory, is presented.
Abstract: The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduced in the literature, and point out their advantages and limitations. The concepts are illustrated by simple examples as well as by empirical data of the world trade and weighted coauthorship networks.
635 citations
Cited by
More filters
28 Jul 2005
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。
18,940 citations
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Abstract: Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
17,647 citations
TL;DR: This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Abstract: We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection method in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2.6 million customers and by analyzing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad-hoc modular networks. .
13,519 citations
TL;DR: In this paper, the authors proposed a simple method to extract the community structure of large networks based on modularity optimization, which is shown to outperform all other known community detection methods in terms of computation time.
Abstract: We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks.
11,078 citations
TL;DR: The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.
9,441 citations