Affiner les résultats

Collection spécifique

Langue

Université de Fribourg

Study of market model describing the contrary behaviors of informed and uninformed agents: Being minority and being majority

Zhang, Yu-Xia ; Liao, Hao ; Medo, Matúš ; Shang, Ming-Sheng ; Yeung, Chi Ho

In: Physica A: Statistical Mechanics and its Applications, 2016, vol. 450, p. 486–496

In this paper we analyze the contrary behaviors of the informed investors and uniformed investors, and then construct a competition model with two groups of agents, namely agents who intend to stay in minority and those who intend to stay in majority. We find two kinds of competitions, inter- and intra-groups. The model shows periodic fluctuation feature. The average distribution of...

Université de Fribourg

Ranking nodes in growing networks: When PageRank fails

Mariani, Manuel Sebastian ; Medo, Matúš ; Zhang, Yi-Cheng

In: Scientific Reports, 2015, vol. 5, p. 16181

PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm’s efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank’s...

Université de Fribourg

Prediction in complex systems: the case of the international trade network

Vidmer, Alexandre ; Zeng, An ; Medo, Matúš ; Zhang, Yi-Cheng

In: Physica A: Statistical Mechanics and its Applications, 2015, vol. 436, p. 188–199

Predicting the future evolution of complex systems is one of the main challenges in complexity science. Based on a current snapshot of a network, link prediction algorithms aim to predict its future evolution. We apply here link prediction algorithms to data on the international trade between countries. This data can be represented as a complex network where links connect countries with the...

Université de Fribourg

Modeling mutual feedback between users and recommender systems

Zeng, An ; Yeung, Chi Ho ; Medo, Matúš ; Zhang, Yi-Cheng

In: Journal of Statistical Mechanics: Theory and Experiment, 2015, vol. 2015, no. 7, p. P07020

Recommender systems daily influence our decisions on the Internet. While considerable attention has been given to issues such as recommendation accuracy and user privacy, the long-term mutual feedback between a recommender system and the decisions of its users has been neglected so far. We propose here a model of network evolution which allows us to study the complex dynamics induced by this...

Université de Fribourg

Network-driven reputation in online scientific communities

Liao, Hao ; Xiao, Rui ; Cimini, Giulio ; Medo, Matúš

In: PLoS ONE, 2014, vol. 9, no. 12, p. e112022

The ever-increasing quantity and complexity of scientific production have made it difficult for researchers to keep track of advances in their own fields. This, together with growing popularity of online scientific communities, calls for the development of effective information filtering tools. We propose here an algorithm which simultaneously computes reputation of users and fitness of papers in...

Université de Fribourg

Information filtering by similarity-preferential diffusion processes

Zeng, An ; Vidmer, Alexandre ; Medo, Matúš ; Zhang, Yi-Cheng

In: EPL (Europhysics Letters), 2014, vol. 105, no. 5, p. 58002

Recommender systems provide a promising way to address the information overload problem which is common in online systems. Based on past user preferences, a recommender system can find items that are likely to be relevant to a given user. Two classical physical processes, mass diffusion and heat conduction, have been used to design recommendation algorithms and a hybrid process based on them has...

Université de Fribourg

Firm competition in a probabilistic framework of consumer choice

Liao, Hao ; Xiao, Rui ; Chen, Duanbing ; Medo, Matúš ; Zhang, Yi-Cheng

In: Physica A: Statistical Mechanics and its Applications, 2014, vol. 400, p. 47–56

We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We find Nash market equilibria and other optimal strategies in various situations ranging from competition of two identical firms to firms of different sizes and...

Université de Fribourg

Statistical validation of high-dimensional models of growing networks

Medo, Matúš

In: Physical Review E, 2014, vol. 89, no. 3, p. 032801

The abundance of models of complex networks and the current insufficient validation standards make it difficult to judge which models are strongly supported by data and which are not. We focus here on likelihood maximization methods for models of growing networks with many parameters and compare their performance on artificial and real datasets. While high dimensionality of the parameter space...

Université de Fribourg

The effect of the initial network configuration on preferential attachment

Berset, Yves ; Medo, Matúš

In: The European Physical Journal B, 2013, vol. 86, no. 6, p. 1-7

The classical preferential attachment model is sensitive to the choice of the initial configuration of the network. As the number of initial nodes and their degree grow, so does the time needed for an equilibrium degree distribution to be established. We study this phenomenon, provide estimates of the equilibration time, and characterize the degree distribution cutoff observed at finite times....

Université de Fribourg

Crowd avoidance and diversity in socio-economic systems and recommendations

Gualdi, Stanislao ; Medo, Matúš ; Zhang, Yi-Cheng

In: EPL (Europhysics Letters), 2013, vol. 101, no. 2, p. 20008

Recommender systems recommend objects regardless of potential adverse effects of their overcrowding. We address this shortcoming by introducing crowd-avoiding recommendation where each object can be shared by only a limited number of users or where object utility diminishes with the number of users sharing it. We use real data to show that contrary to expectations, the introduction of these...

Voir aussi: noms d'auteurs similaires
4 Medo, M.
1 Medo, Matsúš
1 Medo, Matú?