Scale-Free 関連
A local-world evolving network model
Physica A 328 (2003), pp.274--286
We propose and study a novel evolving
network model with the new concept of local-world
connectivity, which exists in many physical complex
networks. The local-world evolving network model represents a
transition between power-law and exponential scaling, while
the Barabasi Albert scale-free model is only one of its
special (limiting) cases. We found that this local-world
evolving network model can maintain the robustness of
scale-free networks and can improve the network reliance
against intentional attacks, which is the inherent fragility
of most scale-free networks.
KW:Local-world; Scale-free; Exponential scaling; Synchronizability;Robustness
A generative model for feedback networks
arXiv:cond-mat/0508028 v1 (2005)
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
arXiv:cond-mat/0306439 v1(2003)
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
Physica A 315(2002) pp.677--690
KW: Scale-free random graphs; Real-world networks; Power laws
Boolean dynamics of networks with scale-free topology
Physica D 185(2003) pp.45--66
KW: Boolean networks; Scale-free topology; Dynamical phase transition; Stability; Evolvability
Complex networks and economics
Physica A 324 (2003) pp.396--401
KW: Business networks; Scale-free networks; Merger among banks
Complex topology in the highway network of Hungary, 1990 and 1998
Journal of Transport Geography (2001) pp.125--135
KW: Hungery; Network analysis; Planare graphs: Transition countries; Transportation
Deterministic scale-free networks
Physica A 299(2001) pp.559--564
KW: Disordered systems; Networks; Scale-free networks; Scaling
Distribution of infected mass in disease spreading in scale-free networks
Physica A 330 (2003) pp.117--123
KW: Scale-free networks; Spreading; SIR model; Infected mass
Eciency of scale-free networks: error and attack tolerance
Physica A 320 (2003) pp.622--642
KW: Structure of complex networks; Scale-free networks
Emergence of social conventions in
complex networks
Artificial Intelligence 141 (2002) pp.171--185
KW: Conventions; Emergent behavior; Coordination; Multi-agent systems
Epidemic outbreaks in complex heterogeneous networks
THE EUROPEAN
PHYSICAL JOURNAL B, 26 (2002) pp.521--529
SIR model
KW:
Evolution of the social network of
scientic collaborations
() pp.
KW: Random networks; Scaling; Small-word systems; Scale-free networks
Geographical embedding of scale-free networks
() pp.
KW: Internet; Scale-free; Networks; Embedding; Lattice
Growing networks with local rules:
preferential attachment, clustering hierarchy and degree correlations
arXiv:cond-mat/0211528 v2
KW::
Geometry of minimum spanningtrees on scale-free networks
Physica A 330 (2003) pp.31--36
KW:: Minimum spanningtrees; Random networks; Global optimization
Higher order clustering coeffcients in
Barabasi Albert networks
Physica A 316 (2002) pp.688--694
KW:: Disordered systems; Scale-free networks; Computer simulations
Is the Boston subway a small-world network?
Physica A 314 (2002) pp.109--113
KW:: Small-world networks; Transportation systems
Length ofoptimal path in random networks with strong disorder
Physica A 330 (2003) pp.246--252
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
PHYSICAL REVIEW E 69 (2004) 037103
KW::
Mean field solution of the Ising model on a Barabasi-Albert network
Physical Letters A 303(2002) pp.166-168
KW:: Curie temperature; Mean field approximation; Critical phenomena
Memory and Selectivity in Evolving Scale-Free Immune Networks
ICARIS 2003, LNCS 2787, (2003) pp.93--101
KW::
Modeling ofcontact tracing in social networks
Physica A 325 (2003) pp.33--39
KW:: Epidemics; SIR model; Networks
Network Dynamics and Field Evolution: The Growth of Interorganizational Collaboration in the Life Sciences
American Journal of Sociologys(Preprint) () pp.
KW::
On the Dynamics of Scale-Free Boolean Networks
WIRN VIETRI 2003, LNCS 2859 (2003) pp.43--49
KW::
Optimization of highway networks and traffic forecasting
Physica A 346 (2005) pp.165--173
KW:: Cellular automata; Modelling of traffic flow; Optimization
Packet transport andloadd istribution in scale-free network models
Physica A 318 (2003) pp.72--79
KW:: Scale-free networks; Loadd istributions
Pinning control of scale-free dynamical networks
Physica A 310 (2002) pp.521--531
KW:: Networks; Control; Stability; Scaling
Power-law distributions resulting from finite resources
Physica A 329 (2003) pp.499--508
KW::Power-law distribution; Zipf's law; Stochastic multiplicative process; Network; Internet
Relay network design in freight transportation systems
Transportation Research Part E 38 (2002) pp.405--422
KW:: Relay points; Freight transportation; Heuristics; Shortest path; Network
Scale-free behavior of the Internet global performance
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
Physica A 281 (2000) pp.69--77
KW:: Disordered systems; Networks; Random networks; Critical phenomena; Scaling; World-wide web
Scale-free networks in evolution
Physica A 325 (2003) pp.570--576
KW:: Evolution; Scale-free networks; Genealogy
Small-world properties of the Indian Railway network
Physical Review E 67, (2002), 036106
KW::
Small World Graphs by the iterated "My Friends are Your Friends" Principle
arXiv:cond-mat/0304563 v1 (2003)
KW::
The analogies of highway and computer network traffic
Physica A 307 (2002) pp.516--526
KW:: Complex systems; Cellular automata; Internet; TCP
The Link Prediction Problem for Social Networks
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
KW::
The Small-World Phenomenon: An Algorithmic Perspective
A version of this work appears as Cornell Computer Science Technical Report (1999) pp.
KW::
社会ネットワーク関連
A Faster Algorithm for Betweenness Centrality
Journal of Mathematical Sociology 25(2) (2001) pp.163--177
Betweenness の計算の高速化についてかかれた論文．
KW: Social networks, betweenness centrality, algorithms
A measure of centrality based on the network efficiency
() pp.
中心性の計算式の参考にした記憶がある
KW: Point Centrality, Valued Graphs, Centrality of Groups
Analyzing the dynamics in multilateral negotiations
() pp.
KW: Multilateral negotiations; Decision making; Phase-differences; Continuity of participation; Cluster analysis; Dynamic analysis
Approximate Connectivity Graph Generation in Mobile Ad Hoc Radio Networks
Proceedings of the 36th Annual Simulation Symposium (ANSS’03) (2003) pp.1--8
KW:
Computational complexity arising from degree correlations in networks
Physical Review E 67 (2003) 027101
KW:
An Ad Hoc Mobility Model Founded on Social Network Theory
MSWiM04 (2004) pp.20--24
KW: Mobility model, mobile ad hoc networking, social networks
Economic small-world behavior in weighted networks
THE EUROPEAN PHYSICAL JOURNAL B (2003) pp.249--263
KW:
Effects on reliability and validity of egocentered
network measurements
Social Networks 27 (2005) pp.205--229
KW: >Egocentered networks; Measurement; Reliability; Validity; Social support
Efficient Behavior of Small-World Networks
VOLUME 87, NUMBER 19 PHYSICAL REVIEW
LETTERS (2001) pp.198701-1 -- 1987-4
KW:
Ego network betweenness
Social Networks 27 (2005) pp.31--38
closeness centrality とか betweenness
centrality などを計算するには，ネットワーク全体の構造が既知で
ある必要がある．ただし，その様なことは現実には考えられない．そ
こで Ego-network の視点からの betweeness の計算方法を提案し，
現実の betweenness との違いを調べている．
KW:
Egocentric and sociocentric measures of network centrality
Social Networks 24 (2004) pp.407--422
KW: Centrality; Egocentric networks; Betweenness
Evolving Genetic Regulatory Networks Using an Artificial Genome
2nd Asia-Pacific Bioinformatics Conference (APBC2004) (2004) pp.291--296
KW:
Introducing small-world network effects to critical dynamics
FHYSICAL REVIEW E 67 (2003) 026125
KW:
Network Roubustness and Graph Topoloty
() pp.
KW: Network Centric Warfare, Network robustness, Graph connectivit
Network Topology Generators: Degree-Based vs. Structural
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
Social Networks (2005) pp.
KW:
社会ネットワーク分析
A measure of betweenness centrality based on random walks
Social Networks 27 (2005) pp.39--54
任意のノードからフローがダンダムに移動していることを想定して betweenness を計算する。例えば、二つのクリークが存在する間が２つ以上の経路で結ばれ、そのうち一つがとても長い経路であるばあい、一般的な betweenness の計算ではとても低い値しかでないが、ランダムなフローで考える場合にはある程度の利用が見込めることが示唆できる。
KW: Betweenness; Random walks; Current flow
A social network approach to estimating seroprevalence in the United States
Social Networks 20 (1998) pp.23--50
KW:
A Survey of Models of Network Formation: Stability and Efficiency
() 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
Social Networks 27 (2005) pp.139--153
KW: Social network research; Social research methods; Ethics; Instituation review boards
Actor network utilies and network evolution
Social Networks 27 (2005) pp.
KW: Social Network; Network evolution; Actor
A decision support system for rele discovery in social networks
Social Networks 21 (1999) pp.166--185
KW:
A mathematical model for interpersonal relationships in social networks
Social Networks 20 (1998) pp.179--196
KW:
ソーシャル・ネットワーク分析によるオンラインコミュニティの活性化の考察
社会情報学システム学シンポジウム () pp.
オンラインコミュニティの活性化の度合いを測るための指標を提案しているらしい。定量的なネットワーク分析にあわせて、発言者の内容の肯定度を調べることで、何かしたいらしい。具体的な内容は不明
KW: オンラインコミュニティ, ソーシャル
ネットワーク, ネットワーク分析, 内容分析
Analyzing the dynamics in multilateral negotiations
Social Networks 26 (2004) pp.141--154
KW: Multilateral negotiations; Decision Making; Phase-differens; Conitinuity of participation; Cluster analysis; Dynamic analysis
Another view of the "small world"
Social Networks 24 (2002) pp.121--133
KW: Small world; Acquaintance volume
Are social netowks technologically embedded? How netwoks are changing today with changes in communication technology
() pp.
KW: Information and communication technology; Tele-communication: Presence-absence
A structural event approach to the analysis of group composition
Social Networks 24 (2002) pp.136--160
KW: Small Groups; Statistical methodology; Homophily; Georg Simmel
Dynamic Highway-Node Routing
6th Workshop on Experimental and Efficient Algorithms.(WEA2007)(2007), pp.66--79
高速道路の分析といいつつ，国道も入っているのかな．イタリア全土の道路網を使っているので結構巨大なネットワークの媒介値(Betweeness)中心性を使っている様子．混雑とかでネットワークの状態が変わっても対応するとかあるけど，その分が betweenness の高速な近似解の計算手法の論文と関わってくるのかな．
betweenness, centrality
中心性関連
Centrality and Network flow
Social Networks 27 (2005) pp.55--71
KW: Centrality; Network flow; Typology
Ranking of Closeness Centrality for Large-Scale Social Networks
Frontiers of Algorithmics WorkShop 2008 (FAW2008) (2008) pp.186--195
KW:
A New Centrality Measure for Social Network Analysis Applicable to Bibliometric and Webometric Data
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
Workshop on Algorithm Engineering \& Experiments(SIAM2008)(2008), pp.90--100
Betweenness 中心性の近似値解のアルゴリズムの提案．
betweenness, centrality