A.I. Alikhanyan National Science Laboratory, Yerevan, Armenia Laboratoire Interdisciplinaire Carnot de Bourgogne, Dijon, France Levon Chakhmakhchyan In.

Slides:



Advertisements
Similar presentations
Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
Advertisements

+ Multi-label Classification using Adaptive Neighborhoods Tanwistha Saha, Huzefa Rangwala and Carlotta Domeniconi Department of Computer Science George.
Markov Models.
Analysis and Modeling of Social Networks Foudalis Ilias.
VisualRank: Applying PageRank to Large-Scale Image Search Yushi Jing, Member, IEEE, and Shumeet Baluja, Member, IEEE.
报告人: 林 苑 指导老师:章忠志 副教授 复旦大学  Introduction about random walks  Concepts  Applications  Our works  Fixed-trap problem  Multi-trap problem.
Relationship Mining Network Analysis Week 5 Video 5.
Analysis of Social Media MLD , LTI William Cohen
Information Retrieval Lecture 8 Introduction to Information Retrieval (Manning et al. 2007) Chapter 19 For the MSc Computer Science Programme Dell Zhang.
Modern Monte Carlo Methods: (2) Histogram Reweighting (3) Transition Matrix Monte Carlo Jian-Sheng Wang National University of Singapore.
Information Networks Small World Networks Lecture 5.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Cascading failures in interdependent networks and financial systems -- Departmental Seminar Xuqing Huang Advisor: Prof. H. Eugene Stanley Collaborators:
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
CIKM’2008 Presentation Oct. 27, 2008 Napa, California
Funding Networks Abdullah Sevincer University of Nevada, Reno Department of Computer Science & Engineering.
Network Morphospace Andrea Avena-Koenigsberger, Joaquin Goni Ricard Sole, Olaf Sporns Tung Hoang Spring 2015.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete random variables Probability mass function Distribution function (Secs )
Zhenhua Wu Advisor: H. E. StanleyBoston University Co-advisor: Lidia A. BraunsteinUniversidad Nacional de Mar del Plata Collaborators: Shlomo HavlinBar-Ilan.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Semantic text features from small world graphs Jure Leskovec, IJS + CMU John Shawe-Taylor, Southampton.
Physical Mechanism Underlying Opinion Spreading Jia Shao Advisor: H. Eugene Stanley J. Shao, S. Havlin, and H. E. Stanley, Phys. Rev. Lett. 103,
Finding the best immunization strategy Yiping Chen Collaborators: Shlomo Havlin Gerald Paul Advisor: H.Eugene Stanley.
Physical Mechanism Underlying Opinion Spreading
Transport Properties of Fractal and Non-Fractal Scale-Free Networks
Random Field Ising Model on Small-World Networks Seung Woo Son, Hawoong Jeong 1 and Jae Dong Noh 2 1 Dept. Physics, Korea Advanced Institute Science and.
Journal Status* Using the PageRank Algorithm to Rank Journals * J. Bollen, M. Rodriguez, H. Van de Sompel Scientometrics, Volume 69, n3, pp , 2006.
The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI
Conference title 1 A Few Bad Apples Are Enough. An Agent-Based Peer Review Game. Juan Bautista Cabotà, Francisco Grimaldo (U. València) Lorena Cadavid.
CS246 Link-Based Ranking. Problems of TFIDF Vector  Works well on small controlled corpus, but not on the Web  Top result for “American Airlines” query:
Measurement and Evolution of Online Social Networks Review of paper by Ophir Gaathon Analysis of Social Information Networks COMS , Spring 2011,
Google’s PageRank: The Math Behind the Search Engine Author:Rebecca S. Wills, 2006 Instructor: Dr. Yuan Presenter: Wayne.
Reversing chaos Boris Fine Skolkovo Institute of Science and Technology University of Heidelberg.
Kristina Lerman Aram Galstyan USC Information Sciences Institute Analysis of Social Voting Patterns on Digg.
Claudio Castellano CNR-INFM Statistical Mechanics and Complexity and
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
Social Networking Algorithms related sections to read in Networked Life: 2.1,
Separating internal and external dynamics of complex systems Marcio Argollo de Menezes Albert-László Barabási.
Web Intelligence Web Communities and Dissemination of Information and Culture on the www.
Author(s): Rahul Sami and Paul Resnick, 2009 License: Unless otherwise noted, this material is made available under the terms of the Creative Commons Attribution.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
December 7-10, 2013, Dallas, Texas
Initial flux fluctuations of random walks on regular lattices Sooyeon YOON, Byoung-sun AHN, Yup KIM (Dept. of Phys.,Kyung Hee Univ.)
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
The Matrix: Using Intermediate Features to Classify and Predict Friends in a Social Network Michael Matczynski Status Report April 14, 2006.
Lecture #10 PageRank CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Robustness and Structure of Complex Networks Shuai Shao Boston University, Physics Department A dvisor: Prof. Gene Stanley Co-advisor: Prof. Shlomo Havlin.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Recent developments in the study of transport in random networks Shai Carmi Bar-Ilan University Havlin group Minerva meeting Eilat, March 2009.
Information Retrieval and Web Search Link analysis Instructor: Rada Mihalcea (Note: This slide set was adapted from an IR course taught by Prof. Chris.
Social Networking: Large scale Networks
LexPageRank: Prestige in Multi-Document Text Summarization Gunes Erkan, Dragomir R. Radev (EMNLP 2004)
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Structures of Networks
Groups of vertices and Core-periphery structure
Structural Properties of Networks: Introduction
Hayk Poghosyan A.I. Alikhanyan National Science Laboratory, Armenia
PageRank and Markov Chains
Prof. Paolo Ferragina, Algoritmi per "Information Retrieval"
Prof. Paolo Ferragina, Algoritmi per "Information Retrieval"
Modelling Structure and Function in Complex Networks
Graph and Link Mining.
Interactive analysis of a simulated patient flow network.
Sequences II Prof. Noah Snavely CS1114
Presentation transcript:

A.I. Alikhanyan National Science Laboratory, Yerevan, Armenia Laboratoire Interdisciplinaire Carnot de Bourgogne, Dijon, France Levon Chakhmakhchyan In collaboration with D. Shepelyansky FR/ARM CLASSQUANT

Modeling opinion formation processes Modern social networks  exhibit scale-free, small world properties: differ much from regular lattices  each node (user) has its degree of authority Weigh the degree of authority by means of a node’s PageRank Brin, Page, Comput. Netw. ISDN Syst. (1998)

Ulam networks y n+1 =f 1 (x n, y n ) x n+1 =f 2 (x n, y n ) x y i j Ulam network (Ulam, “A collection of mathematical problems”, NY 1960) PageRank and Google matrix properties of Ulam networks share common features with some real networks Shepelyansky et. al, Phys. Rev. E 81 (2010); Ermann et al., Phys. Rev. E 81 (2010). x

opinion is influenced by the closest linked nodes (friends) influential friend’s opinion counts more than less important friend’s opinion PageRank model of opinion foramtion (PROF) Two possible opinions are incoded by an Ising spin: +1 (red) and -1 (blue) Σ i >0 a node votes for red Σ i <0 a node votes for blue Σ i =P j,in + +P j,out + - P j,in - -P j,out -

PROF model on Ulam networks random distribution f(t)=N red /N the elite members of the same opinion

Generalized PROF-Sznajd model for 2D mappings initial distirbutionfinal distirbution P=P 1 +P 2 P3P3 P 3 <P 1 +P 2 The top elite nodes first tend to convince other members of the elite Sznajd-Weron, J.Sznajd, Int. J. Mod. Phys. C (2000).

PageRank model of opinion formation on Ulam networks is proposed Elite can impose its opinion up to a certain degree and firstly tends to convince other members of the elite The system may not come to a steady state if groups of the same opinion are considered The model exhibits certain distinctions from similar models examined on real networks (Kandiah, Shepelyansky, Physica A (2012)) Summary LC, D. Shepelyansky, Phys. Lett. A 377, 3119 (2013)