Sciweavers

104 search results - page 7 / 21
» Limit distribution of degrees in random family trees
Sort
View
RSA
2010
108views more  RSA 2010»
13 years 5 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CPC
2004
76views more  CPC 2004»
13 years 7 months ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
Kate Morris, Alois Panholzer, Helmut Prodinger
CORR
2006
Springer
77views Education» more  CORR 2006»
13 years 7 months ago
Generalized Entropy Power Inequalities and Monotonicity Properties of Information
New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n ...
Mokshay M. Madiman, Andrew R. Barron
IPPS
2008
IEEE
14 years 1 months ago
Self-optimizing distributed trees
We present a novel protocol for restructuring a treebased overlay network in response to the workload of the application running over it. Through low-cost restructuring operations...
Michael K. Reiter, Asad Samar, Chenxi Wang