WorldCat Identities

Mihail, Milena

Overview
Works: 9 works in 14 publications in 1 language and 25 library holdings
Roles: Author
Classifications: TK7885.A1,
Publication Timeline
.
Most widely held works by Milena Mihail
Connectivity properties of matroids by Milena Mihail( Book )

2 editions published in 1991 in English and held by 6 WorldCat member libraries worldwide

Moreover, it shows that the connected components of the restricted bases-exchange graph satisfy a 'ratios-condition', namely, that the ratio of the number of bases containing e to the number of bases not containing e is the same for each connected component of the restricted bases-exchange graph. We further show that if a more general ratios- condition is also true, namely, that any fraction [alpha] of the bases containing e is adjacent to at least a fraction [alpha] of the bases not containing e (where [alpha] is any real number between 0 and 1), then the bases-exchange graph has the following expansion property: 'For any bipartition of its vertices, the number of edges incident to both partition classes is at least as large as the size of the smaller partition'
The approximation of the permanent is still open : a flaw in Broder's proof by Milena Mihail( Book )

2 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide

On coupling and the approximation of the permanent by Milena Mihail( Book )

2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide

Conductance and convergence of Markov chains by Milena Mihail( Book )

2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide

Abstract: "Let P be an irreducible and strongly aperiodic (i.e. p[subscript ii] [greater than or equal to] 1/2 [for all] i) stochastic matrix. We obtain non-asymptotic bounds for the convergence rate of a Markov chain with transition matrix P in terms of the conductance of P. These results have been so far obtained only for time-reversible Markov chains via partially linear algebraic arguments [Al86][A87][SJ87]. Our proofs eliminate the linear algebra and therefore naturally extend to general Markov chains. The key new idea is to view the action of a strongly aperiodic stochastic matrix as a weighted averaging along the edges of the underlying graph of P. Our results suggest that the conductance (rather than the second largest eigenvalue) best quantifies the rate of convergence of stongly aperiodic Markov chains."
On the magnification of 0-1 polytopes by Milena Mihail( Book )

2 editions published between 1988 and 1989 in English and held by 3 WorldCat member libraries worldwide

Monte Carlo and Markov chain techniques for network reliability and sampling by Adam Louis Buchsbaum( Book )

1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide

As an example, we present the results of our experiments on a network that was posed for analysis by Applied Research at Bellcore: We estimated all single-edge parameters on a single DEC-5000 in less than 4 hours. The software that supported our experiments involves approximately 3000 lines of C-code and is easy to adapt to other applications."
On the number of Eulerian orientations of a graph by Milena Mihail( )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer( )

1 edition published in 1996 in English and held by 1 WorldCat member library worldwide

Learning the Fourier spectrum of probabilistic lists and trees by William Aiello( )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.78 (from 0.69 for Monte Carl ... to 0.99 for On the num ...)

Languages
English (14)