Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
RSA
2010
106views more  RSA 2010»
10 years 8 months ago
Thermodynamic limit for large random trees
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
Yuri Bakhtin
RSA
2010
118views more  RSA 2010»
10 years 8 months ago
Asymptotic equivalence and contiguity of some random graphs
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
Svante Janson
RSA
2010
98views more  RSA 2010»
11 years 1 days ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
RSA
2010
99views more  RSA 2010»
11 years 1 days ago
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
RSA
2010
104views more  RSA 2010»
11 years 1 days ago
An approximation algorithm for counting contingency tables
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...
RSA
2010
89views more  RSA 2010»
11 years 1 days ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
RSA
2010
78views more  RSA 2010»
11 years 1 days ago
Chasing robbers on random graphs: Zigzag theorem
Tomasz Luczak, Pawel Pralat
RSA
2010
81views more  RSA 2010»
11 years 1 days ago
Percolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation...
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Ri...
RSA
2010
94views more  RSA 2010»
11 years 1 days ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
RSA
2010
108views more  RSA 2010»
11 years 1 days 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
books