WorldCat Identities

Benjamini, Itai

Overview
Works: 16 works in 41 publications in 2 languages and 549 library holdings
Roles: Author, Editor
Classifications: QA276, 519.5
Publication Timeline
.
Most widely held works by Itai Benjamini
Selected works of Oded Schramm by Oded Schramm( )
12 editions published in 2011 in English and held by 386 WorldCat member libraries worldwide
This volume is dedicated to the memory of the late Oded Schramm (1961-2008), distinguished statistician. Throughout his life, Oded made profound and beautiful contributions to mathematics that will have a lasting influence. In these two volumes, Editors Itai Benjamini and Olle Haggstrom have collected some of his papers, supplemented with three survey papers by Steffen Rohde, Haggstrom and Cristophe Garban that further elucidate his work. The papers within are a representative collection that shows the breadth, depth, enthusiasm and clarity of his work, with sections on Geometry, Noise Sensiti
Coarse geometry and randomness : École d'Été de Probabilitiés de Saint-Flour XLI - 2011 by Itai Benjamini( )
9 editions published in 2013 in English and held by 113 WorldCat member libraries worldwide
These lecture notes study the interplay between randomness and geometry of graphs. The first part of the notes reviews several basic geometric concepts, before moving on to examine the manifestation of the underlying geometry in the behavior of random processes, mostly percolation and random walk. The study of the geometry of infinite vertex transitive graphs, and of Cayley graphs in particular, is fairly well developed. One goal of these notes is to point to some random metric spaces modeled by graphs that turn out to be somewhat exotic, that is, they admit a combination of properties not encountered in the vertex transitive world. These include percolation clusters on vertex transitive graphs, critical clusters, local and scaling limits of graphs, long range percolation, CCCP graphs obtained by contracting percolation clusters on graphs, and stationary random graphs, including the uniform infinite planar triangulation (UIPT) and the stochastic hyperbolic planar quadrangulation (SHIQ)
Coarse geometry and randomness by Itai Benjamini( Book )
2 editions published in 2013 in English and held by 12 WorldCat member libraries worldwide
These lecture notes study the interplay between randomness and geometry of graphs. The first part of the notes reviews several basic geometric concepts, before moving on to examine the manifestation of the underlying geometry in the behavior of random processes, mostly percolation and random walk. The study of the geometry of infinite vertex transitive graphs, and of Cayley graphs in particular, is fairly well developed. One goal of these notes is to point to some random metric spaces modeled by graphs that turn out to be somewhat exotic, that is, they admit a combination of properties not encountered in the vertex transitive world. These include percolation clusters on vertex transitive graphs, critical clusters, local and scaling limits of graphs, long range percolation, CCCP graphs obtained by contracting percolation clusters on graphs, and stationary random graphs, including the uniform infinite planar triangulation (UIPT) and the stochastic hyperbolic planar quadrangulation (SHIQ)
Noise sensitivity of Boolean functions and applications to percolation by Itai Benjamini( Book )
2 editions published in 1999 in English and held by 7 WorldCat member libraries worldwide
Selected works by Oded Schramm( )
1 edition published in 2011 in English and held by 6 WorldCat member libraries worldwide
Noise sensitivity of Boolean functions and applications to percolation. A 1-homotopy theory of schemes / by Fabien Morel ; Vladimir Voevodsky [u.a.] by Itai Benjamini( Book )
1 edition published in 2001 in English and held by 5 WorldCat member libraries worldwide
Examples of simply-connected Liouville manifolds with positive spectrum by Itai Benjamini( )
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
Percolation of arbitrary words in (01) by Itai Benjamini( )
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
Heat kernel lower bounds on Riemanian manifolds using the old ideas of Nash by Itai Benjamini( )
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
Heat kernel bounds on Riemanian manifolds by Itai Benjamini( )
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
Martin capacity for Markov chains and random walks in varying dimensions by Itai Benjamini( Book )
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
<> ( Book )
1 edition published in 1992 in Hebrew and held by 2 WorldCat member libraries worldwide
<> ( Book )
1 edition published in 1992 in Hebrew and held by 1 WorldCat member library worldwide
On random graph homomorphisms into Z by Itai Benjamini( Book )
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Selected Works of Oded Schramm, Volume 1 ( )
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
Mixing times of the biased card shuffling and the asymmetric exclusion process by Itai Benjamini( )
1 edition published in 2005 in Undetermined and held by 1 WorldCat member library worldwide
Consider the following method of card shuffling. Start with a deck of N cards numbered 1 through N. Fix a parameter p between 0 and 1. In this model a "shuffle" consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p. If the coin comes up heads, then we arrange the two cards so that the lower-numbered card comes before the higher-numbered card. If the coin comes up tails, then we arrange the cards with the higher-numbered card first. In this paper we prove that for all p ≠ 1/2, the mixing time of this card shuffling is O(N^2), as conjectured by Diaconis and Ram (2000). Our result is a rare case of an exact estimate for the convergence rate of the Metropolis algorithm. A novel feature of our proof is that the analysis of an infinite (asymmetric exclusion) process plays an essential role in bounding the mixing time of a finite process
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.70 (from 0.00 for Noise sens ... to 0.92 for Heat kerne ...)
Languages
English (38)
Hebrew (2)