123
http://madgraph.hep.uiuc.edu/ SummerCERN15 Register SummerCERN17 SummerCERN17

Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

The Standard Model and Beyond Predictions Event simulations Challenge

Guillaume Chalons & Benjamin Fuks - August 2015 - CERN summer student program 2015 - MADGRAPH

Register

20

http://madgraph.hep.uiuc.edu/

SummerCERN15

Register

SummerCERN17

SummerCERN17

Page 2: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph5_aMC@NLO

Automated Tree-Level and one loop Feynman Diagram

and Event Generation at LO and NLO

Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37

What to remember•Analytical computation can be slower than numerical method•Any BSM model are supported (at LO) •Phase Space integration are slow

•need knowledge of the function•cuts can be problematic

•Event generation are from free.•All this are automated in MG5_aMC@NLO• Important to know the physical hypothesis

M

ADGRAPH5

aMC@NLO

Valentin Hirschi and Olivier Mattelaer

Page 3: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Plan

• Overview of Standard Model – Introduction to Particle Physics – The Standard Model

• Parton level calculations • Full Event Simulations • Identify 3 Newly Discovered Particles

Page 4: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Standard Model• Good News! SU(3)xSUL(2)xU(1)

– Most successful theory in physics! – Tested over 30 orders of magnitude!

• (photon mass < 10-18 eV , LHC > 1012 eV)

The Standard Model and Beyond Predictions Event simulations Challenge

Guillaume Chalons & Benjamin Fuks - August 2015 - CERN summer student program 2015 - MADGRAPH 8

The Standard Model: the full picture

✦ All the particles have been observed:!✤ The last one: the Higgs (2012)!✤ The next-to-last one: the top quark (1995)

✦ Tested over 30 orders of magnitude:!✤ from 10-18 eV (photon mass limit)!✤ to 10+13 eV (LHC energy)

• All particles observed

• Higgs (2012)

• Top (1995)

Page 5: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Standard Model• Bad News!

– We can’t solve it!

Page 6: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Standard Model• Bad News!

– We can’t solve it!

Page 7: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Predictions from SM

Page 8: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Predictions from SM

• Cross Section:

– Can’t solve exactly because interactions change wave functions!

∫ Φ= dMs

2||21

σ

( ) −+−−+ ∫= eeeTM dtHi I ||µµ

Page 9: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Predictions from SM

• Cross Section:

– Can’t solve exactly because interactions change wave functions!

• Perturbation Theory – Start w/ Free Particle wave function – Assume interactions are small perturbation

∫ Φ= dMs

2||21

σ

( ) −+−−+ ∫= eeeTM dtHi I ||µµ

...||21|| 2

intint ++≈ −+−+−+−+ eeHeeHM µµµµ

Page 10: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

Page 11: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

Page 12: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

Page 13: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

Page 14: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 15: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 16: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 17: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 18: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 19: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 20: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Example: e+e- → µ+µ-

• Scattering cross section

• Feynman Diagrams

∫ Φ= dMs

2||21

σ

...|| int +≈ −+−+ eeHM µµ

( )M v e+≈ ( )iq µγ− ( )v e− 2

igpµν−

( )( ) ( )u iq uνµ γ µ+ −−

Page 21: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

γ QED

Z QED

W+- QED

g QCD

hQED (m)

Feynman Rules!

qqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

Partial list from SM 19

ZZh

Page 22: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Feynman Rules!

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 23: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 24: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 25: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 26: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 27: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

Order is QCD2

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 28: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

Order is QCD2

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 29: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

Order is QCD2

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 30: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

Order is QCD2

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Page 31: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

Feynman Rules!

Order is QCD2

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Order is QED2

Page 32: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• These are basic building blocks, combine to form “allowed” diagrams – e.g. u u~ -> t t~

• Draw Feynman diagrams: – gg -> tt~ – gg -> tt~h – gg -> h h – dd~ -> uu~Z

• Determine “order” for each diagram

Feynman Rules!

Order is QCD2

QCDg

QED

(m)h

QEDW

QEDZ

QEDγ

QCDg

QED

(m)h

QEDW

QEDZ

QEDγqqγ l l γ− +

qqg

W W γ+ −

qqZ llZ

qq Wʹ l Wν

ggg

W W Z+ −

W W h+ −qqh llh

gggg

WWWW

ZZh

Order is QED2

Page 33: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph

Page 34: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

Page 35: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– g g > t t~ h QCD<=4 QED=1

Page 36: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– g g > t t~ h QCD<=4 QED=1

Page 37: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– g g > t t~ h QCD<=4 QED=1

• MadGraph Returns:– Feynman diagrams

Page 38: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– g g > t t~ h QCD<=4 QED=1

• MadGraph Returns:– Feynman diagrams – Self-Contained Fortran Code for |M|^2

Page 39: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– g g > t t~ h QCD<=4 QED=1

• MadGraph Returns:– Feynman diagrams – Self-Contained Fortran Code for |M|^2

SUBROUTINE SMATRIX(P1,ANS) C C Generated by MadGraph II Version 3.83. Updated 06/13/05 C RETURNS AMPLITUDE SQUARED SUMMED/AVG OVER COLORS C AND HELICITIES C FOR THE POINT IN PHASE SPACE P(0:3,NEXTERNAL) C C FOR PROCESS : g g -> t t~ b b~ C C Crossing 1 is g g -> t t~ b b~ IMPLICIT NONE C C CONSTANTS C Include "genps.inc" INTEGER NCOMB, NCROSS PARAMETER ( NCOMB= 64, NCROSS= 1) INTEGER THEL PARAMETER (THEL=NCOMB*NCROSS) C C ARGUMENTS C REAL*8 P1(0:3,NEXTERNAL),ANS(NCROSS) C

Page 40: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

The Standard Model and Beyond Predictions Event simulations Challenge

Guillaume Chalons & Benjamin Fuks - August 2015 - CERN summer student program 2015 - MADGRAPH

Check your answer!

19

Check your answer

Page 41: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

The Standard Model and Beyond Predictions Event simulations Challenge

Guillaume Chalons & Benjamin Fuks - August 2015 - CERN summer student program 2015 - MADGRAPH

Register

20

http://madgraph.hep.uiuc.edu/

SummerCERN15

Register

SummerCERN17

SummerCERN17

Page 42: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

OR install it on your laptophttps://launchpad.net/mg5amcnlo

Page 43: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams

Page 44: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

g g > t t~ : 3 diagrams QCD=2

Page 45: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

g g > t t~ h: 8 diagrams QCD=2, QED=1

Page 46: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

g g > h h : 16 diagrams QCD=2, QED=2 hint: this process only occurs via loops

1/2

Page 47: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

g g > h h : 16 diagrams QCD=2, QED=2 hint: this process only occurs via loops

2/2

Page 48: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

d d~ > u u~ z : 4 diagrams QCD=2, QED=1 and...

Page 49: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

d d~ > u u~ z : ... 13 diagrams QCD=0, QED=3

1/2

Page 50: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:

d d~ > u u~ z : ... 13 diagrams QCD=0, QED=3

2/2

Page 51: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Status

41

Page 52: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Status• Good News

– MadGraph generates all tree-level and one loop diagrams

– MadGraph generates fortran/C++/Python code to calculate Σ|M|2

41

Page 53: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Status• Good News

– MadGraph generates all tree-level and one loop diagrams

– MadGraph generates fortran/C++/Python code to calculate Σ|M|2

• Bad News – Madgraph generates code…. – Hadron colliders are tough!

41

Page 54: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Status• Good News

– MadGraph generates all tree-level and one loop diagrams

– MadGraph generates fortran/C++/Python code to calculate Σ|M|2

• Bad News – Madgraph generates code…. – Hadron colliders are tough!

• Good News – There’s a cool animation next!

41

Page 55: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

The Standard Model and Beyond Predictions Event simulations Challenge

Guillaume Chalons & Benjamin Fuks - August 2015 - CERN summer student program 2015 - MADGRAPH

Register

20

http://madgraph.hep.uiuc.edu/

SummerCERN15

Page 57: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)
Page 58: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)
Page 59: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• http://www.ippp.dur.ac.uk/HEPCODE/

What are the MC for?

Sherpa artist

MeV

GeV

TeV

Scales

Page 60: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• http://www.ippp.dur.ac.uk/HEPCODE/

What are the MC for?1. High-Q Scattering2 2. Parton Shower

3. Hadronization

☞ where BSM physics lies

☞ process dependent

☞ first principles description

☞ it can be systematically improved

MeV

GeV

TeV

Scales

Page 61: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• http://www.ippp.dur.ac.uk/HEPCODE/

What are the MC for?1. High-Q Scattering2 2. Parton Shower

3. Hadronization

☞ QCD -”known physics”

☞ universal/ process independent

☞ first principles description

MeV

GeV

TeV

Scales

Page 62: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• http://www.ippp.dur.ac.uk/HEPCODE/

What are the MC for?1. High-Q Scattering2 2. Parton Shower

3. Hadronization

☞ universal/ process independent

☞ model-based description

☞ low Q physics2

MeV

GeV

TeV

Scales

Page 63: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

What are the MC for?

MeV

GeV

TeV

Scales

4.

Page 64: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Protonsu

u

d

Page 65: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Protons• Simple Model

– 3 “Valence” quarks u u d – 2/3 chance of getting up quark – 1/3 chance of getting down quark – Guess each carries 1/3 of momentum

u

u

d

Page 66: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Protons• Simple Model

– 3 “Valence” quarks u u d – 2/3 chance of getting up quark – 1/3 chance of getting down quark – Guess each carries 1/3 of momentum

• Deep Inelastic Scattering Results – Short time scales “sea” partons – u and d. but also u~ d~ s, c and g with varying

amounts of momentum

u

u

d

Page 67: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Protons• Simple Model

– 3 “Valence” quarks u u d – 2/3 chance of getting up quark – 1/3 chance of getting down quark – Guess each carries 1/3 of momentum

• Deep Inelastic Scattering Results – Short time scales “sea” partons – u and d. but also u~ d~ s, c and g with varying

amounts of momentum

• Need to multiple matrix element by probability f(x) of finding parton i with fraction of momentum x

u

u

d

Page 68: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Protons• Simple Model

– 3 “Valence” quarks u u d – 2/3 chance of getting up quark – 1/3 chance of getting down quark – Guess each carries 1/3 of momentum

• Deep Inelastic Scattering Results – Short time scales “sea” partons – u and d. but also u~ d~ s, c and g with varying

amounts of momentum

• Need to multiple matrix element by probability f(x) of finding parton i with fraction of momentum x

u

u

d

21 2 1 2

1 ( ) ( ) | |2 u uf x f x M d dx dxs

σ = Φ∑ ∫

Page 69: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Protons• Simple Model

– 3 “Valence” quarks u u d – 2/3 chance of getting up quark – 1/3 chance of getting down quark – Guess each carries 1/3 of momentum

• Deep Inelastic Scattering Results – Short time scales “sea” partons – u and d. but also u~ d~ s, c and g with varying

amounts of momentum

• Need to multiple matrix element by probability f(x) of finding parton i with fraction of momentum x

• Many parton level sub processes contribute to same hadron level event (e.g. pp > e+ ν j j j)

u

u

d

21 2 1 2

1 ( ) ( ) | |2 u uf x f x M d dx dxs

σ = Φ∑ ∫

Page 70: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Exercise• List processes for signal pp > t t~ h with Higgs

decaying to b b~ (madgraph syntax: p p > h > t t~ b b~ or p p > t t~ h, h > b b~) – e.g. uu~ > h > tt~bb~

• List process for background pp > tt~bb~ – e.g. uu~ > tt~bb~

• List process for reducible background pp>tt~jj – e.g. uu~ > tt~gg

Page 71: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 2: List subprocesses generated for these processes:

p p > h > t t~ b b~ :

p p > t t~ b b~ :

Page 72: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 2: List subprocesses generated for these processes:

p p > t t~ j j :

Page 73: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph

Page 74: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– pp -> bb~tt~ QCD<=4

• MadGraph Returns:

Page 75: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– pp -> bb~tt~ QCD<=4

• MadGraph Returns:– Feynman diagrams – Fortran Code for |M|^2– Summed over all sub processes w/ pdf

Page 76: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadGraph• User Requests:

– pp -> bb~tt~ QCD<=4

• MadGraph Returns:– Feynman diagrams – Fortran Code for |M|^2– Summed over all sub processes w/ pdf

DOUBLE PRECISION FUNCTION DSIG(PP,WGT) C **************************************************** C Generated by MadGraph II Version 3.83. Updated 06/13/05 C RETURNS DIFFERENTIAL CROSS SECTION C Input: C pp 4 momentum of external particles C wgt weight from Monte Carlo C Output: C Amplitude squared and summed C **************************************************** -----------------------------------

IPROC=IPROC+1 ! u u~ -> t t~ b b~ PD(IPROC)=PD(IPROC-1) + u1 * ub2 IPROC=IPROC+1 ! d d~ -> t t~ b b~ PD(IPROC)=PD(IPROC-1) + d1 * db2 IPROC=IPROC+1 ! s s~ -> t t~ b b~ PD(IPROC)=PD(IPROC-1) + s1 * sb2 IPROC=IPROC+1 ! c c~ -> t t~ b b~ PD(IPROC)=PD(IPROC-1) + c1 * cb2 CALL SMATRIX(PP,DSIGUU)

dsig = pd(iproc)*conv*dsiguu

Page 77: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Hadronic Collision Cross Sections

Page 78: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Hadronic Collision Cross Sections

∫ −−−= )...(...||)()(21

2143

132

21 nn pppPPdPdMxfxfs

δσ

• Good News

– Automatically determine sub processes and Feynman diagrams

– Automatically create function needed to integrate

Page 79: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Hadronic Collision Cross Sections

∫ −−−= )...(...||)()(21

2143

132

21 nn pppPPdPdMxfxfs

δσ

• Good News

– Automatically determine sub processes and Feynman diagrams

– Automatically create function needed to integrate

• Bad News

– Hard to integrate! – 3N-4+2 dimensions

Page 80: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

Page 81: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• MonteCarlo

• Trapezium

• Simpson

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

Method of evaluation1/

pN

1/N4

1/N2• MonteCarlo• Trapezium• Simpson

Page 82: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• MonteCarlo

• Trapezium

• Simpson

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

Method of evaluation1/

pN

1/N4

1/N2

simpson MC3 0,638 0,35 0,6367 0,820 0,63662 0,6100 0,636619 0,651000 0,636619 0,636

• MonteCarlo• Trapezium• Simpson

Page 83: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• MonteCarlo

• Trapezium

• Simpson

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

Method of evaluation1/

pN

1/N4

1/N2

More Dimension1/

pN

1/N2/d

1/N4/d

• MonteCarlo• Trapezium• Simpson

Page 84: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

I =!

x2

x1

f(x)dx

V = (x2 − x1)

!x2

x1

[f(x)]2dx − I2 VN = (x2 − x1)2

1

N

N!

i=1

[f(x)]2 − I2

N

IN = (x2 − x1)1

N

N!

i=1

f(x)

Page 85: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

I =!

x2

x1

f(x)dx

V = (x2 − x1)

!x2

x1

[f(x)]2dx − I2 VN = (x2 − x1)2

1

N

N!

i=1

[f(x)]2 − I2

N

IN = (x2 − x1)1

N

N!

i=1

f(x)

I = IN ±!

VN/N

Page 86: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

I =!

x2

x1

f(x)dx

V = (x2 − x1)

!x2

x1

[f(x)]2dx − I2 VN = (x2 − x1)2

1

N

N!

i=1

[f(x)]2 − I2

N

IN = (x2 − x1)1

N

N!

i=1

f(x)

I = IN ±!

VN/N

V = VN = 0

Page 87: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

IntegrationI =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Zdq2

(q2 �M2 + iM�)2

IN = 0.637 ± 0.307/√

N

ZdxC

I =!

x2

x1

f(x)dx

V = (x2 − x1)

!x2

x1

[f(x)]2dx − I2 VN = (x2 − x1)2

1

N

N!

i=1

[f(x)]2 − I2

N

IN = (x2 − x1)1

N

N!

i=1

f(x)

I = IN ±!

VN/N

V = VN = 0

Can be minimized!

Page 88: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

Page 89: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

0.0 0.2 0.4 0.6 0.8 1.00.0

0.2

0.4

0.6

0.8

1.0

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

Page 90: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

=

! ξ2

ξ1

dξcos π

2x[ξ]

1−x[ξ]2

0.0 0.2 0.4 0.6 0.8 1.00.0

0.2

0.4

0.6

0.8

1.0

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

Page 91: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

=

! ξ2

ξ1

dξcos π

2x[ξ]

1−x[ξ]2

≃ 1

0.0 0.2 0.4 0.6 0.8 1.00.0

0.2

0.4

0.6

0.8

1.0

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

Page 92: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

=

! ξ2

ξ1

dξcos π

2x[ξ]

1−x[ξ]2

≃ 1

0.0 0.1 0.2 0.3 0.4 0.50.0

0.2

0.4

0.6

0.8

1.0

0.0 0.2 0.4 0.6 0.8 1.00.0

0.2

0.4

0.6

0.8

1.0

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

Page 93: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

=

! ξ2

ξ1

dξcos π

2x[ξ]

1−x[ξ]2

IN = 0.637 ± 0.031/√

N

≃ 1

0.0 0.1 0.2 0.3 0.4 0.50.0

0.2

0.4

0.6

0.8

1.0

0.0 0.2 0.4 0.6 0.8 1.00.0

0.2

0.4

0.6

0.8

1.0

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

100 times faster

Page 94: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Importance Sampling

IN = 0.637 ± 0.307/√

N

I =

! 1

0

dx cosπ

2x

IN = 0.637 ± 0.307/√

N

=

! ξ2

ξ1

dξcos π

2x[ξ]

1−x[ξ]2

IN = 0.637 ± 0.031/√

N

≃ 1

0.0 0.1 0.2 0.3 0.4 0.50.0

0.2

0.4

0.6

0.8

1.0

0.0 0.2 0.4 0.6 0.8 1.00.0

0.2

0.4

0.6

0.8

1.0

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

The Phase-Space parametrization is important to have an efficient computation!

I =

Z 1

0dx(1� cx

2)

cos

�⇡2x

(1� cx

2)

100 times faster

Page 95: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Single Diagram Enhanced MadEvent

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫ 2 2

2 2 21 1 1 11 2 1 22 2 2 2

1 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫2 2

2 2 21 1 1 11 2 1 22 2 2 2

1 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

Page 96: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• Key Idea – Any single diagram is “easy” to integrate – Divide integration into pieces, based on diagrams

Single Diagram Enhanced MadEvent

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫ 2 2

2 2 21 1 1 11 2 1 22 2 2 2

1 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫2 2

2 2 21 1 1 11 2 1 22 2 2 2

1 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

Page 97: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

• Key Idea – Any single diagram is “easy” to integrate – Divide integration into pieces, based on diagrams

• Get N independent integrals – Errors add in quadrature so no extra cost – No need to calculate “weight” function from other

channels. – Can optimize # of points for each one independently – Parallel in nature

Single Diagram Enhanced MadEvent

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫ 2 2

2 2 21 1 1 11 2 1 22 2 2 2

1 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

2 22 2 21 1 1 1

1 2 1 22 2 2 21 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫2 2

2 2 21 1 1 11 2 1 22 2 2 2

1 1 1 1

| | | || | d( ) | | d( ) | | d( )| | | | | | | |a a a aa a PS a PS a PSa a a a

σ+ +

= + = ++ +∫ ∫ ∫

Page 98: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

Page 99: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests:

Page 100: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)

Page 101: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)– pp -> a a

Page 102: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)– pp -> a a – Cuts + Parameters

Page 103: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)– pp -> a a – Cuts + Parameters

• MadEvent Returns:

Page 104: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)– pp -> a a – Cuts + Parameters

• MadEvent Returns:– Feynman diagrams

Page 105: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)– pp -> a a – Cuts + Parameters

• MadEvent Returns:– Feynman diagrams – Complete package for event generation

Page 106: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

MadEvent

• User Requests: – Model (HiggsHeft)– pp -> a a – Cuts + Parameters

• MadEvent Returns:– Feynman diagrams – Complete package for event generation– Events/Plots on line!

Page 107: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)
Page 108: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

pp > h > a a• Generate SubProcesses+Diagrams

• Use HiggsEFT model

• Generate Parton Level Plots

• Do background p p > a a

Page 109: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

X-sect = 1.859E+02(pb) AVG = 1.300E+02 RMS = 3.464E-01Tot # Evts = 10000 Entries = 10000 Undersc = 0 Over

X-sect = 1.492E+06(pb) AVG = 4.477E+01 RMS = 3.259E+01Tot # Evts = 10000 Entries = 9999 Undersc = 0 Over

HT =

NparticlesX

i=1

qP 2T,i �m2

i

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 3: Study observables, you need to generate events here!

p p > h > a a p p > a a

- Pseudo-rapidity ‘eta’ and rapidity ‘y’ are different for massive particles only. Pseudo-rapidity more handy their differences is Longitudinal Lorentz boost invariant

- The quantity HT is loosely called Transverse energy:

Page 110: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Exercise• Generate parton level plot for the Higgs

production to four lepton – e.g. g g > h > e+ e- mu+ mu- (use HiggsEFT)

• List process for background and generate the associate partonic plot

• What is a strategy to observe the Higgs?

Page 111: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 3: Study observables, you need to generate events here!p p > h > e+ e- mu+ mu- p p > e+ e- mu+ mu-

Page 112: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 3: Study observables, you need to generate events here!

p p > h > e+ e- mu+ mu-

p p > e+ e- mu+ mu-

Page 113: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Final Project• Good News….we have discovered 3 new particles at the LHC (Z’,

H, W+’) Your job is to determine their mass using the plots provided.

• Go to the wiki page to get the plots and determine which sample is which model:

• https://cp3.irmp.ucl.ac.be/projects/madgraph/wiki/CernSummerSchool17

Page 114: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Final challenge

Identify the New Physics from simulated plots!

Page 115: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

- Why is the number of b’s, W’s, Z’s always 0 or 2 at parton level, but more at detector level? - Why does the pt(b1) look so erratic at parton level but not any longer at detector level? - What is the X mass and its decay modes, including their relative strengths? - How stable this X is ? What is its ratio ? Does it look the same for all decay modes?�/m - Can you also guess the X mass from the shape of the Pt spectrum of its decay products (incl. top)?

Sample A) A heavy scalar Higgs with SM-like couplings!

Decays preferentially to top-quarks!

Page 116: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Sample B) A heavy Z’

Decays to jets!

- Why is missing ET zero at parton level and not at detector level

- Why are the invariant mass spectra always slightly left-right asymmetrical?

- Why does the 0th bin of the HT observable have such a large weight? - How would you go about disentangling with certainty the Scalar (H) case vs Vector (Z’) case?

Page 117: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Sample C) A heavy W’ !

Features a resonance in a charged combination !

- Why is there already missing ET at the parton-level in this case? - Observe how the invariant mass peak in m(j1, j2) gets ‘washed out’ when looking at detector plots. - Can one deduce the mass of the resonance from the missing ET plot? How stable is this estimation when comparing it to the corresponding detector level plot? - Why don’t you find the m(b1, t1) plot at the detector level?

Page 118: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Advice

Page 119: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Advice• A person who can efficiently calculate

cross sections can be useful to a collaboration

Page 120: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Advice• A person who can efficiently calculate

cross sections can be useful to a collaboration

• A person who can efficiently calculate the CORRECT cross section is ESSENTIAL to a collaboration

Page 121: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Conclusions• Standard Model is Amazing (good news)

• S.M. is tough to Solve (good news!) – Factorization allows use of Perturbation Theory – Feynman Diagrams help – MG5aMC can help too

• LHC requires NLO (at least for the SM) - MG5aMC can help here too !!

• Good Luck!

Page 122: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Ex 1: Draw all the Feynman Diagrams:g g > t t~ : 3 diagrams QCD=2 , g g > t t~ h: 8 diagrams QCD=2, QED=1

g g > h h : 16 diagrams QCD=2, QED=2 hint: this process only occurs via loops

d d~ > u u~ z : 4 diagrams QCD=2, QED=1 and 13 diagrams QCD=0, QED=3hint: think of topologies with a W-boson in the t-channel and its couplings to the Z.

https://cp3.irmp.ucl.ac.be/projects/madgraph/wiki/CernSummerSchool17

Ex 2: List subprocesses generated for these processes:

p p > h > t t~ b b~ : Why don’t you see any initial-state b-quarks?

p p > t t~ b b~ : Why is there now many more diagrams, esp. for the gluon initial-state ch?

p p > t t~ j j : What are the new partonic “groups” compared to the ones above? Why?In general, asked yourself why the various processes are grouped as shown.

Ex 3: Study observables, you need to generate events here!p p > h > a a (and p p > a a ): Why do you need to select the HEFT model here?Look at the plots generated, and make sure you understand their shape and obs. definition.

p p > h > e+ e- mu+ mu- (and p p > e+ e- mu+ mu-): Can you re-discover the Higgs? - Is comparing the inclusive cross-section of the signal and background directly meaningful? - Understand the E_cm plot! Why is dropping first but increasing again then at ~200 GeV? - Understand the m(e+, e-) plot! Why is there seemingly two peaks? What happens for m=0?

Page 123: Register...Mattelaer Olivier Monte-Carlo Lecture: IFT 2015 37 What to remember •Analytical computation can be slower than numerical method •Any BSM model are supported (at LO)

Ht =X

i

|P visT |+

���X

EmissT

���

CERN Summer School, 2017MadGraph5_aMCNLO workshop

Final challenge: Identify the New Physics from simulated plots!

Further questions to ask yourself about each sample (resonance denoted X):

Notes: All events / plots provided on the wiki are pure signal, and

- Why is the number of b’s, W’s, Z’s always 0 or 2 at parton level, but more at detector level? - Why does the pt(b1) look so erratic at parton level but not any longer at detector level? - What is the X mass and its decay modes, including their relative strengths? - How stable this X is ? What is its ratio ? Does it look the same for all decay modes?�/m - Can you also guess the X mass from the shape of the Pt spectrum of its decay products (incl. top)?

B) - Why is missing ET zero at parton level and not at detector level

- Why are the invariant mass spectra always slightly left-right asymmetrical?

Match the set of plots to each of the three BSM scenarios:

A) An new Z’ B) A heavy scalarC) A new W’

A)

- Why does the 0th bin of the HT observable have such a large weight?

C)

?

- How would you go about disentangling with certainty the Scalar (H) case vs Vector (Z’) case?

- Why is there already missing ET at the parton-level in this case? - Observe how the invariant mass peak in m(j1, j2) gets ‘washed out’ when looking at detector plots.

- Can one deduce the mass of the resonance from the missing ET plot? How stable is this estimation when comparing it to the corresponding detector level plot? - Why don’t you find the m(b1, t1) plot at the detector level?