In the Internet era, online social media emerged as the main tool for sharing opinions and information among individuals. In this work, we study an adaptive model of a social network where directed links connect users with similar tastes, and over which information propagates through social...

Identifying influential nodes that lead to faster and wider spreading in complex networks is of theoretical and practical significance. The degree centrality method is very simple but of little relevance. Global metrics such as betweenness centrality and closeness centrality can better identify...

In market modeling, one often treats buyers as a homogeneous group. In this paper we consider buyers with heterogeneous preferences and products available in many variants. Such a framework allows us to successfully model various market phenomena. In particular, we investigate how is the...

The growth-optimal portfolio optimization strategy pioneered by Kelly is based on constant portfolio rebalancing which makes it sensitive to transaction fees. We examine the effect of fees on an example of a risky asset with a binary return distribution and show that the fees may give rise to an...

Financial markets, with their vast range of different investment opportunities, can be seen as a system of many different simultaneous games with diverse and often unknown levels of risk and reward. We introduce generalizations to the classic Kelly investment game [J.L. Kelly, IEEE Transactions...

Online systems, where users purchase or collect items of some kind, can be effectively represented by temporal bipartite networks where both nodes and links are added with time. We use this representation to predict which items might become popular in the near future. Various prediction methods...

Many complex systems can be investigated using the framework of temporal networks, which consist of nodes and edges that vary in time. The community structure in temporal network contributes to the understanding of evolving process of entities in complex system. The traditional method on dynamic...

Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank (Lü et al., 2011)....

The constrained rectangle-packing problem is the problem of packing a subset of rectangles into a larger rectangular container, with the objective of maximizing the layout value. It has many industrial applications such as shipping, wood and glass cutting, etc. Many algorithms have been proposed...

Community structure is an important property of complex networks. How to detect the communities is significant for understanding the network structure and to analyze the network properties. Many algorithms, such as K–L and GN, have been proposed to detect community structures in complex...