Scale-Free 関連

A generative model for feedback networks
Douglas R. White, Natasa Kejzar,Constantino Tsallis, Doyne Farmer
arXiv:cond-mat/0508028 v1 (2005)
University of California Irvine
We investigate a simple generative model for network formation. The model is designed to describe the growth of networks of kinship, trading, corporate alliances, or autocatalytic chemical reactions, where feedback is an essential element of network growth. The underlying graphs in these situations grow via a competition between cycle formation and node addition. After choosing a given node, a search is made for another node at a suitable distance. If such a node is found, a link is added connecting this to the original node, and increasing the number of cycles in the graph; if such a node cannot be found, a new node is added, which is linked to the original node. We simulate this algorithm and find that we cannot reject the hypothesis that the empirical degree distribution is a q-exponential function, which has been used to model long-range processes in nonequilibrium statistical mechanics.
A spatial network explanation for a hierarchy of urban power laws
Claes Andersson, Alexander Hellervik, Kristian Lindgren
arXiv:cond-mat/0306439 v1(2003)
Chalmers University of Technology
The presented model provides an explanation to several empirically observed phenomena in spatial economics. By representing the system as a complex network of fixed-size land areas connected by trade between harbored activities, city size a nd land value distributions are obtained as higher-order patterns. The model predicts the empirically observed spatial distribution of land value density as well as that of urban cluster prices. To connect land value to population, which is a commonly observed quantity, we a lso demonstrate that there is, for urban clusters, a linear relation between accumulated land value and population.
An algorithm generating random graphs with power law degree distributions
D.Volchenkov, Ph. Blanchard
Physica A 315(2002) pp.677--690
BiBoS, University Bielefeld
KW: Scale-free random graphs; Real-world networks; Power laws
Boolean dynamics of networks with scale-free topology
Maximino Aldana
Physica D 185(2003) pp.45--66
The University of Chicago
KW: Boolean networks; Scale-free topology; Dynamical phase transition; Stability; Evolvability
Collective dynamics of 'small-world' networks
Duncan J. Watts, Steven H. Strogatz
Nature (1998) pp.440--442
Cornell University
Complex networks and economics
Wataru Souma, Yoshi Fujiwara, Hideaki Aoyama
Physica A 324 (2003) pp.396--401
ATR, Communications Research Laboratory, /www-top/cc/users/kshinoda/research
KW: Business networks; Scale-free networks; Merger among banks
Complex topology in the highway network of Hungary, 1990 and 1998
Donald W. Buckwalter
Journal of Transport Geography (2001) pp.125--135
Indiana University of Pennsylvania
KW: Hungery; Network analysis; Planare graphs: Transition countries; Transportation
Deterministic scale-free networks
Albert-Laszlo Barabasia, Erzsebet Ravasz, Tamas Vicsek
Physica A 299(2001) pp.559--564
University of Notre Dame
KW: Disordered systems; Networks; Scale-free networks; Scaling
Directed and non-directed scale-free networks
Reuven Cohen, Alejandro Fabian Rozenfeld, Nehemia Schwartz, Daniel ben-Avraham, Shlomo Havlin
() pp.
Distribution of infected mass in disease spreading in scale-free networks
Lazaros K. Gallos, Panos Argyrakis
Physica A 330 (2003) pp.117--123
University of Thessaloniki
KW: Scale-free networks; Spreading; SIR model; Infected mass
Eciency of scale-free networks: error and attack tolerance
Paolo Crucitti, Vito Latora, Massimo Marchiori, Andrea Rapisarda
Physica A 320 (2003) pp.622--642
KW: Structure of complex networks; Scale-free networks
Emergence of Scaling in Random Networks
Albert-Laszlo Barabasi, Reka Albert
SCIENCE 286 (1999) pp.509--512
Emergence of social conventions in complex networks
Jordi Delgado
Artificial Intelligence 141 (2002) pp.171--185
Universitat Politォイcnica de Catalunya
KW: Conventions; Emergent behavior; Coordination; Multi-agent systems
Epidemic outbreaks in complex heterogeneous networks
Y. Moreno, R. Pastor-Satorras, A. Vespignani
THE EUROPEAN PHYSICAL JOURNAL B, 26 (2002) pp.521--529
The Abdus Salam International Centre for Theoretical Physics
SIR model
Evolution of the social network of scientic collaborations
A.L. Barabasi, H. Jeonga, Z. Neda, E. Ravasz, A. Schubert, T. Vicsek
() pp.
University of Notre Dame
KW: Random networks; Scaling; Small-word systems; Scale-free networks
Geographical embedding of scale-free networks
Daniel ben-Avraham, Alejandro F. Rozenfeld, Reuven Cohen, Shlomo Havlinb
() pp.
KW: Internet; Scale-free; Networks; Embedding; Lattice
Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
Alexei Vazquez
arXiv:cond-mat/0211528 v2
Geometry of minimum spanningtrees on scale-free networks
Gabor J. Szaboa, Mikko Alavab, Janos Kertesz
Physica A 330 (2003) pp.31--36
Budapest University of Technology
KW:: Minimum spanningtrees; Random networks; Global optimization
Higher order clustering coeffcients in Barabasi Albert networks
Agata Fronczak, Janusz A. Ho lyst, Maciej Jedynak, Julian Sienkiewicz
Physica A 316 (2002) pp.688--694
Warsaw University of Technolog,
KW:: Disordered systems; Scale-free networks; Computer simulations
Is the Boston subway a small-world network?
Vito Latora, Massimo Marchiori
Physica A 314 (2002) pp.109--113
KW:: Small-world networks; Transportation systems
Length ofoptimal path in random networks with strong disorder
Sergey V. Buldyrev, Lidia A. Braunstein, Reuven Cohen, Shlomo Havlin, H. Eugene Stanley
Physica A 330 (2003) pp.246--252
Boston University
KW:: Scale-free networks; Small-world networks; Percolation; Strong disorder; Optimal path
Local versus global knowledge in the Baraba。ュsi-Albert scale-free network model
Jesus Gomez-Gardenes, Yamir Moreno
PHYSICAL REVIEW E 69 (2004) 037103
Universidad de Zaragoza
Mean field solution of the Ising model on a Barabasi-Albert network
Ginestra Bianconi
Physical Letters A 303(2002) pp.166-168
KW:: Curie temperature; Mean field approximation; Critical phenomena
Navigation in a small world
Jon M. Kleinberg
() pp.
Cornell University
Memory and Selectivity in Evolving Scale-Free Immune Networks
P. Tieri, S. Valensin, C. Franceschi, C. Morandi, and G.C. Castellani
ICARIS 2003, LNCS 2787, (2003) pp.93--101
University of Bologna
Modeling ofcontact tracing in social networks
Lev S. Tsimringa, Ramon Huerta
Physica A 325 (2003) pp.33--39
University of California
KW:: Epidemics; SIR model; Networks
Network Dynamics and Field Evolution: The Growth of Interorganizational Collaboration in the Life Sciences
Walter W. Powell, Douglas R. White, Kenneth W. Koput, Jason Owen-Smith
American Journal of Sociologys(Preprint) () pp.
On the Dynamics of Scale-Free Boolean Networks
Roberto Serra, Marco Villani, and Luca Agostini
WIRN VIETRI 2003, LNCS 2859 (2003) pp.43--49
Centro Ricerche Ambientali
Optimization of highway networks and traffic forecasting
Andreas Schadschneider, Wolfgang Knospe, Ludger Santen, Michael Schreckenberg
Physica A 346 (2005) pp.165--173
KW:: Cellular automata; Modelling of traffic flow; Optimization
Packet transport andloadd istribution in scale-free network models
K.-I. Goh, B. Kahng, D. Kim
Physica A 318 (2003) pp.72--79
Seoul National University
KW:: Scale-free networks; Loadd istributions
Pinning control of scale-free dynamical networks
Xiao Fan Wanga, Guanrong Chen
Physica A 310 (2002) pp.521--531
Shanghai Jiaotong University
KW:: Networks; Control; Stability; Scaling
Power-law distributions resulting from finite resources
Thomas Wilhelm, Peter Hanggi
Physica A 329 (2003) pp.499--508
Institute of Molecular Biotechnology
KW::Power-law distribution; Zipf's law; Stochastic multiplicative process; Network; Internet
Random evolution in massive graphs
William Aiello, Fan Chung, Linyuan Lu
() pp.
AT\&T Lab.
Relay network design in freight transportation systems
Tarab H. Ali, Sridhar Radhakrishnan, Simin Pulat, Nagaiah C. Gaddipati
Transportation Research Part E 38 (2002) pp.405--422
University of Oklahoma
KW:: Relay points; Freight transportation; Heuristics; Shortest path; Network
Scale-free behavior of the Internet global performance
R. Percacci, A. Vespignani,
The Europoean Physocal Journal B 32(2003) pp.411--414
KW:: Complex systems, Nonequilibrium and irreversible thermodynamics, Dynamics of social systems
Scale-free characteristics of random networks: the topology of the world-wide web
Albert-Laszlo Barabasi, Reka Albert, Hawoong Jeong
Physica A 281 (2000) pp.69--77
University of Notre-Dame
KW:: Disordered systems; Networks; Random networks; Critical phenomena; Scaling; World-wide web
Scale-free networks in evolution
Paulo R.A. Campos, Viviane M. de Oliveira
Physica A 325 (2003) pp.570--576
Universidade de Sao Paulo
KW:: Evolution; Scale-free networks; Genealogy
Scale-free multicomponent growing networks
Jianhong Ke
PHYSICAL REVIEW E 69 (2004) 037101
Wenzhou Normal College
Scale free networks from a Hamiltonian dynamics
M. Baiesi, S. S. Manna
arXiv:cond-mat/0305054 v2 (2003)
Universita di Padova
Small-world properties of the Indian Railway network
Parongama Sen, Subinay Dasgupta, Arnab Chatterjee, P. A. Sreeram, G. Mukherjee, S. S. Manna
Physical Review E 67, (2002), 036106
University of Calcutta, Saha Institute of Nuclear Physics
Small World Graphs by the iterated "My Friends are Your Friends" Principle
Ph.Blanchard, A.Ruschhaupt and T.Krueger
arXiv:cond-mat/0304563 v1 (2003)
University of Bielefeld
Small-World Phenomena and the Dynamics of Information
Jon Kleinberg
() pp.
Cornell University
Structural Properties of Scale-Free Networks
Reuven Cohen, Shlomo Havlin, Daniel ben-Avraham
(2002) pp.
The analogies of highway and computer network traffic
Simon Gabora, Istvan Csabai
Physica A 307 (2002) pp.516--526
Eotvos University
KW:: Complex systems; Cellular automata; Internet; TCP
The Link Prediction Problem for Social Networks
David Liben-Nowell, Jon Kleinberg
An abbreviated version of this paper appears in Proceedings of the Twelfth Annual ACM International Conference on Information and Knowledge Management (CIKM'03), (2003) pp.556--559
MIT, Cornell University
The Small-World Phenomenon: An Algorithmic Perspective
Jon Kleinberg
A version of this work appears as Cornell Computer Science Technical Report (1999) pp.
The structure and function of complex networks
M. E. J. Newman
arXiv:cond-mat/0303516 v1 (2003)
University of Michigan
() pp.
KW: スモールワールド, コミュニティデザイン, 自治, 住民参加, セーフティネット, 災害対策


A measure of centrality based on the network efficiency
Vito Latora, Massimo Marchiori
() pp.
KW: Point Centrality, Valued Graphs, Centrality of Groups
Analyzing the dynamics in multilateral negotiations
Frits van Merode, Anna Nieboer, Hans Maarse, Harm Lieverdink
() pp.
Maastricht University
KW: Multilateral negotiations; Decision making; Phase-differences; Continuity of participation; Cluster analysis; Dynamic analysis
Approximate Connectivity Graph Generation in Mobile Ad Hoc Radio Networks
Christopher L. Barrett, D. Charles Engelhart
Proceedings of the 36th Annual Simulation Symposium (ANSS’03) (2003) pp.1--8
Computational complexity arising from degree correlations in networks
Alexei Vazquez, Martin Weigt
Physical Review E 67 (2003) 027101
An Ad Hoc Mobility Model Founded on Social Network Theory
Mirco Musolesi, Stephen Hailes, Cecilia Mascolo
MSWiM04 (2004) pp.20--24
KW: Mobility model, mobile ad hoc networking, social networks
Economic small-world behavior in weighted networks
V. Latora1, M. Marchiori
Universita di Catania
Effects on reliability and validity of egocentered network measurements
Tina Kogovsek, Anuska Ferligoj
Social Networks 27 (2005) pp.205--229
University of Ljubljana
KW: >Egocentered networks; Measurement; Reliability; Validity; Social support
Efficient Behavior of Small-World Networks
Vito Latora, Massimo Marchiori
VOLUME 87, NUMBER 19 PHYSICAL REVIEW LETTERS (2001) pp.198701-1 -- 1987-4
Universite Paris-Sud
Efficient Computation of PageRank
Taher H. Haveliwala
() pp.
Stanford University
Ego network betweenness
Martin Everetta, Stephen P. Borgatti
Social Networks 27 (2005) pp.31--38
University of Westminster, Boston College
closeness centrality とか betweenness centrality などを計算するには,ネットワーク全体の構造が既知で ある必要がある.ただし,その様なことは現実には考えられない.そ こで Ego-network の視点からの betweeness の計算方法を提案し, 現実の betweenness との違いを調べている.
Egocentric and sociocentric measures of network centrality
Peter V. Marsden
Social Networks 24 (2004) pp.407--422
KW: Centrality; Egocentric networks; Betweenness
Epidemic Profiles and Defense of ScaleFree Networks.
Linda Briesemeister, Patrick Lincoln, Phillip Porras
WORM'03 (2003) pp.67--75
SRI International
Evolving Genetic Regulatory Networks Using an Artificial Genome
Jennifer Hallinan, Janet Wiles
2nd Asia-Pacific Bioinformatics Conference (APBC2004) (2004) pp.291--296
The University of Queensland
Information Diffusion Through Blogspace
D. Gruhl, R. Guha, David Liben-Nowell, A. Tomkins
SIGKDD Explorations Vol.6 Issues 2 () pp.43--52
IBM Research, MIT
Introducing small-world network effects to critical dynamics
Jian-Yang Zhu, Han Zhu
FHYSICAL REVIEW E 67 (2003) 026125
CCAST(World Laboratory), Beijing Normal University
Mixing patterns in networks
M. E. J. Newman
PHYSICAL REVIEW E 67 (2003) 026126
Network Roubustness and Graph Topoloty
Anthony H. Dekker, Bernard D. Colbert
() pp.
Defence Science and Technology Organisation
KW: Network Centric Warfare, Network robustness, Graph connectivit
Network Topology Generators: Degree-Based vs. Structural
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger
SIGCOMM'02 (2002) pp.147--159
KW: Network topology, hierarchy, topology characterization, topology generators, structural generators, degree-based generators, topology metrics, large-scale structure
On the robustness of centrality measures under conditions of imperfect data
Stephen P. Borgatti, Kathleen M. Carley, David Krackhardt
Social Networks (2005) pp.
Searching Social Networks
Bin Yu, Munindar P. Singh
() pp.
North Carolina State University
KW: social networks, referral systems, knowledge management
Structural and Algorithmic Aspects of Massive Social Networks
Stephen Eubank, V.S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasany, Nan Wang
() pp.
The PageRank Citation Ranking: Bringing Order to the Web
() pp.


A social network approach to estimating seroprevalence in the United States
Peter D. Killworth, Eugene C. Johnsen, Christopher McCarty, Gene Ann Shelley, H. Russell Bernard
Social Networks 20 (1998) pp.23--50
University of California, Santa Barbara
A Survey of Models of Network Formation: Stability and Efficiency
Matthew O. Jackson
() pp.
KW: Networks; Network Games, Network Formation, Game Theory; Allocation Rules; Pairwise Stability: Efficient Networks
Who benefits from network analysis: ethics of social network research
Charles Kadushin
Social Networks 27 (2005) pp.139--153
Brandeis University
KW: Social network research; Social research methods; Ethics; Instituation review boards
Actor network utilies and network evolution
Patrick Doreian
Social Networks 27 (2005) pp.
University of Pittsburgh
KW: Social Network; Network evolution; Actor
A decision support system for rele discovery in social networks
Nicholas V. Findler, Sudheer Dhulipalla
Social Networks 21 (1999) pp.166--185
Arizona State University
A mathematical model for interpersonal relationships in social networks
George R. Barners, Patricia B. Cerrio, Inessa Levi
Social Networks 20 (1998) pp.179--196
University of Loutsuille
横山哲也, 山本仁志, 太田敏澄
社会情報学システム学シンポジウム () pp.
KW: オンラインコミュニティ, ソーシャル ネットワーク, ネットワーク分析, 内容分析
Analyzing the dynamics in multilateral negotiations
Frits van Merode, Anna Nieboer, Hans Maarse, Harm Lieverdick
Social Networks 26 (2004) pp.141--154
Maastricht University
KW: Multilateral negotiations; Decision Making; Phase-differens; Conitinuity of participation; Cluster analysis; Dynamic analysis
Another view of the "small world"
Brian McCue
Social Networks 24 (2002) pp.121--133
KW: Small world; Acquaintance volume
A p* primer: logit model for social networks
Carolyn J. Anderson, Stanley Wasserman, Brandley Crouch
Social Networks 21 (1999) pp.37--66
University of Illinois
Are social netowks technologically embedded? How netwoks are changing today with changes in communication technology
Christian Licoppe, Zbigniew Smoreda
() pp.
KW: Information and communication technology; Tele-communication: Presence-absence
A structural event approach to the analysis of group composition
Martin Ruef
Social Networks 24 (2002) pp.136--160
University of North Carolina
KW: Small Groups; Statistical methodology; Homophily; Georg Simmel
Centrality measures for disease transmission networks
David C. Bell, John S. Atkinson, Jerry W. Carlson
Social Networks 21 (1999) pp.1--21
Affiliated System
Dynamic Highway-Node Routing
Dominik Schultes and Peter Sanders
6th Workshop on Experimental and Efficient Algorithms.(WEA2007)(2007), pp.66--79
高速道路の分析といいつつ,国道も入っているのかな.イタリア全土の道路網を使っているので結構巨大なネットワークの媒介値(Betweeness)中心性を使っている様子.混雑とかでネットワークの状態が変わっても対応するとかあるけど,その分が betweenness の高速な近似解の計算手法の論文と関わってくるのかな.
betweenness, centrality


Ranking of Closeness Centrality for Large-Scale Social Networks
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
Frontiers of Algorithmics WorkShop 2008 (FAW2008) (2008) pp.186--195
Kyoto Univ., Microsoft Asia
A New Centrality Measure for Social Network Analysis Applicable to Bibliometric and Webometric Data
Hildrun Kretschmer, Theo Kretschmer
International Workshop on Webometrics, Informetrics and Scientometrics \& Seventh COLLNET Meeting(2006), pp.323--332
In the literature there are a large number of publications in sociology, in computer science or in information sciences, as well as in studies of collaboration in science describing the studies of social networks with unweighted ties because measures involving unweighted ties are easier to calculate. It is not surprising that there are few studies on networks with weighted ties since they not only need more complex formulas but need a process of quantification when quantitative empirical data are not directly available. However quantitative empirical data are directly available under the condition of using bibliometric or webometric data. In conclusion new complex measures of the degree centrality are introduced including weighted ties possible for use of the analysis of co-authorship or citation networks. Both co-authorship relations and citations are well quantified data (weighted ties). These new measures are applied to a co-authorship network as an example.
citation impact, citation linking, webometrics
Better Approximation of Betweenness Centrality
Robert Geiberger, Peter Sanders, Dominik Schultes
Workshop on Algorithm Engineering \& Experiments(SIAM2008)(2008), pp.90--100
Betweenness 中心性の近似値解のアルゴリズムの提案.
betweenness, centrality