BT Research at Martlesham, Suffolk
|
|
- Edward Gilmore
- 6 years ago
- Views:
Transcription
1 Connectivity of random graphs Keith Briggs research.btexact.com/teralab/keithbriggs.html Alan Turing Institute 2004 November typeset 2004 November 17 10:55 in pdflatex on a linux system Connectivity of random graphs 1 of 25
2 BT Research at Martlesham, Suffolk Cambridge-Ipswich high-tech corridor 2000 technologists 15 companies UCL, Univ of Essex Connectivity of random graphs 2 of 25
3 Graphs (simple unlabelled undirected) graph: (simple unlabelled undirected) connected graph: (simple undirected) labelled graph: 3 4 Connectivity of random graphs 3 of 25
4 The Bernoulli random graph model G{n, p} let G be a graph of n nodes let p = 1 q be the probability that each possible edge exists edge events are independent let P (n) be the probability that G{n, p} is connected then P (1) = 1 and P (n) = 1 n 1 ( n 1 ) k=1 k 1 P (k)q k(n k) for n = 2, 3, 4,.... P (1) = 1 P (2) = 1 q P (3) = (2 q+1) (q 1) 2 P (4) = ( 6 q 3 +6 q 2 +3 q+1 ) (1 q) 3 P (5) = ( 24 q q q q q 2 +4 q+1 ) (q 1) 4 as n, we have P (n) 1 nq n 1. Keith Briggs Connectivity of random graphs 4 of 25
5 Connectivity for the Bernoulli model 1.0 2,5,10,20,50,100,200 nodes 0.8 Pr[connected] p x-axis: log(n = number of nodes), n = 2,..., 100 y-axis: p, 0 at top, 1 at bottom blue=0 red=1 Keith Briggs Connectivity of random graphs 5 of 25
6 Probability of connectivity - the G(n, m) model problem: compute the numbers of connected labelled graphs with n nodes and m = n 1, n, n+1, n+2,... edges with this information, we can compute the probability of a randomly chosen labelled graph being connected compute large-n asymptotics for these quantities, where the number of edges is only slightly larger than the number of nodes I did some exact numerical calculations to try to establish the dominant asymptotics I then looked at some earlier papers and found that the required theory to compute exact asymptotics is known I computed the exact asymptotics and got perfect agreement with my exact numerical data Keith Briggs Connectivity of random graphs 6 of 25
7 The inspirational paper [fss04] Philippe Flajolet, Bruno Salvy and Gilles Schaeffer: Airy Phenomena and Analytic Combinatorics of Connected Graphs The claim: the number C(n, n+k) of labelled (étiquetés) connected graphs with n nodes and excess (edges-nodes) = k 2 is A k (1) π ( n e ) n ( n 2)3k 1 2 [ 1 Γ(3k/2) +A k (1)/A k(1) k 2 Γ((3k 1)/2) n +O ( ) ] 1 n k A k (1) 5/24 5/ / / / / / A k (1) 19/24 65/ / / / / /98304 Airy in Playford: ipswich/history/airys Country Retreat.htm Keith Briggs Connectivity of random graphs 7 of 25
8 Some problems with the paper I did some comparisons with exact counts for up to n = 1000 nodes and for excess k = 2, 3,..., 8 The exact data was computed from the generating functions The fit was very bad This formula was found to fit the data much better for k = 2: A k (1) ( [ )3k 1 πn n n Γ(3k/2) A k (1)/A ( ) ] k(1) k 2 1 Γ((3k 1)/2) n +O n Also, on pages 4 and 24, I think S should have the expansion 1 (5/4)α+(15/4)α Keith Briggs Connectivity of random graphs 8 of 25
9 Asymptotic expansion of C(n, n+k)/n n+3k 1 2 ξ 2π green: from [bcm90] red: from [fss04] (with removal of factor e) k type [n 0 ] [n 1/2 ] [n 1 ] [n 3/2 ] 1 tree unicycle ξ bicycle tricycle ξ ξ quadricycle pentacycle ξ π blue: conjectured by KMB from numerical experiments k type [n 0 ] [n 1/2 ] [n 1 ] [n 3/2 ] [n 2 ] [n 5/2 ] 0 unicycle ξ ξ bicycle 5 24 ξ ξ ? ξ ? 2 tricycle ξ ξ quadricycle ξ Keith Briggs Connectivity of random graphs 9 of 25
10 Counting Given a finite set S, how many elements S does it have? The classical method for computing S : S = x S 1 Keith Briggs Connectivity of random graphs 10 of 25
11 Definitions of generating functions generating function (gf): {a 1, a 2, a 3,... } k=1 a k x k exponential generating function (egf): {a 1, a 2, a 3,... } k=1 a k k! xk Keith Briggs Connectivity of random graphs 11 of 25
12 Exponential generating functions exponential generating function for all labelled graphs: g(w, z) = n=0 (1+w) (n 2) z n /n! exponential generating function for all connected labelled graphs: c(w, z) = log(g(w, z)) = z+w z2 2 +(3w2 +w 3 ) z3 6 +(16w3 +15w 4 +6w 5 +w 6 ) z4 4! +... Keith Briggs Connectivity of random graphs 12 of 25
13 rooted labelled trees egfs for labelled graphs [jklp93] T (z) = z exp(t (z)) = n n 1zn n! = z+ 2 2! z ! z3 + unrooted labelled trees W 1 (z) = T (z) T (z) 2 /2 = z+ 1 2! z ! z ! z unicyclic labelled graphs W 0 (z) = 1 [ ] 2 log T (z) 2 T (z) 1 4 T (z)2 = 1 3! z ! z ! z ! z 6 +. bicyclic labelled graphs W 1 (z) = T (z)4( 6 T (z) ) 24 ( 1 T (z) ) 3 = 6 4! z ! z ! z Keith Briggs Connectivity of random graphs 13 of 25
14 Theory 1 The previous observations can be proved using theory available in [jklp93] and [fgkp95]. I sketch the computations. Ramanujan's Q-function is defined for n = 1, 2, 3,... : Q(n) k=1 n k n k = 1+n 1 n +(n 1)(n 2) +... n 2 n=1 Q(n)nn 1zn n! = log(1 T (z)) here T is the egf for rooted labelled trees: T (z) = n=1 nn 1 n! z n T (z) = z exp(t (z)) Keith Briggs Connectivity of random graphs 14 of 25
15 Theory 2 to get the large-n asymptotics of Q, we first consider the related function R(n) 1+ n n+1 + n 2 (n+1)(n+2) +..., n = 1, 2, 3,... we have Q(n)+R(n) = n! e n /n n let D(n) = R(n) Q(n) zn (1 T (z))2 n=1 D(n)nn 1 n! = log[ 2(1 ez) ] D(n) k=1 c(k)[zn ](T (z) 1) k, where c(k) [δ k ] log(δ 2 /2/(1 (1+δ)e δ )) this gives D(n) n n n n n 5 + O ( n 6) now using Q(n) = (n! e n /n n D(n))/2, we get Q(n) 1 2 n1/2 2π πn 1/ πn 5/ n πn 7/ πn 11/2 +O ( n 6) n πn 3/ n n n πn 9/2 Keith Briggs Connectivity of random graphs 15 of 25
16 Theory 3 Let W k be the egf for connected labelled (k+1)-cyclic graphs for unrooted trees W 1 (z) = T (z) T 2 (z)/2, [z n ]W 1 (z) = n n 2 for unicycles W 0 (z) = (log(1 T (z))+t (z)+t 2 (2)/2)/2 for bicycles W 1 (z) = 6T 4 (z) T 5 (z) 24(1 T (z)) 3 for k 1, W k (z) = results in [jklp93] A k (T (z)) (1 T (z)) 3k, where A k are polynomials computable from Knuth and Pittel's tree polynomials t n (y) (y 0) are defined by (1 T (z)) y = n=0 t n(y) zn n! we can compute these for y > 0 from t n (1) = 1; t n (2) = n n (1+Q(n)); t n (y+2) = n t n (y)/y+t n (y+1) thanks to this recurrence, the asymptotics for t n the known asymptotics of Q follow from Keith Briggs Connectivity of random graphs 16 of 25
17 Theory 4 Let ξ = 2π. All results agree with numerical estimates on this page. the number of connected unicycles is C(n, n) = n![z n ]W 0 (z) = 1 2 Q(n)nn 1 +3/2+t n ( 1) t n ( 2)/4 C(n,n) n n 1 4 ξn 1/2 7 6 n ξn 3/ n ξn 5/ n ξ ( n 1) 9/ n ξn 11/2 +O ( n 6) 2835 n ξn 7/2 + the number of connected bicycles is C(n, n+1)=n![z n ]W 1 (z)= 5 24 t n(3) t n(2) t n(1) 7 12 t n(0) t n( 1) t n( 2) C(n,n+1) n n 5 24 n 7 24 ξn1/ ξn 1/ n ξn 3/ n ξn 5/ n ξn 7/ n ξn 9/ n ξn 11/2 +O ( n 6) similarly, for the number of connected tricycles we get C(n,n+2) n n ξn5/ n ξn3/ n 1 +O (n 3/2) n ξn1/ ξn 1/2 + Keith Briggs Connectivity of random graphs 17 of 25
18 Probability of connectivity 1 we now have all the results needed to calculate the asymptotic probability P (n, n+k) that a randomly chosen graph with n nodes and n+k edges is connected (for n and small fixed k) the total number of graphs is g(n, n+k) ( ( n ) 2) n+k. This can be asymptotically expanded: g(n,n 1) 2π e n 2 ( n 2 ) n n 3/ n n n n n n 6 +O ( n 7) g(n,n+0) 2π e n 2 ( n 2 ) n 1 n 1/ n n n n n n n 7 +O ( n 8) g(n,n+1) 2π e n 2 ( n 2 ) n 1 n 3/ n n n n n n n n 8 +O ( n 9)... g(n, n+k) 2 π en 2( ) n nn k 1/2 ( 2 2 k 1 +O(n 1 ) ) Keith Briggs Connectivity of random graphs 18 of 25
19 P (n,n 1) 2 n e 2 n n 1/2 ξ n n Probability of connectivity n n n n n 7 +O ( n 8) check: n = 10, exact= , asymptotic= P (n,n+0) 2 n e 2 n ξ 1 4 ξ 7 6 n 1/ ξn n 3/ ξn 2 +O ( n 3) check: n = 10, exact=0.276, asymptotic=0.319 P (n,n+1) 2 n e 2 n n 1/2 ξ ξn 1/ n ξn 3/ n ξn 5/2 + O ( n 3) check: n = 10, exact=0.437, asymptotic=0.407 check: n = 20, exact= , asymptotic= check: n = 100, exact= , asymptotic= Keith Briggs Connectivity of random graphs 19 of 25
20 Example of unlabelled case - unicycles for n = 7 Unicyclic graphs - 7 nodes Keith Briggs 2004 Sep 05 09: Keith Briggs Connectivity of random graphs 20 of 25
21 The unlabelled case - unicycles Christian Bower's idea: A connected unicyclic graph is an undirected cycle of 3 or more rooted trees. Start with a single undirected cycle (or polygon) graph. It must have at least 3 nodes. Hanging from each node in the cycle is a tree (a tree is of course a connected acyclic graph). The node where the tree intersects the cycle is the root, thus it is (combinatorially) a rooted tree. A is undirected cycles of exactly 1 rooted tree A is undirected cycles of 3 or more rooted trees A is undirected cycles of exactly 2 rooted trees A is undirected cycles of 1 or more rooted trees this gives formulae which should be amenable to analysis, but let's first do some brute-force numerics to get a feel for the behaviour I calculated the counts up to n = nodes, and tried to guess the form of the asymptotic expansion and then the values of the coefficients Keith Briggs Connectivity of random graphs 21 of 25
22 Transforms A is undirected cycles of exactly 2 rooted trees A (x) = 1 ( A81 (x) 2 +A 81 (x 2 ) ) 2 A is undirected cycles of 1 or more rooted trees A (x) = 1 2 k=1 φ(k) k ( log(1 A81 (x k )) ) + 2A 81 (x)+a 81 (x) 2 +A 81 (x 2 ) 4(1 A 81 (x 2 )) A is undirected cycles of 3 or more rooted trees A 1429 (x) = A (x) A (x) A 81 (x) Keith Briggs Connectivity of random graphs 22 of 25
23 Asymptotics of A81 (unlabelled rooted trees) [fin03] d = A81(n) d n n 3/ n n n n n Keith Briggs Connectivity of random graphs 23 of 25
24 Asymptotics for unlabelled unicycles I get that the number c(n, n) of connected unlabelled unicyclic graphs behaves like ( c(n, n) d n 1 ) 4 n n 3/ n n 2 +O(n 3 ) the coefficients are poorly determined (unlike in a similar analysis of the labelled case) Keith Briggs Connectivity of random graphs 24 of 25
25 References [bcm90] E A Bender, E R Canfield & B D McKay: The asymptotic number of labeled connected graphs with a given number of vertices and edges, Random structures and algorithms 1, (1990) [slo03] N J A Sloane, ed. (2003), The on-line encyclopedia of integer sequences njas/sequences/ [jklp93] S Janson, D E Knuth, T Luczak & B G Pittel: The birth of the giant component Random Structures and Algorithms, 4, (1993) www-cs-faculty.stanford.edu/ knuth/papers/bgc.tex.gz [fss04] Philippe Flajolet, Bruno Salvy and Gilles Schaeffer: Airy Phenomena and Analytic Combinatorics of Connected Graphs 11/Abstracts/v11i1r34.html [gil59] E N Gilbert: Random graphs Ann. Math. Statist., 30, (1959) Keith Briggs Connectivity of random graphs 25 of 25
Enumerating connected labelled graphs
Enumerating connected labelled graphs Keith Briggs Keith.Briggs@bt.com more.btexact.com/people/briggsk2/ 2004 August 17 conn-lab-graphs.tex typeset 2004 August 17 10:40 in pdflatex on a linux system Enumerating
More informationNotes on combinatorial graph theory
Notes on combinatorial graph theory Keith Briggs Keith.Briggs@bt.com more.btexact.com/people/briggsk2/cgt.html CRG meeting 2004 Jan 19 Monday 15:00 comb-graph-th.tex typeset 2004 January 27 11:16 in pdflatex
More informationOn (Effective) Analytic Combinatorics
On (Effective) Analytic Combinatorics Bruno Salvy Inria & ENS de Lyon Séminaire Algorithmes Dec. 2017 Combinatorics, Randomness and Analysis From simple local rules, a global structure arises. A quest
More informationNotes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.
Lecture: Hélène Barcelo Analytic Combinatorics ECCO 202, Bogotá Notes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.. Tuesday, June 2, 202 Combinatorics is the study of finite structures that
More informationMapping the Discrete Logarithm: Talk 2
Mapping the Discrete Logarithm: Talk 2 Joshua Holden Joint work with Daniel Cloutier, Nathan Lindle (Senior Theses), Max Brugger, Christina Frederick, Andrew Hoffman, and Marcus Mace (RHIT REU) Rose-Hulman
More informationPermutations with Inversions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 4 2001, Article 01.2.4 Permutations with Inversions Barbara H. Margolius Cleveland State University Cleveland, Ohio 44115 Email address: b.margolius@csuohio.edu
More information3. Generating Functions
ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions http://aofa.cs.princeton.edu ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions OF OGFs Solving recurrences Catalan numbers EGFs Counting
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationFighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena.
Fighting Fish: enumerative properties Enrica Duchi IRIF, Université Paris Diderot Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena Gilles Schaeffer LIX, CNRS and École Polytechnique Séminaire
More informationarxiv: v1 [math.co] 24 Jul 2013
ANALYTIC COMBINATORICS OF CHORD AND HYPERCHORD DIAGRAMS WITH k CROSSINGS VINCENT PILAUD AND JUANJO RUÉ arxiv:307.6440v [math.co] 4 Jul 03 Abstract. Using methods from Analytic Combinatorics, we study the
More information5. Analytic Combinatorics
ANALYTIC COMBINATORICS P A R T O N E 5. Analytic Combinatorics http://aofa.cs.princeton.edu Analytic combinatorics is a calculus for the quantitative study of large combinatorial structures. Features:
More informationThe Gift Exchange Problem
The Gift Exchange Problem David Applegate and N. J. A. Sloane (a), AT&T Shannon Labs, 180 Park Ave., Florham Park, NJ 07932-0971, USA. (a) Corresponding author. Email: david@research.att.com, njas@research.att.com.
More informationANATOMY OF THE GIANT COMPONENT: THE STRICTLY SUPERCRITICAL REGIME
ANATOMY OF THE GIANT COMPONENT: THE STRICTLY SUPERCRITICAL REGIME JIAN DING, EYAL LUBETZKY AND YUVAL PERES Abstract. In a recent work of the authors and Kim, we derived a complete description of the largest
More information50 years of Linear Probing Hashing
50 years of Linear Probing Hashing Alfredo Viola Universidad de la República, Uruguay AofA 2013 Dedicated to Philippe Flajolet The problem. The table has m places to hash (park) from 0 to m 1, and n elements
More informationCounting set systems by weight
Counting set systems by weight Martin Klazar Institute for Theoretical Computer Science and Department of Applied Mathematics Charles University, Faculty of Mathematics and Physics Malostranské náměstí
More information6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes
6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes Daron Acemoglu and Asu Ozdaglar MIT September 16, 2009 1 Outline Erdös-Renyi random graph model Branching processes Phase transitions
More informationarxiv: v1 [math.co] 17 Dec 2007
arxiv:07.79v [math.co] 7 Dec 007 The copies of any permutation pattern are asymptotically normal Milós Bóna Department of Mathematics University of Florida Gainesville FL 36-805 bona@math.ufl.edu Abstract
More informationMorse functions statistics
P H A S I S Journal Program F U N C T I O N A L A N A L Y S I S and Other Mathematics, 006, 11, 97 103 Morse functions statistics Liviu I. Nicolaescu Abstract. We prove a conjecture of V. I. Arnold concerning
More informationAlmost all trees have an even number of independent sets
Almost all trees have an even number of independent sets Stephan G. Wagner Department of Mathematical Sciences Stellenbosch University Private Bag X1, Matieland 7602, South Africa swagner@sun.ac.za Submitted:
More informationAsymptotic properties of some minor-closed classes of graphs
FPSAC 2013 Paris, France DMTCS proc AS, 2013, 599 610 Asymptotic properties of some minor-closed classes of graphs Mireille Bousquet-Mélou 1 and Kerstin Weller 2 1 CNRS, LaBRI, UMR 5800, Université de
More informationDISCRETE AND ALGEBRAIC STRUCTURES
DISCRETE AND ALGEBRAIC STRUCTURES Master Study Mathematics MAT40 Winter Semester 015/16 (Due to organisational reasons register for the course at TU and KFU) Edited by Mihyun Kang TU Graz Contents I Lectures
More informationAsymptotic enumeration of correlation-immune functions
Asymptotic enumeration of correlation-immune functions E. Rodney Canfield Jason Gao Catherine Greenhill Brendan D. McKay Robert W. Robinson Correlation-immune functions 1 Correlation-immune functions Suppose
More informationForty years of tree enumeration
October 24, 206 Canada John Moon (Alberta) Counting labelled trees Canadian mathematical monographs What is our subject? Asymptotic enumeration or Probabilistic combinatorics? What is our subject? Asymptotic
More informationEnumeration of Chord Diagrams without Loops and Parallel Chords
Enumeration of Chord Diagrams without Loops and Parallel Chords Evgeniy Krasko Alexander Omelchenko St. Petersburg Academic University 8/3 Khlopina Street, St. Petersburg, 9402, Russia {krasko.evgeniy,
More informationRandom Graphs. EECS 126 (UC Berkeley) Spring 2019
Random Graphs EECS 126 (UC Bereley) Spring 2019 1 Introduction In this note, we will briefly introduce the subject of random graphs, also nown as Erdös-Rényi random graphs. Given a positive integer n and
More informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
More informationLIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES
LIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES ALOIS PANHOLZER AND GEORG SEITZ Abstract. We consider so-called simple families of labelled trees, which contain, e.g., ordered,
More informationFIBONACCI EXPRESSIONS ARISING FROM A COIN-TOSSING SCENARIO INVOLVING PAIRS OF CONSECUTIVE HEADS
FIBONACCI EXPRESSIONS ARISING FROM A COIN-TOSSING SCENARIO INVOLVING PAIRS OF CONSECUTIVE HEADS MARTIN GRIFFITHS Abstract. In this article we study a combinatorial scenario which generalizes the wellknown
More informationAnalytic combinatorics of chord and hyperchord diagrams with k crossings
Analytic combinatorics of chord and hyperchord diagrams with k crossings Vincent Pilaud, Juanjo Rué To cite this version: Vincent Pilaud, Juanjo Rué. Analytic combinatorics of chord and hyperchord diagrams
More informationPower Series Solutions We use power series to solve second order differential equations
Objectives Power Series Solutions We use power series to solve second order differential equations We use power series expansions to find solutions to second order, linear, variable coefficient equations
More informationA New Operation on Sequences: The Boustrophedon Transform
A New Operation on Sequences: The Boustrophedon Transform J. Millar, N. J. A. Sloane and N. E. Young Mathematical Sciences Research Center AT&T Bell Laboratories Murray Hill, New Jersey 07974 January 5,
More informationOn the threshold for k-regular subgraphs of random graphs
On the threshold for k-regular subgraphs of random graphs Pawe l Pra lat Department of Mathematics and Statistics Dalhousie University Halifax NS, Canada Nicholas Wormald Department of Combinatorics and
More informationCSCI3390-Second Test with Solutions
CSCI3390-Second Test with Solutions April 26, 2016 Each of the 15 parts of the problems below is worth 10 points, except for the more involved 4(d), which is worth 20. A perfect score is 100: if your score
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationA REFINED ENUMERATION OF p-ary LABELED TREES
Korean J. Math. 21 (2013), No. 4, pp. 495 502 http://dx.doi.org/10.11568/kjm.2013.21.4.495 A REFINED ENUMERATION OF p-ary LABELED TREES Seunghyun Seo and Heesung Shin Abstract. Let T n (p) be the set of
More informationCombinatorial/probabilistic analysis of a class of search-tree functionals
Combinatorial/probabilistic analysis of a class of search-tree functionals Jim Fill jimfill@jhu.edu http://www.mts.jhu.edu/ fill/ Mathematical Sciences The Johns Hopkins University Joint Statistical Meetings;
More informationNetworks: Lectures 9 & 10 Random graphs
Networks: Lectures 9 & 10 Random graphs Heather A Harrington Mathematical Institute University of Oxford HT 2017 What you re in for Week 1: Introduction and basic concepts Week 2: Small worlds Week 3:
More informationarxiv: v1 [math.co] 12 Sep 2018
ON THE NUMBER OF INCREASING TREES WITH LABEL REPETITIONS arxiv:809.0434v [math.co] Sep 08 OLIVIER BODINI, ANTOINE GENITRINI, AND BERNHARD GITTENBERGER Abstract. In this paper we study a special subclass
More informationPacking chromatic number of subcubic graphs
Packing chromatic number of subcubic graphs József Balogh Alexandr Kostochka Xujun Liu arxiv:1703.09873v2 [math.co] 30 Mar 2017 March 31, 2017 Abstract A packing k-coloring of a graph G is a partition
More informationRandom walks in the plane
Tulane University, New Orleans August 2, 2010 Joint work with: Jon Borwein Dirk Nuyens James Wan U. of Newcastle, AU K.U.Leuven, BE U. of Newcastle, AU We study random walks in the plane consisting of
More informationLimit Theorems in Probability and Number
Limit Theorems in Probability and Number Theory Paderborn, January 14-15, 2011 Limit Theorems in Probability and Number Theory V. V. Buldygin K.-H. Indlekofer O. I. Klesov J. G. Steinebach Limit theorems
More informationDigit Reversal Without Apology
Digit Reversal Without Apology Lara Pudwell Rutgers University Piscataway, NJ 08854 lpudwell@math.rutgers.edu In A Mathematician s Apology [1] G. H. Hardy states, 8712 and 9801 are the only four-figure
More informationThe Subtree Size Profile of Plane-oriented Recursive Trees
The Subtree Size Profile of Plane-oriented Recursive Trees Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan ANALCO11, January 22nd, 2011 Michael Fuchs (NCTU)
More informationTHE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH
THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH REMCO VAN DER HOFSTAD, MALWINA J. LUCZAK, AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n consists of the n 2 vertices
More informationContents. Counting Methods and Induction
Contents Counting Methods and Induction Lesson 1 Counting Strategies Investigations 1 Careful Counting... 555 Order and Repetition I... 56 3 Order and Repetition II... 569 On Your Own... 573 Lesson Counting
More informationSequences that satisfy a(n a(n)) = 0
Sequences that satisfy a(n a(n)) = 0 Nate Kube Frank Ruskey October 13, 2005 Abstract We explore the properties of some sequences for which a(n a(n)) = 0. Under the natural restriction that a(n) < n the
More informationENUMERATION RESULTS FOR ALTERNATING TREE FAMILIES
ENUMERATION RESULTS FOR ALTERNATING TREE FAMILIES MARKUS KUBA AND ALOIS PANHOLZER Abstract. We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationNonnegative k-sums, fractional covers, and probability of small deviations
Nonnegative k-sums, fractional covers, and probability of small deviations Noga Alon Hao Huang Benny Sudakov Abstract More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers
More informationAlgorithmic Tools for the Asymptotics of Linear Recurrences
Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon Computer Algebra in Combinatorics, Schrödinger Institute, Vienna, Nov. 2017 Motivation p 0 (n)a n+k + + p k (n)a
More informationConjecture 4. f 1 (n) = n
26 International Conference on Computational Science and Computational Intelligence Computation in the Enumeration of Integer Matrices Shanzhen Gao, Keh-Hsun Chen Department of Computer Science, College
More informationGENERALIZATION OF UNIVERSAL PARTITION AND BIPARTITION THEOREMS. Hacène Belbachir 1
#A59 INTEGERS 3 (23) GENERALIZATION OF UNIVERSAL PARTITION AND BIPARTITION THEOREMS Hacène Belbachir USTHB, Faculty of Mathematics, RECITS Laboratory, Algiers, Algeria hbelbachir@usthb.dz, hacenebelbachir@gmail.com
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 016-017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations, 1.7.
More informationTHE DEGREE DISTRIBUTION OF RANDOM PLANAR GRAPHS
THE DEGREE DISTRIBUTION OF RANDOM PLANAR GRAPHS Michael Drmota joint work with Omer Giménez and Marc Noy Institut für Diskrete Mathematik und Geometrie TU Wien michael.drmota@tuwien.ac.at http://www.dmg.tuwien.ac.at/drmota/
More informationShort cycles in random regular graphs
Short cycles in random regular graphs Brendan D. McKay Department of Computer Science Australian National University Canberra ACT 0200, Australia bdm@cs.anu.ed.au Nicholas C. Wormald and Beata Wysocka
More informationNP Completeness. CS 374: Algorithms & Models of Computation, Spring Lecture 23. November 19, 2015
CS 374: Algorithms & Models of Computation, Spring 2015 NP Completeness Lecture 23 November 19, 2015 Chandra & Lenny (UIUC) CS374 1 Spring 2015 1 / 37 Part I NP-Completeness Chandra & Lenny (UIUC) CS374
More informationCOUNTING WITH AB-BA=1
COUNTING WITH AB-BA=1 PHILIPPE FLAJOLET, ROCQUENCOURT & PAWEL BLASIAK, KRAKÓW COMBINATORIAL MODELS OF ANNIHILATION-CREATION ; IN PREP. (2010) 1 A. = + + B. = 2 Annihilation and Creation A = Annihilate
More informationFinite-Size Scaling in Percolation
Microsoft Tech Report MSR-TR-98-27 Finite-Size Scaling in Percolation J. T. Chayes Microsoft Research Redmond, WA 98052 Abstract. This work is a detailed study of the phase transition in percolation, in
More informationAsymptotics of Integrals of. Hermite Polynomials
Applied Mathematical Sciences, Vol. 4, 010, no. 61, 04-056 Asymptotics of Integrals of Hermite Polynomials R. B. Paris Division of Complex Systems University of Abertay Dundee Dundee DD1 1HG, UK R.Paris@abertay.ac.uk
More informationAsymptotics of the Eulerian numbers revisited: a large deviation analysis
Asymptotics of the Eulerian numbers revisited: a large deviation analysis Guy Louchard November 204 Abstract Using the Saddle point method and multiseries expansions we obtain from the generating function
More informationNew asymptotic expansion for the Γ (z) function.
New asymptotic expansion for the Γ z function. Gergő Nemes Institute of Mathematics, Eötvös Loránd University 7 Budapest, Hungary September 4, 007 Published in Stan s Library, Volume II, 3 Dec 007. Link:
More informationOn the parity of the Wiener index
On the parity of the Wiener index Stephan Wagner Department of Mathematical Sciences, Stellenbosch University, Stellenbosch 7602, South Africa Hua Wang Department of Mathematics, University of Florida,
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationTaylor Expansions with Finite Radius of Convergence Work of Robert Jentzsch, 1917
Polynomial Families with Interesting Zeros Robert Boyer Drexel University April 30, 2010 Taylor Expansions with Finite Radius of Convergence Work of Robert Jentzsch, 1917 Partial Sums of Geometric Series
More informationNotes on Paths, Trees and Lagrange Inversion
Notes on Paths, Trees and Lagrange Inversion Today we are going to start with a problem that may seem somewhat unmotivated, and solve it in two ways. From there, we will proceed to discuss applications
More informationON POLYNOMIAL REPRESENTATION FUNCTIONS FOR MULTILINEAR FORMS. 1. Introduction
ON POLYNOMIAL REPRESENTATION FUNCTIONS FOR MULTILINEAR FORMS JUANJO RUÉ In Memoriam of Yahya Ould Hamidoune. Abstract. Given an infinite sequence of positive integers A, we prove that for every nonnegative
More informationA196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers
Karlsruhe October 14, 2011 November 1, 2011 A196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers Wolfdieter L a n g 1 The sum of the k th power of the first n positive
More informationHopf algebras and factorial divergent power series: Algebraic tools for graphical enumeration
Hopf algebras and factorial divergent power series: Algebraic tools for graphical enumeration Michael Borinsky 1 Humboldt-University Berlin Departments of Physics and Mathematics Workshop on Enumerative
More informationChapter 11. Min Cut Min Cut Problem Definition Some Definitions. By Sariel Har-Peled, December 10, Version: 1.
Chapter 11 Min Cut By Sariel Har-Peled, December 10, 013 1 Version: 1.0 I built on the sand And it tumbled down, I built on a rock And it tumbled down. Now when I build, I shall begin With the smoke from
More informationCS 310 Advanced Data Structures and Algorithms
CS 310 Advanced Data Structures and Algorithms Runtime Analysis May 31, 2017 Tong Wang UMass Boston CS 310 May 31, 2017 1 / 37 Topics Weiss chapter 5 What is algorithm analysis Big O, big, big notations
More informationDISCRETE AND ALGEBRAIC STRUCTURES
DISCRETE AND ALGEBRAIC STRUCTURES Master Study Mathematics MAT.40 Winter Semester 015/016 & 016/17 (Due to organisational reasons register for the course at TU and KFU) Parts I & II Contents I Combinatorics
More informationarxiv: v1 [math.co] 4 Mar 2010
NUMBER OF COMPOSITIONS AND CONVOLVED FIBONACCI NUMBERS arxiv:10030981v1 [mathco] 4 Mar 2010 MILAN JANJIĆ Abstract We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers
More informationSusceptible-Infective-Removed Epidemics and Erdős-Rényi random
Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all
More informationDESTRUCTION OF VERY SIMPLE TREES
DESTRUCTION OF VERY SIMPLE TREES JAMES ALLEN FILL, NEVIN KAPUR, AND ALOIS PANHOLZER Abstract. We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationOn the Sequence A and Its Combinatorial Interpretations
1 2 47 6 2 11 Journal of Integer Sequences, Vol. 9 (2006), Article 06..1 On the Sequence A079500 and Its Combinatorial Interpretations A. Frosini and S. Rinaldi Università di Siena Dipartimento di Scienze
More informationAnalysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort
Analysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort Xi Chen Columbia University We continue with two more asymptotic notation: o( ) and ω( ). Let f (n) and g(n) are functions that map
More informationHopf algebras and factorial divergent power series: Algebraic tools for graphical enumeration
Hopf algebras and factorial divergent power series: Algebraic tools for graphical enumeration Michael Borinsky 1 Humboldt-University Berlin Departments of Physics and Mathematics Workshop on Enumerative
More informationAsymptotic Enumeration of Compacted Binary Trees
Asymptotic Enumeration of Compacted Binary Trees Antoine Genitrini Bernhard Gittenberger Manuel Kauers Michael Wallner March 30, 207 Abstract A compacted tree is a graph created from a binary tree such
More informationASYMPTOTICS FOR RANK AND CRANK MOMENTS
ASYMPTOTICS FOR RANK AND CRANK MOMENTS KATHRIN BRINGMANN, KARL MAHLBURG, AND ROBERT C. RHOADES Abstract. Moments of the partition rank and crank statistics have been studied for their connections to combinatorial
More informationAlgorithms for Combinatorial Systems: Between Analytic Combinatorics and Species Theory.
Algorithms for Combinatorial Systems: Between Analytic Combinatorics and Species Theory. Carine Pivoteau - LIGM - december 2011 joint work with Bruno Salvy and Michèle Soria Algorithms for Combinatorial
More informationLengyel's Constant Page 1 of 5
Lengyel's Constant Page 1 of 5 Lengyel's Constant Set Partitions and Bell Numbers Let S be a set with n elements. The set of all subsets of S has elements. By a partition of S we mean a disjoint set of
More informationHEAGAN & CO., OPP. f>, L. & W. DEPOT, DOYER, N. J, OUR MOTTO! ould Iwv ia immediate vltlui. VEEY BEST NEW Creamery Butter 22c ib,
#4 NN N G N N % XX NY N Y FY N 2 88 N 28 k N k F P X Y N Y /» 2«X ««!!! 8 P 3 N 0»9! N k 25 F $ 60 $3 00 $3000 k k N 30 Y F00 6 )P 0» «{ N % X zz» «3 0««5 «N «XN» N N 00/ N 4 GN N Y 07 50 220 35 2 25 0
More informationarxiv: v1 [cs.ds] 11 Oct 2018
Path matrix and path energy of graphs arxiv:1810.04870v1 [cs.ds] 11 Oct 018 Aleksandar Ilić Facebook Inc, Menlo Park, California, USA e-mail: aleksandari@gmail.com Milan Bašić Faculty of Sciences and Mathematics,
More informationRandom Graphs. Research Statement Daniel Poole Autumn 2015
I am interested in the interactions of probability and analysis with combinatorics and discrete structures. These interactions arise naturally when trying to find structure and information in large growing
More informationGenerating and counting Hamilton cycles in random regular graphs
Generating and counting Hamilton cycles in random regular graphs Alan Frieze Mark Jerrum Michael Molloy Robert Robinson Nicholas Wormald 1 Introduction This paper deals with computational problems involving
More informationHAMILTON CYCLES IN RANDOM REGULAR DIGRAPHS
HAMILTON CYCLES IN RANDOM REGULAR DIGRAPHS Colin Cooper School of Mathematical Sciences, Polytechnic of North London, London, U.K. and Alan Frieze and Michael Molloy Department of Mathematics, Carnegie-Mellon
More informationReconstructibility of trees from subtree size frequencies
Stud. Univ. Babeş-Bolyai Math. 59(2014), No. 4, 435 442 Reconstructibility of trees from subtree size frequencies Dénes Bartha and Péter Burcsi Abstract. Let T be a tree on n vertices. The subtree frequency
More informationTwo-stage allocations and the double Q-function
Two-stage allocations and the double Q-function Sergey Agievich National Research Center for Applied Problems of Mathematics and Informatics Belarusian State University Fr. Skorina av. 4, 220050 Minsk,
More informationarxiv: v1 [math.co] 12 Apr 2018
COMBINATORIAL ANALYSIS OF GROWTH MODELS FOR SERIES-PARALLEL NETWORKS MARKUS KUBA AND ALOIS PANHOLZER arxiv:804.0550v [math.co] Apr 08 Abstract. We give combinatorial descriptions of two stochastic growth
More informationEnumerating split-pair arrangements
Journal of Combinatorial Theory, Series A 115 (28 293 33 www.elsevier.com/locate/jcta Enumerating split-pair arrangements Ron Graham 1, Nan Zang Department of Computer Science, University of California
More informationA Note about the Pochhammer Symbol
Mathematica Moravica Vol. 12-1 (2008), 37 42 A Note about the Pochhammer Symbol Aleksandar Petoević Abstract. In this paper we give elementary proofs of the generating functions for the Pochhammer symbol
More informationA simple branching process approach to the phase transition in G n,p
A simple branching process approach to the phase transition in G n,p Béla Bollobás Department of Pure Mathematics and Mathematical Statistics Wilberforce Road, Cambridge CB3 0WB, UK b.bollobas@dpmms.cam.ac.uk
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in
More informationHAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F Introduction and Motivation
HAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F 2 GILBERT LEE, FRANK RUSKEY, AND AARON WILLIAMS Abstract. We study the Hamming distance from polynomials to classes of polynomials that share certain
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More informationDEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results
DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS George E. Andrews and Ken Ono February 7, 2000.. Introduction and Statement of Results Dedekind s eta function ηz, defined by the infinite product ηz
More informationGENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS
GENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS Michael Drmota Institute of Discrete Mathematics and Geometry Vienna University of Technology A 1040 Wien, Austria michael.drmota@tuwien.ac.at http://www.dmg.tuwien.ac.at/drmota/
More informationGenerating All Permutations by Context-Free Grammars in Chomsky Normal Form
Generating All Permutations by Context-Free Grammars in Chomsky Normal Form Peter R.J. Asveld Department of Computer Science, Twente University of Technology P.O. Box 217, 7500 AE Enschede, the Netherlands
More informationOn the number of matchings of a tree.
On the number of matchings of a tree. Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-800 Graz, Austria Abstract In a paper of Klazar, several counting examples
More information