Sciweavers

2310 search results - page 222 / 462
» Coloring Random Graphs
Sort
View
CPC
2002
95views more  CPC 2002»
13 years 8 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
RSA
2008
94views more  RSA 2008»
13 years 7 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 2 months ago
Average consensus over small world networks: A probabilistic framework
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
Pedram Hovareshti, John S. Baras, Vijay Gupta
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
14 years 2 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...
CPC
2011
219views Education» more  CPC 2011»
13 years 3 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson