Sciweavers

712 search results - page 86 / 143
» A mixture model for random graphs
Sort
View
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
14 years 1 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
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
INFOCOM
2007
IEEE
14 years 2 months ago
Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
CN
2008
108views more  CN 2008»
13 years 8 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
WEBI
2005
Springer
14 years 1 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...