A gentle introduction to the differential equation method and dynamic concentration

We discuss the differential equation method for establishing dynamic concentration of discrete random processes. We present several relatively simple examples of it and aim to make the method understandable to the unfamiliar reader who has some basic knowledge on probabilistic methods, random graphs...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 345; no. 12; p. 113071
Main Authors Bennett, Patrick, Dudek, Andrzej
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.12.2022
Subjects
Online AccessGet full text

Cover

Loading…
Abstract We discuss the differential equation method for establishing dynamic concentration of discrete random processes. We present several relatively simple examples of it and aim to make the method understandable to the unfamiliar reader who has some basic knowledge on probabilistic methods, random graphs and differential equations.
AbstractList We discuss the differential equation method for establishing dynamic concentration of discrete random processes. We present several relatively simple examples of it and aim to make the method understandable to the unfamiliar reader who has some basic knowledge on probabilistic methods, random graphs and differential equations.
ArticleNumber 113071
Author Bennett, Patrick
Dudek, Andrzej
Author_xml – sequence: 1
  givenname: Patrick
  surname: Bennett
  fullname: Bennett, Patrick
  email: patrick.bennett@wmich.edu
– sequence: 2
  givenname: Andrzej
  orcidid: 0000-0002-6410-5413
  surname: Dudek
  fullname: Dudek, Andrzej
  email: andrzej.dudek@wmich.edu
BookMark eNp9kM1KAzEUhYNUsK2-gKu8wNT8dJIU3JTiHxRcqNBdyCQ3NmU60Uwq9O1NW1cuurpczvku95wRGnSxA4RuKZlQQsXdZuJCbyeMMDahlBNJL9CQKskqoehqgIaEUFZxUa-u0KjvN6TsgqshepvjT-hyCzh0OUW3sznEDueI8xqwC95DKnowLYbvnTmKW8jr6LDpHHb7zmyDxTZ2ttjS0XCNLr1pe7j5m2P08fjwvniulq9PL4v5srKckFwJMfXMSylrM6PCA4fZtFEGGK19TUE1jQHFqRJiZpwSvCm5vHBT6RolpfJ8jNTprk2x7xN4bUM-flAeCa2mRB_K0Rt9KEcfytGncgrK_qFfKWxN2p-H7k8QlFA_AZLubYAS3IUENmsXwzn8F6-zgUk
CitedBy_id crossref_primary_10_1016_j_ejc_2025_104122
crossref_primary_10_1017_S0963548325000033
crossref_primary_10_1137_23M1561105
crossref_primary_10_1016_j_jctb_2024_07_001
Cites_doi 10.1016/j.cosrev.2010.04.002
10.1126/science.1167782
10.1016/S0195-6698(85)80023-8
10.1007/s00493-019-3921-7
10.1214/aoap/1177004612
10.1002/rsa.20973
10.1112/jlms.12242
10.1002/9781118032718
10.1214/aop/1176996452
10.1002/rsa.3240070302
10.1214/11-AAP798
10.2748/tmj/1178243286
10.1002/rsa.20133
10.1002/rsa.20468
10.1080/01621459.1963.10500830
10.1002/rsa.20667
10.1016/j.aim.2009.02.018
10.1017/S0963548306007486
10.1017/S0963548319000051
10.2307/3212147
10.1007/s00493-007-2163-2
10.1016/S0012-365X(03)00241-3
10.1016/j.aim.2015.04.015
10.1007/s00222-010-0247-x
10.1017/S0963548300000183
ContentType Journal Article
Copyright 2022 Elsevier B.V.
Copyright_xml – notice: 2022 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.disc.2022.113071
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-681X
ExternalDocumentID 10_1016_j_disc_2022_113071
S0012365X22002771
GrantInformation_xml – fundername: Simons Foundation
  grantid: 522400
  funderid: https://doi.org/10.13039/100000893
– fundername: Simons Foundation
  grantid: 426894
  funderid: https://doi.org/10.13039/100000893
GroupedDBID --K
--M
-DZ
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29G
4.4
41~
457
4G.
5GY
5VS
6I.
6OB
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
ADIYS
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AI.
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FA8
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HVGLF
HZ~
IHE
IXB
J1W
KOM
M26
M41
MHUIS
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSW
SSZ
T5K
TN5
UPT
VH1
WH7
WUQ
XJT
XOL
XPP
ZCG
ZMT
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
ADXHL
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGQPQ
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
BNPGV
CITATION
SSH
ID FETCH-LOGICAL-c300t-664f2f7775a916fe3e94b8ae215f51e8bbae8318669ad863b130f6d47db8778f3
IEDL.DBID .~1
ISSN 0012-365X
IngestDate Tue Jul 01 04:11:14 EDT 2025
Thu Apr 24 22:57:45 EDT 2025
Fri Feb 23 02:37:13 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 12
Keywords Differential equation method
Random processes
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c300t-664f2f7775a916fe3e94b8ae215f51e8bbae8318669ad863b130f6d47db8778f3
ORCID 0000-0002-6410-5413
ParticipantIDs crossref_citationtrail_10_1016_j_disc_2022_113071
crossref_primary_10_1016_j_disc_2022_113071
elsevier_sciencedirect_doi_10_1016_j_disc_2022_113071
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate December 2022
2022-12-00
PublicationDateYYYYMMDD 2022-12-01
PublicationDate_xml – month: 12
  year: 2022
  text: December 2022
PublicationDecade 2020
PublicationTitle Discrete mathematics
PublicationYear 2022
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Karp, Sipser (br0240) 1981
Ruciński, Wormald (br0290) 1992; 1
D. Bal, Patrick Bennett, The greedy matching algorithm in random regular graphs and hypergraphs, submitted for publication.
Bohman (br0060) 2009; 221
Rödl (br0280) 1985; 6
Bohman, Warnke (br0130) 2019; 100
Janson, Łuczak, Ruciński (br0220) 2000
Bohman, Keevash (br0090) 2010; 181
Freedman (br0180) 1975; 3
Kurtz (br0260) 1970; 7
Fiz Pontiveros, Griffiths, Morris (br0170) 2020; 263
Bohman, Keevash (br0110) 2021; 58
Achlioptas, D'Souza, Spencer (br0010) 2009; 323
Frieze, Karoński (br0190) 2016
Warnke (br0320) 2014; 44
Hoeffding (br0210) 1963; 58
Wormald (br0360) 2003; 273
Wormald (br0340) 1995; 5
Erdős, Rényi (br0160) 1960; 5
Wormald (br0350) 1999
Bollobás (br0140) 2001; vol. 73
Warnke (br0330) 2022
Díaz, Mitsche (br0150) 2010; 4
Bohman, Frieze, Lubetzky (br0080) 2015; 280
Azuma (br0020) 1967; 19
Bohman, Keevash (br0100) 2013
Bennett, Bohman (br0050) 2019; 28
Guo, Warnke (br0200) 2020; 40
Bohman, Frieze, Lubetzky (br0070) 2010; 1
Kim (br0250) 1995; 7
Riordan, Warnke (br0270) 2012; 22
Bennett, Bohman (br0040) 2016; 49
Johnson, Kotz (br0230) 1977
Bohman, Kravitz (br0120) 2006; 15
Spencer, Wormald (br0300) 2007; 27
Telcs, Wormald, Zhou (br0310) 2007; 31
Bennett (10.1016/j.disc.2022.113071_br0040) 2016; 49
Bollobás (10.1016/j.disc.2022.113071_br0140) 2001; vol. 73
Telcs (10.1016/j.disc.2022.113071_br0310) 2007; 31
Bohman (10.1016/j.disc.2022.113071_br0100) 2013
Bennett (10.1016/j.disc.2022.113071_br0050) 2019; 28
Rödl (10.1016/j.disc.2022.113071_br0280) 1985; 6
Bohman (10.1016/j.disc.2022.113071_br0060) 2009; 221
Kurtz (10.1016/j.disc.2022.113071_br0260) 1970; 7
Azuma (10.1016/j.disc.2022.113071_br0020) 1967; 19
Kim (10.1016/j.disc.2022.113071_br0250) 1995; 7
Riordan (10.1016/j.disc.2022.113071_br0270) 2012; 22
Wormald (10.1016/j.disc.2022.113071_br0340) 1995; 5
Achlioptas (10.1016/j.disc.2022.113071_br0010) 2009; 323
Spencer (10.1016/j.disc.2022.113071_br0300) 2007; 27
Guo (10.1016/j.disc.2022.113071_br0200) 2020; 40
Johnson (10.1016/j.disc.2022.113071_br0230) 1977
10.1016/j.disc.2022.113071_br0030
Janson (10.1016/j.disc.2022.113071_br0220) 2000
Fiz Pontiveros (10.1016/j.disc.2022.113071_br0170) 2020; 263
Erdős (10.1016/j.disc.2022.113071_br0160) 1960; 5
Warnke (10.1016/j.disc.2022.113071_br0330) 2022
Wormald (10.1016/j.disc.2022.113071_br0360) 2003; 273
Hoeffding (10.1016/j.disc.2022.113071_br0210) 1963; 58
Bohman (10.1016/j.disc.2022.113071_br0090) 2010; 181
Freedman (10.1016/j.disc.2022.113071_br0180) 1975; 3
Bohman (10.1016/j.disc.2022.113071_br0110) 2021; 58
Bohman (10.1016/j.disc.2022.113071_br0080) 2015; 280
Bohman (10.1016/j.disc.2022.113071_br0070) 2010; 1
Bohman (10.1016/j.disc.2022.113071_br0120) 2006; 15
Díaz (10.1016/j.disc.2022.113071_br0150) 2010; 4
Frieze (10.1016/j.disc.2022.113071_br0190) 2016
Wormald (10.1016/j.disc.2022.113071_br0350) 1999
Karp (10.1016/j.disc.2022.113071_br0240) 1981
Bohman (10.1016/j.disc.2022.113071_br0130) 2019; 100
Ruciński (10.1016/j.disc.2022.113071_br0290) 1992; 1
Warnke (10.1016/j.disc.2022.113071_br0320) 2014; 44
References_xml – volume: 273
  start-page: 235
  year: 2003
  end-page: 260
  ident: br0360
  article-title: Analysis of greedy algorithms on graphs with bounded degrees
  publication-title: Discrete Math.
– volume: 6
  start-page: 69
  year: 1985
  end-page: 78
  ident: br0280
  article-title: On a packing and covering problem
  publication-title: Eur. J. Comb.
– volume: 15
  start-page: 489
  year: 2006
  end-page: 511
  ident: br0120
  article-title: Creating a giant component
  publication-title: Comb. Probab. Comput.
– year: 2016
  ident: br0190
  article-title: Introduction to Random Graphs
– volume: 28
  start-page: 816
  year: 2019
  end-page: 825
  ident: br0050
  article-title: A natural barrier in random greedy hypergraph matching
  publication-title: Comb. Probab. Comput.
– volume: 221
  start-page: 1653
  year: 2009
  end-page: 1677
  ident: br0060
  article-title: The triangle-free process
  publication-title: Adv. Math.
– volume: 280
  start-page: 379
  year: 2015
  end-page: 438
  ident: br0080
  article-title: Random triangle removal
  publication-title: Adv. Math.
– volume: 100
  start-page: 895
  year: 2019
  end-page: 913
  ident: br0130
  article-title: Large girth approximate Steiner triple systems
  publication-title: J. Lond. Math. Soc.
– year: 1977
  ident: br0230
  article-title: Urn Models and Their Application
  publication-title: An Approach to Modern Discrete Probability Theory
– volume: 7
  start-page: 49
  year: 1970
  end-page: 58
  ident: br0260
  article-title: Solutions of ordinary differential equations as limits of pure jump Markov processes
  publication-title: J. Appl. Probab.
– reference: D. Bal, Patrick Bennett, The greedy matching algorithm in random regular graphs and hypergraphs, submitted for publication.
– volume: 22
  start-page: 1450
  year: 2012
  end-page: 1464
  ident: br0270
  article-title: Achlioptas process phase transitions are continuous
  publication-title: Ann. Appl. Probab.
– volume: 1
  start-page: 169
  year: 1992
  end-page: 180
  ident: br0290
  article-title: Random graph processes with degree restrictions
  publication-title: Comb. Probab. Comput.
– volume: 58
  start-page: 13
  year: 1963
  end-page: 30
  ident: br0210
  article-title: Probability inequalities for sums of bounded random variables
  publication-title: J. Am. Stat. Assoc.
– volume: 323
  start-page: 1453
  year: 2009
  end-page: 1455
  ident: br0010
  article-title: Explosive percolation in random networks
  publication-title: Science
– volume: 263
  year: 2020
  ident: br0170
  article-title: The triangle-free process and
  publication-title: Mem. Am. Math. Soc.
– volume: 44
  start-page: 490
  year: 2014
  end-page: 526
  ident: br0320
  article-title: The
  publication-title: Random Struct. Algorithms
– volume: 27
  start-page: 587
  year: 2007
  end-page: 628
  ident: br0300
  article-title: Birth control for giants
  publication-title: Combinatorica
– volume: 7
  start-page: 173
  year: 1995
  end-page: 207
  ident: br0250
  article-title: The Ramsey number
  publication-title: Random Struct. Algorithms
– volume: 4
  start-page: 129
  year: 2010
  end-page: 151
  ident: br0150
  article-title: The cook-book approach to the differential equation method
  publication-title: Comput. Sci. Rev.
– start-page: 73
  year: 1999
  end-page: 155
  ident: br0350
  article-title: The differential equation method for random graph processes and greedy algorithms
  publication-title: Lectures on Approximation and Randomized Algorithms
– volume: vol. 73
  year: 2001
  ident: br0140
  article-title: Random Graphs
  publication-title: Cambridge Studies in Advanced Mathematics
– volume: 3
  start-page: 100
  year: 1975
  end-page: 118
  ident: br0180
  article-title: On tail probabilities for martingales
  publication-title: Ann. Probab.
– start-page: 489
  year: 2013
  end-page: 495
  ident: br0100
  article-title: Dynamic concentration of the triangle-free process
  publication-title: The Seventh European Conference on Combinatorics, Graph Theory and Applications
– year: 2000
  ident: br0220
  article-title: Random Graphs
  publication-title: Wiley-Interscience Series in Discrete Mathematics and Optimization
– volume: 40
  start-page: 63
  year: 2020
  end-page: 103
  ident: br0200
  article-title: Packing nearly optimal Ramsey
  publication-title: Combinatorica
– volume: 31
  start-page: 450
  year: 2007
  end-page: 481
  ident: br0310
  article-title: Hamiltonicity of random graphs produced by 2-processes
  publication-title: Random Struct. Algorithms
– volume: 58
  start-page: 221
  year: 2021
  end-page: 293
  ident: br0110
  article-title: Dynamic concentration of the triangle-free process
  publication-title: Random Struct. Algorithms
– volume: 5
  start-page: 17
  year: 1960
  end-page: 61
  ident: br0160
  article-title: On the evolution of random graphs
  publication-title: Magy. Tud. Akad. Mat. Kut. Intéz. Közl.
– start-page: 364
  year: 1981
  end-page: 375
  ident: br0240
  article-title: Maximum matching in sparse random graphs
  publication-title: Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
– volume: 49
  start-page: 479
  year: 2016
  end-page: 502
  ident: br0040
  article-title: A note on the random greedy independent set algorithm
  publication-title: Random Struct. Algorithms
– volume: 1
  start-page: 477
  year: 2010
  end-page: 488
  ident: br0070
  article-title: A note on the random greedy triangle-packing algorithm
  publication-title: J. Comb.
– year: 2022
  ident: br0330
  article-title: On Wormald's differential equation method
  publication-title: Comb. Probab. Comput.
– volume: 19
  start-page: 357
  year: 1967
  end-page: 367
  ident: br0020
  article-title: Weighted sums of certain dependent random variables
  publication-title: Tohoku Math. J. (2)
– volume: 181
  start-page: 291
  year: 2010
  end-page: 336
  ident: br0090
  article-title: The early evolution of the
  publication-title: Invent. Math.
– volume: 5
  start-page: 1217
  year: 1995
  end-page: 1235
  ident: br0340
  article-title: Differential equations for random processes and random graphs
  publication-title: Ann. Appl. Probab.
– volume: 4
  start-page: 129
  year: 2010
  ident: 10.1016/j.disc.2022.113071_br0150
  article-title: The cook-book approach to the differential equation method
  publication-title: Comput. Sci. Rev.
  doi: 10.1016/j.cosrev.2010.04.002
– volume: 323
  start-page: 1453
  issue: 5920
  year: 2009
  ident: 10.1016/j.disc.2022.113071_br0010
  article-title: Explosive percolation in random networks
  publication-title: Science
  doi: 10.1126/science.1167782
– year: 2016
  ident: 10.1016/j.disc.2022.113071_br0190
– year: 2022
  ident: 10.1016/j.disc.2022.113071_br0330
  article-title: On Wormald's differential equation method
  publication-title: Comb. Probab. Comput.
– volume: 6
  start-page: 69
  issue: 1
  year: 1985
  ident: 10.1016/j.disc.2022.113071_br0280
  article-title: On a packing and covering problem
  publication-title: Eur. J. Comb.
  doi: 10.1016/S0195-6698(85)80023-8
– volume: 40
  start-page: 63
  issue: 1
  year: 2020
  ident: 10.1016/j.disc.2022.113071_br0200
  article-title: Packing nearly optimal Ramsey R(3,t) graphs
  publication-title: Combinatorica
  doi: 10.1007/s00493-019-3921-7
– volume: 5
  start-page: 1217
  issue: 4
  year: 1995
  ident: 10.1016/j.disc.2022.113071_br0340
  article-title: Differential equations for random processes and random graphs
  publication-title: Ann. Appl. Probab.
  doi: 10.1214/aoap/1177004612
– volume: 5
  start-page: 17
  year: 1960
  ident: 10.1016/j.disc.2022.113071_br0160
  article-title: On the evolution of random graphs
  publication-title: Magy. Tud. Akad. Mat. Kut. Intéz. Közl.
– volume: 58
  start-page: 221
  issue: 2
  year: 2021
  ident: 10.1016/j.disc.2022.113071_br0110
  article-title: Dynamic concentration of the triangle-free process
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.20973
– volume: 1
  start-page: 477
  issue: 3–4
  year: 2010
  ident: 10.1016/j.disc.2022.113071_br0070
  article-title: A note on the random greedy triangle-packing algorithm
  publication-title: J. Comb.
– volume: 100
  start-page: 895
  year: 2019
  ident: 10.1016/j.disc.2022.113071_br0130
  article-title: Large girth approximate Steiner triple systems
  publication-title: J. Lond. Math. Soc.
  doi: 10.1112/jlms.12242
– year: 2000
  ident: 10.1016/j.disc.2022.113071_br0220
  article-title: Random Graphs
  doi: 10.1002/9781118032718
– volume: vol. 73
  year: 2001
  ident: 10.1016/j.disc.2022.113071_br0140
  article-title: Random Graphs
– start-page: 364
  year: 1981
  ident: 10.1016/j.disc.2022.113071_br0240
  article-title: Maximum matching in sparse random graphs
– ident: 10.1016/j.disc.2022.113071_br0030
– volume: 3
  start-page: 100
  year: 1975
  ident: 10.1016/j.disc.2022.113071_br0180
  article-title: On tail probabilities for martingales
  publication-title: Ann. Probab.
  doi: 10.1214/aop/1176996452
– volume: 7
  start-page: 173
  issue: 3
  year: 1995
  ident: 10.1016/j.disc.2022.113071_br0250
  article-title: The Ramsey number R(3,t) has order of magnitude t2/log⁡t
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.3240070302
– volume: 22
  start-page: 1450
  issue: 4
  year: 2012
  ident: 10.1016/j.disc.2022.113071_br0270
  article-title: Achlioptas process phase transitions are continuous
  publication-title: Ann. Appl. Probab.
  doi: 10.1214/11-AAP798
– volume: 19
  start-page: 357
  year: 1967
  ident: 10.1016/j.disc.2022.113071_br0020
  article-title: Weighted sums of certain dependent random variables
  publication-title: Tohoku Math. J. (2)
  doi: 10.2748/tmj/1178243286
– year: 1977
  ident: 10.1016/j.disc.2022.113071_br0230
  article-title: Urn Models and Their Application
– start-page: 73
  year: 1999
  ident: 10.1016/j.disc.2022.113071_br0350
  article-title: The differential equation method for random graph processes and greedy algorithms
– volume: 31
  start-page: 450
  issue: 4
  year: 2007
  ident: 10.1016/j.disc.2022.113071_br0310
  article-title: Hamiltonicity of random graphs produced by 2-processes
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.20133
– volume: 44
  start-page: 490
  issue: 4
  year: 2014
  ident: 10.1016/j.disc.2022.113071_br0320
  article-title: The Cℓ-free process
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.20468
– volume: 58
  start-page: 13
  year: 1963
  ident: 10.1016/j.disc.2022.113071_br0210
  article-title: Probability inequalities for sums of bounded random variables
  publication-title: J. Am. Stat. Assoc.
  doi: 10.1080/01621459.1963.10500830
– volume: 49
  start-page: 479
  issue: 3
  year: 2016
  ident: 10.1016/j.disc.2022.113071_br0040
  article-title: A note on the random greedy independent set algorithm
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.20667
– volume: 221
  start-page: 1653
  issue: 5
  year: 2009
  ident: 10.1016/j.disc.2022.113071_br0060
  article-title: The triangle-free process
  publication-title: Adv. Math.
  doi: 10.1016/j.aim.2009.02.018
– start-page: 489
  year: 2013
  ident: 10.1016/j.disc.2022.113071_br0100
  article-title: Dynamic concentration of the triangle-free process
– volume: 263
  year: 2020
  ident: 10.1016/j.disc.2022.113071_br0170
  article-title: The triangle-free process and R(3,k)
  publication-title: Mem. Am. Math. Soc.
– volume: 15
  start-page: 489
  issue: 4
  year: 2006
  ident: 10.1016/j.disc.2022.113071_br0120
  article-title: Creating a giant component
  publication-title: Comb. Probab. Comput.
  doi: 10.1017/S0963548306007486
– volume: 28
  start-page: 816
  issue: 6
  year: 2019
  ident: 10.1016/j.disc.2022.113071_br0050
  article-title: A natural barrier in random greedy hypergraph matching
  publication-title: Comb. Probab. Comput.
  doi: 10.1017/S0963548319000051
– volume: 7
  start-page: 49
  year: 1970
  ident: 10.1016/j.disc.2022.113071_br0260
  article-title: Solutions of ordinary differential equations as limits of pure jump Markov processes
  publication-title: J. Appl. Probab.
  doi: 10.2307/3212147
– volume: 27
  start-page: 587
  issue: 5
  year: 2007
  ident: 10.1016/j.disc.2022.113071_br0300
  article-title: Birth control for giants
  publication-title: Combinatorica
  doi: 10.1007/s00493-007-2163-2
– volume: 273
  start-page: 235
  year: 2003
  ident: 10.1016/j.disc.2022.113071_br0360
  article-title: Analysis of greedy algorithms on graphs with bounded degrees
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(03)00241-3
– volume: 280
  start-page: 379
  year: 2015
  ident: 10.1016/j.disc.2022.113071_br0080
  article-title: Random triangle removal
  publication-title: Adv. Math.
  doi: 10.1016/j.aim.2015.04.015
– volume: 181
  start-page: 291
  issue: 2
  year: 2010
  ident: 10.1016/j.disc.2022.113071_br0090
  article-title: The early evolution of the H-free process
  publication-title: Invent. Math.
  doi: 10.1007/s00222-010-0247-x
– volume: 1
  start-page: 169
  issue: 2
  year: 1992
  ident: 10.1016/j.disc.2022.113071_br0290
  article-title: Random graph processes with degree restrictions
  publication-title: Comb. Probab. Comput.
  doi: 10.1017/S0963548300000183
SSID ssj0001638
Score 2.4460535
Snippet We discuss the differential equation method for establishing dynamic concentration of discrete random processes. We present several relatively simple examples...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 113071
SubjectTerms Differential equation method
Random processes
Title A gentle introduction to the differential equation method and dynamic concentration
URI https://dx.doi.org/10.1016/j.disc.2022.113071
Volume 345
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFA9jXvQgfuL8GDl4k7o2TZP0OIZjKttFB7uVpElgMrqp9erfbt6STgXZwWNLHrSPl_cBv9_vIXQtEiNTq0zkSreOaJnxSMmSRYlNiBVaExEDG3k8YaMpfZhlsxYaNFwYgFWG3O9z-jpbhze94M3eaj4Hji8oh7hhC3AGfM0jp5RDlN9-fsM8oN_w2ZhEcDoQZzzGC5ivbkYkBFabxDz5uzj9KDjDA7QfOkXc9x9ziFqmOkJ7443M6vsxeupjYEYtDJ4D4Fx7JVhcL7E7hJvdJ-4OL7B59Zre2K-MxrLSWPtt9LgE6mIV9HNP0HR49zwYRWFLQlSmcVxHjFFLLOc8k67VsyY1OVVCGlfLbZYYoZQ0IgVdu1xqwVLl_tQyTblWgnNh01PUrpaVOUOYMxmvJ2ae55TbWKWCaK2MYURSVbIOShr3FGWQEIdNFouiwYq9FODSAlxaeJd20M3GZuUFNLaezhqvF7_CoHAZfovd-T_tLtAuPHl8yiVq128f5sp1GbXqrsOoi3b694-jyRdSSNGK
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09a8MwEBUhGdoOpZ80_dTQrZjYsi0pYwgNTvOxNIFsRrIkSAlO2rr_v7pIDi2UDF1tHdiH9O4E771D6JFHWsRG6sCWbhUkRcoCKQoaRCYihitFeAhq5MmUZvPkZZEuGqhfa2GAVumx32H6Fq39k47PZmezXILGF5xD7GULeAYMdOQtcKdKm6jVG46y6Q6QoeVwgEwCCPDaGUfzAvGrvSYSAtNNQhb9XZ9-1JzBCTr2zSLuue85RQ1dnqGjyc5p9fMcvfYwiKNWGi-Bc66cGSyu1tguwvX4E3uMV1i_O1tv7KZGY1EqrNxAelyAerH0FroXaD54nvWzwA9KCIo4DKuA0sQQwxhLhe32jI51N5FcaFvOTRppLqXQPAZru65QnMbS_qmhKmFKcsa4iS9Rs1yX-gphRkW4vTSzbjdhJpQxJ0pJrSkRiSxoG0V1evLCu4jDMItVXtPF3nJIaQ4pzV1K2-hpF7NxHhp7V6d11vNfOyG3IL8n7vqfcQ_oIJtNxvl4OB3doEN44-gqt6hZfXzpO9t0VPLeb6pvkrnUOw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+gentle+introduction+to+the+differential+equation+method+and+dynamic+concentration&rft.jtitle=Discrete+mathematics&rft.au=Bennett%2C+Patrick&rft.au=Dudek%2C+Andrzej&rft.date=2022-12-01&rft.issn=0012-365X&rft.volume=345&rft.issue=12&rft.spage=113071&rft_id=info:doi/10.1016%2Fj.disc.2022.113071&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_disc_2022_113071
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0012-365X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0012-365X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0012-365X&client=summon