Sciweavers

265 search results - page 1 / 53
» Generating an Assortative Network with a Given Degree Distri...
Sort
View
IJBC
2008
40views more  IJBC 2008»
13 years 8 months ago
Generating an Assortative Network with a Given Degree Distribution
Jin Zhou, Xiaoke Xu, Jie Zhang, Junfeng Sun, Micha...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
INFOCOM
2008
IEEE
14 years 2 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov
ECAL
2007
Springer
14 years 2 months ago
Information-Cloning of Scale-Free Networks
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
Piraveenan Mahendra, Mikhail Prokopenko, Albert Y....
IOR
2010
128views more  IOR 2010»
13 years 5 months ago
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. ...