東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Logarithmic combinatorial structures...

Arratia, Richard,

Linked to FindBook

Google Book

Amazon

博客來

Logarithmic combinatorial structures: a probabilistic approach

Record Type:	Electronic resources : Monograph/item
Title/Author:	Logarithmic combinatorial structures: a probabilistic approach/ Richard Arratia, A. D. Barbour, Simon Tavaré
Author:	Arratia, Richard,
other author:	Barbour, A. D.,
Published:	Zuerich, Switzerland :European Mathematical Society Publishing House, : 2003,
Description:	1 online resource (374 pages)
Subject:	Probability & statistics -
Online resource:	https://doi.org/10.4171/000
Online resource:	https://www.ems-ph.org/img/books/arratia_mini.jpg
ISBN:	9783037195000

Logarithmic combinatorial structures: a probabilistic approach
Arratia, Richard,

Logarithmic combinatorial structures: a probabilistic approach[electronic resource] /Richard Arratia, A. D. Barbour, Simon Tavaré - Zuerich, Switzerland :European Mathematical Society Publishing House,2003 - 1 online resource (374 pages) - EMS Monographs in Mathematics (EMM) ;2523-5192.

Restricted to subscribers:https://www.ems-ph.org/ebooks.php

The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible factors, mappings into connected components. In all of these examples, and in many more, there are strong similarities between the numbers of components of different sizes that are found in the decompositions of `typical' elements of large size. For instance, the total number of components grows logarithmically with the size of the element, and the size of the largest component is an appreciable fraction of the whole. This book explains the similarities in asymptotic behaviour as the result of two basic properties shared by the structures: the conditioning relation and the logarithmic condition. The discussion is conducted in the language of probability, enabling the theory to be developed under rather general and explicit conditions; for the finer conclusions, Stein's method emerges as the key ingredient. The book is thus of particular interest to graduate students and researchers in both combinatorics and probability theory.

ISBN: 9783037195000

Standard No.: 10.4171/000doiSubjects--Topical Terms:

3480817
Probability & statistics

Logarithmic combinatorial structures: a probabilistic approach
LDR:02252nmm a22003255a 4500 001 2233132
003 CH-001817-3
005 20210304234502.0
006 a fot ||| 0|
007 cr nn mmmmamaa
008 210928e20031215sz fot ||| 0|eng d
020 $a 9783037195000
024 7 0 $a 10.4171/000 $2 doi
035 $a 15-210304
040 $a ch0018173
072 7 $a PBT $2 bicssc
072 7 $a PBF $2 bicssc
072 7 $a PBR $2 bicssc
084 $a 60-xx $a 11-xx $a 12-xx $2 msc
100 1 $a Arratia, Richard, $e author. $3 3480814
245 1 0 $a Logarithmic combinatorial structures: a probabilistic approach $h [electronic resource] / $c Richard Arratia, A. D. Barbour, Simon Tavaré
260 3 $a Zuerich, Switzerland : $b European Mathematical Society Publishing House, $c 2003
300 $a 1 online resource (374 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 0 $a EMS Monographs in Mathematics (EMM) ; $x 2523-5192
506 1 $a Restricted to subscribers: $u https://www.ems-ph.org/ebooks.php
520 $a The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible factors, mappings into connected components. In all of these examples, and in many more, there are strong similarities between the numbers of components of different sizes that are found in the decompositions of `typical' elements of large size. For instance, the total number of components grows logarithmically with the size of the element, and the size of the largest component is an appreciable fraction of the whole. This book explains the similarities in asymptotic behaviour as the result of two basic properties shared by the structures: the conditioning relation and the logarithmic condition. The discussion is conducted in the language of probability, enabling the theory to be developed under rather general and explicit conditions; for the finer conclusions, Stein's method emerges as the key ingredient. The book is thus of particular interest to graduate students and researchers in both combinatorics and probability theory.
650 0 7 $a Probability & statistics $2 bicssc $3 3480817
650 0 7 $a Algebra $v Congresses. $3 1533629
650 0 7 $a Number theory $v Problems, exercises, etc. $3 1232300
650 0 7 $a Probability theory and stochastic processes $2 msc $3 3480818
650 0 7 $a Field theory and polynomials $2 msc $3 3480819
700 1 $a Barbour, A. D., $e author. $3 3480815
700 1 $a Tavaré, Simon, $e author. $3 3480816
856 4 0 $u https://doi.org/10.4171/000
856 4 2 $3 cover image $u https://www.ems-ph.org/img/books/arratia_mini.jpg