Results 1  10
of
345
A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities
, 1993
"... ..."
Construction of asymptotically good, lowrate errorcorrecting codes through pseudorandom graphs
 IEEE Transactions on Information Theory
, 1992
"... A new technique, based on the pseudorandom properties of certain graphs, known as expanders, is used to obtain new simple explicit constructions of asymptotically good codes. In one of the constructions, the expanders are used to enhance Justesen codes by replicating, shuffling and then regrouping ..."
Abstract

Cited by 115 (22 self)
 Add to MetaCart
A new technique, based on the pseudorandom properties of certain graphs, known as expanders, is used to obtain new simple explicit constructions of asymptotically good codes. In one of the constructions, the expanders are used to enhance Justesen codes by replicating, shuffling and then regrouping the code coordinates. For any fixed (small) rate, and for sufficiently large alphabet, the codes thus obtained lie above the Zyablov bound. Using these codes as outer codes in a concatenated scheme, a second asymptotic good construction is obtained which applies to small alphabets (say, GF (2)) as well. Although these concatenated codes lie below Zyablov bound, they are still superior to previouslyknown explicit constructions in the zerorate neighborhood.
Inverting Sampled Traffic
 In Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
, 2003
"... Routers have the ability to output statistics about packets and flows of packets that traverse them. Since however the generation of detailed tra#c statistics does not scale well with link speed, increasingly routers and measurement boxes implement sampling strategies at the packet level. In this pa ..."
Abstract

Cited by 95 (1 self)
 Add to MetaCart
(Show Context)
Routers have the ability to output statistics about packets and flows of packets that traverse them. Since however the generation of detailed tra#c statistics does not scale well with link speed, increasingly routers and measurement boxes implement sampling strategies at the packet level. In this paper we study both theoretically and practically what information about the original tra#c can be inferred when sampling, or `thinning', is performed at the packet level. While basic packet level characteristics such as first order statistics can be fairly directly recovered, other aspects require more attention. We focus mainly on the spectral density, a second order statistic, and the distribution of the number of packets per flow, showing how both can be exactly recovered, in theory. We then show in detail why in practice this cannot be done using the traditional packet based sampling, even for high sampling rate. We introduce an alternative flow based thinning, where practical inversion is possible even at arbitrarily low sampling rate. We also investigate the theory and practice of fitting the parameters of a Poisson cluster process, modelling the full packet tra#c, from sampled data.
Kerov’s central limit theorem for the Plancherel measure on Young diagrams
, 2003
"... Consider random Young diagrams with fixed number n of boxes, distributed according to the Plancherel measure Mn. That is, the weight Mn(λ) of a diagram λ equals dim 2 λ/n!, where dim λ denotes the dimension of the irreducible representation of the symmetric group Sn indexed by λ. As n → ∞, the boun ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
Consider random Young diagrams with fixed number n of boxes, distributed according to the Plancherel measure Mn. That is, the weight Mn(λ) of a diagram λ equals dim 2 λ/n!, where dim λ denotes the dimension of the irreducible representation of the symmetric group Sn indexed by λ. As n → ∞, the boundary of the (appropriately rescaled) random shape λ concentrates near a curve Ω (Logan– Shepp 1977, Vershik–Kerov 1977). In 1993, Kerov announced a remarkable theorem describing Gaussian fluctuations around the limit shape Ω. Here we propose a reconstruction of his proof. It is largely based on Kerov’s unpublished work notes, 1999.
Performance and Reliability Analysis Using Directed Acyclic Graphs
 IEEE Trans. Software Eng
, 1987
"... AbstractA graphbased modeling technique has been developed for the stochastic analysis of systems containing concurrency. The basis of the technique is the use of directed acyclic graphs. These graphs represent eventprecedence networks where activities may occur serially, probabilistically, or co ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
(Show Context)
AbstractA graphbased modeling technique has been developed for the stochastic analysis of systems containing concurrency. The basis of the technique is the use of directed acyclic graphs. These graphs represent eventprecedence networks where activities may occur serially, probabilistically, or concurrently. When a set of activities occurs concurrently, the condition for the set of activities to complete is that a specified number of the activities must complete. This includes the special cases that one or all of the activities must complete. The cumulative distribution function associated with an activity is assumed to have exponential polynomial form. Further generality is obtained by allowing these distributions to have a mass at the origin and/or at infinity. The distribution function for the time taken to complete the entire graph is computed symbolically in the time parameter t. The technique allows two or more graphs to be combined hierarchically. Applications of the technique to the evaluation of concurrent program execution time and to the reliability analysis of faulttolerant systems are discussed. Index TermsAvailability, directed acyclic graphs, faulttolerance, Markov models, performance evaluation, program performance, reliability. I.
Coalescent Random Forests
 J. COMBINATORIAL THEORY A
, 1998
"... Various enumerations of labeled trees and forests, including Cayley's formula n n\Gamma2 for the number of trees labeled by [n], and Cayley's multinomial expansion over trees, are derived from the following coalescent construction of a sequence of random forests (R n ; R n\Gamma1 ; : ..."
Abstract

Cited by 39 (18 self)
 Add to MetaCart
Various enumerations of labeled trees and forests, including Cayley's formula n n\Gamma2 for the number of trees labeled by [n], and Cayley's multinomial expansion over trees, are derived from the following coalescent construction of a sequence of random forests (R n ; R n\Gamma1 ; : : : ; R 1 ) such that R k has uniform distribution over the set of all forests of k rooted trees labeled by [n]. Let R n be the trivial forest with n root vertices and no edges. For n k 2, given that R n ; : : : ; R k have been defined so that R k is a rooted forest of k trees, define R k\Gamma1 by addition to R k of a single edge picked uniformly at random from the set of n(k \Gamma 1) edges which when added to R k yield a rooted forest of k \Gamma 1 trees. This coalescent construction is related to a model for a physical process of clustering or coagulation, the additive coalescent in which a system of masses is subject to binary coalescent collisions, with each pair of masses of magnitude...
A recurrence related to trees
 Proceedings of the American Mathematical Society
, 1989
"... Abstract. The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer c ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
(Show Context)
Abstract. The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer coefficients, which may be called the "tree polynomials." There are n" ~ (n 1)! sequences of edges between vertices (0.1) ux—vx.un_x—vn_x, \<uk<vk<n, that define a free tree on {1,...,«}, because there are n" ~ free trees on n labeled vertices and every such tree has n 1 edges. If we consider each of these n (n — 1)! sequences to be equally likely, the probability that unX and vn_x belong respectively to components of sizes k and n k based on the first « 2 edges is '^oer^r'■•<*< • ■ Knuth and Schönhage [9, §§912] considered treeconstruction algorithms whose analysis depended on the solution of the recurrence (°3) Xn=Cn+ E Pnk(xk+Xnk) 0<k<n for various sequences (cn). The purpose of the present note is to extend the results of [9] and to consider related sequences of functions whose exact and asymptotic values arise in a variety of algorithms. Much of the analysis below, as in [9], depends on properties of the formal power series tt\A \ TV \ \r^n"~[z " 2, 3 3, 8 4, 125 5, (0.4) T(z) = ^ — — = z + z +z +^z + —z +■■ ■, n>l Received by the editors March 18, 1988.
A new matrix inverse
 PROC. AMER. MATH. SOC
, 1996
"... We compute the inverse of a specific infinitedimensional matrix, thus unifying a number of previous matrix inversions. Our inversion theorem is applied to derive a number of summation formulas of hypergeometric type. ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
We compute the inverse of a specific infinitedimensional matrix, thus unifying a number of previous matrix inversions. Our inversion theorem is applied to derive a number of summation formulas of hypergeometric type.