Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

COMBINATORICS
2002

favoriteEmaildiscussreport

84views more COMBINATORICS 2002»

Compositions of Random Functions on a Finite Set

13 years 4 months ago

Compositions of Random Functions on a Finite Set

Download www.maths.tcd.ie

If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average. Choose random functions f1, f2, f3, . . . independently and uniformly from among the nn functions from [n] into [n]. For t > 1, let gt = ft ft-1

Avinash Dalal, Eric Schmutz

Real-time Traffic

COMBINATORICS 2002 | Composite Function | Expected Value | Random Functions |

claim paper

Related Content

» A finite set of functions with an EXPTIMEcomplete composition problem

» MultiAccess MIMO Systems with Finite Rate Channel State Feedback

» Generation of Constants and Synchronization of Finite Automata

» Bayesian Filtering With Random Finite Set Observations

» Composing Schema Mappings SecondOrder Dependencies to the Rescue

» FiniteElement LevelSet Curve Particles

» Coalgebraic Logic and Synthesis of Mealy Machines

» Composition Does Not Imply Adaptive Security

» A Unified Approach for FiniteDimensional RareEvent Monte Carlo Simulation

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Avinash Dalal, Eric Schmutz

Comments (0)