Sciweavers

Share
JSCIC
2010
104views more  JSCIC 2010»
9 years 6 months ago
The Kemeny Constant for Finite Homogeneous Ergodic Markov Chains
A quantity known as the Kemeny constant, which is used to measure the expected number of links that a surfer on the World Wide Web, located on a random web page, needs to follow b...
M. Catral, Stephen J. Kirkland, M. Neumann, N.-S. ...
DMTCS
2010
150views Mathematics» more  DMTCS 2010»
9 years 9 months ago
The expected number of inversions after n adjacent transpositions
We give a new expression for the expected number of inversions in the product of
Mireille Bousquet-Mélou
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
9 years 11 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
RSA
2000
112views more  RSA 2000»
9 years 11 months ago
Growth of components in random graphs
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Svante Janson
JCO
2007
123views more  JCO 2007»
9 years 11 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
IJNSEC
2007
127views more  IJNSEC 2007»
9 years 11 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
SIAMDM
2008
83views more  SIAMDM 2008»
9 years 11 months ago
Combinatorial Properties of a Rooted Graph Polynomial
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
David Eisenstat, Gary Gordon, Amanda Redlich
DCG
2010
118views more  DCG 2010»
9 years 12 months ago
Recurrence Relationships for the Mean Number of Faces and Vertices for Random Convex Hulls
: This paper studies the convex hull of n random points in Rd. A recently-proved topological identity of the author is used in combination with identities of Efron and Buchta to fi...
Richard Cowan
CORR
2008
Springer
110views Education» more  CORR 2008»
9 years 12 months ago
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications
Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...
David L. Donoho, Jared Tanner
SODA
1993
ACM
94views Algorithms» more  SODA 1993»
10 years 1 months ago
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
Alan M. Frieze, A. J. Radcliffe, Stephen Suen
books