shifing the thresold of phase transition in 2 sat and
play

Shifing the thresold of phase transition in 2-SAT and random graphs - PowerPoint PPT Presentation

Sep 19, 2022 •354 likes •1.53k views

Problem and Motivation Saddle-point method and analytic lemma Distribution of random parameters Lower bound for 2-SAT Shifing the thresold of phase transition in 2-SAT and random graphs Sergey Dovgal 1 , 2 Vlady Ravelomanana 2 1 Universit

  1. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Trees with degree constraints Unrooted case Excercise A variant of dissymmetry theorem: • • • 1 • • = + + ◦ 1 ◦ 1 (∆) T 0 ( z ) = T 1 ( z ) 2 U ( z ) = T 0 ( z ) − T 1 ( z ) 2 + U ( z ) ⇔ 2 2 D., Ravelomanana Shifing the phase transition 12 / 51

  2. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Unicycles with degree constraints Excercise ≥ 3 Excercise: what is the EGF for unicycles? D., Ravelomanana Shifing the phase transition 13 / 51

  3. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Unicycles with degree constraints ≥ 3 � � 1 − T 2 ( z ) − T 2 ( z ) − T 2 ( z ) 2 V ( z ) = 1 1 log 2 2 D., Ravelomanana Shifing the phase transition 13 / 51

  4. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  5. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  6. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  7. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  8. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  9. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  10. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  11. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  12. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  13. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  14. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  15. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  16. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  17. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) D., Ravelomanana Shifing the phase transition 14 / 51

  18. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) 2-core of a graph D., Ravelomanana Shifing the phase transition 14 / 51

  19. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma 2-core (the core) and 3-core (the kernel) 3-core of a graph D., Ravelomanana Shifing the phase transition 14 / 51

  20. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Notion of excess 3 2 3 3 1 6 2 1 3 2 2 1 4 4 4 1 4 5 − 1 0 1 2 def Excess = # edges - # vertices D., Ravelomanana Shifing the phase transition 15 / 51

  21. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Kernel of a graph Example: graphs with excess 1 1 2 1 1 2 1 1 1 4 4 6 All possible 3-core multigraphs and their compensation factors. EGF for all connected bicyclic graphs ( ∆ = Z ≥ 0 ): T ( z ) 2 [ 3 T ( z ) 2 − 2 T 3 ( z )] T ( z ) 5 T ( z ) 6 W ( z ) = 1 ( 1 − T ( z )) 2 + 1 ( 1 − T ( z )) 3 + 1 4 4 6 ( 1 − T ( z )) 3 � �� � inclusion-exclusion W ( z ) ∼ 5 1 ( 1 − T ( z )) 3 near z = e − 1 24 · D., Ravelomanana Shifing the phase transition 16 / 51

  22. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Kernel of a graph Example: graphs with excess 1 1 2 1 1 2 1 1 1 4 4 6 All possible 3-core multigraphs and their compensation factors. EGF for all connected bicyclic graphs (arbitrary ∆ ): T 3 ( z ) 2 [ 3 T 2 ( z ) 2 − 2 T 2 ( z ) 3 ] T 4 ( z ) T 2 ( z ) 4 T 3 ( z ) 2 T 2 ( z ) 4 W ∆ ( z ) = 1 ( 1 − T 2 ( z )) 2 + 1 ( 1 − T 2 ( z )) 3 + 1 ( 1 − T 2 ( z )) 3 4 4 6 � �� � inclusion-exclusion W ∆ ( z ) ∼ (???) · T 3 ( z ) 2 (???) ( 1 − T 2 ( z )) 3 D., Ravelomanana Shifing the phase transition 16 / 51

  23. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma General symbolic lemma EGF for connected graphs which reduce to given M is: � κ ( M ) T deg ( v ) ( z ) · P ( M , T 2 ( z )) v ∈ V W ∆ , M ( z ) = ( 1 − T 2 ( z )) µ n ! � � n n � � z 2 µ xx z µ xy − 1 ( µ xy − ( µ xy − 1 ) z ) P ( M , z ) = , x = 1 y = x + 1   = z ω ( k ) ( T 1 ( z )) , T k ( z )     µ xy = # edges between nodes x and y  κ ( M ) = compensation factor     µ = # edges D., Ravelomanana Shifing the phase transition 17 / 51

  24. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Role of cubic graphs Demonstration on the blackboard Let � z be the positive solution of T 2 ( � z ) = 1. Then EGF for all (not necessary connected) complex multigraphs with excess r , has asymptotics near � z , which comes from cubic graphs (degree of each vertex is equal to 3): T 3 ( z ) 2 r ( 6 r )! W ∆ , r ( z ) ∼ e r 0 ( 1 − T 2 ( z )) 3 r , e r 0 = 2 5 r 3 2 r ( 3 r )!( 2 r )! . D., Ravelomanana Shifing the phase transition 18 / 51

  25. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Local summary 1 EGF for unrooted trees with degree constraints 2 EGF for unicycles with degree constraints 3 EGF for graphs of fixed excess (main asymptotics) D., Ravelomanana Shifing the phase transition 19 / 51

  26. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Local summary 1 EGF for unrooted trees with degree constraints 2 EGF for unicycles with degree constraints 3 EGF for graphs of fixed excess (main asymptotics) D., Ravelomanana Shifing the phase transition 19 / 51

  27. Problem and Motivation Trees with degree constraints Saddle-point method and analytic lemma Unicycles with degree constraints Distribution of random parameters Kernel of a graph Lower bound for 2-SAT General symbolic lemma Local summary 1 EGF for unrooted trees with degree constraints 2 EGF for unicycles with degree constraints 3 EGF for graphs of fixed excess (main asymptotics) D., Ravelomanana Shifing the phase transition 19 / 51

  28. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Outline 1 Problem and Motivation 2 Saddle-point method and analytic lemma 3 Distribution of random parameters 4 Lower bound for 2-SAT D., Ravelomanana Shifing the phase transition 20 / 51

  29. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Expected results n – number of vertices m – number of edges Framework: m = α n , linear dependence. 1 m = ( 1 − ε ) α n ← − only trees and unicycles 2 m = α n ← − complex components with positive probability 3 m = ( 1 + ε ) α n ← − probability of fixed excess is exponentially small D., Ravelomanana Shifing the phase transition 21 / 51

  30. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Expected results n – number of vertices m – number of edges Framework: m = α n , linear dependence. 1 m = ( 1 − ε ) α n ← − subcritical phase 2 m = α n ← − cricital phase 3 m = ( 1 + ε ) α n ← − supercritical phase D., Ravelomanana Shifing the phase transition 21 / 51

  31. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Desired probability Subcritical phase P ( graph g ∈ G ( n , m , ∆) consists only of trees and unicycles ) = # graphs from G ( n , m , ∆) whose components are trees and unicycles # graphs from G ( n , m , ∆) D., Ravelomanana Shifing the phase transition 22 / 51

  32. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Number of graphs with degree constraints 1 ∆ = Z ≥ 0 . Stirling approximation: √ 2 m n n m m n ! � ∼ 4 π n α · n 2 m ( n − m ) n − m × � ( n 2 ) ( n − m )! m � � n + m 2 − n + m exp n 2 � �� � 2 Arbitrary ∆ ([de Panafieu, Ramos ’16]) 3 / 4 √ 2 m n n m m n ! 4 π n α ( n − m )! |G n , m , ∆ | ∼ · n 2 m ( n − m ) n − m × p � � z + 1 z ) + 1 4 φ 2 exp − n log ω ( � z ) + 2 m log � 2 φ 0 ( � 0 ( � z ) D., Ravelomanana Shifing the phase transition 23 / 51

  33. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Number of graphs with degree constraints 1 ∆ = Z ≥ 0 . Stirling approximation: √ 2 m n n m m n ! � ∼ 4 π n α · n 2 m ( n − m ) n − m × � ( n 2 ) ( n − m )! m � � n + m 2 − n + m exp n 2 � �� � 2 Arbitrary ∆ ([de Panafieu, Ramos ’16]) 3 / 4 √ 2 m n n m m n ! 4 π n α ( n − m )! |G n , m , ∆ | ∼ · n 2 m ( n − m ) n − m × p � � z + 1 z ) + 1 4 φ 2 exp − n log ω ( � z ) + 2 m log � 2 φ 0 ( � 0 ( � z ) D., Ravelomanana Shifing the phase transition 23 / 51

  34. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Number of graphs with degree constraints 1 ∆ = Z ≥ 0 . Stirling approximation: √ 2 m n n m m n ! � ∼ 4 π n α · n 2 m ( n − m ) n − m × � ( n 2 ) ( n − m )! m � � n + m 2 − n + m exp n 2 � �� � 2 Arbitrary ∆ ([de Panafieu, Ramos ’16]) 3 / 4 √ 2 m n n m m n ! 4 π n α ( n − m )! |G n , m , ∆ | ∼ · n 2 m ( n − m ) n − m × p � � z + 1 z ) + 1 4 φ 2 exp − n log ω ( � z ) + 2 m log � 2 φ 0 ( � 0 ( � z ) D., Ravelomanana Shifing the phase transition 23 / 51

  35. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Number of graphs with degree constraints 1 ∆ = Z ≥ 0 . Stirling approximation: √ 2 m n n m m n ! � ∼ 4 π n α · n 2 m ( n − m ) n − m × � ( n 2 ) ( n − m )! m � � n + m 2 − n + m exp n 2 � �� � 2 Arbitrary ∆ ([de Panafieu, Ramos ’16]) 3 / 4 √ 2 m n n m m n ! 4 π n α ( n − m )! |G n , m , ∆ | ∼ · n 2 m ( n − m ) n − m × p � � z + 1 z ) + 1 4 φ 2 exp − n log ω ( � z ) + 2 m log � 2 φ 0 ( � 0 ( � z ) D., Ravelomanana Shifing the phase transition 23 / 51

  36. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Number of graphs with degree constraints 1 ∆ = Z ≥ 0 . Stirling approximation: √ 2 m n n m m n ! � ∼ 4 π n α · n 2 m ( n − m ) n − m × � ( n 2 ) ( n − m )! m � � n + m 2 − n + m exp n 2 � �� � 2 Arbitrary ∆ ([de Panafieu, Ramos ’16]) 3 / 4 √ 2 m n n m m n ! 4 π n α ( n − m )! |G n , m , ∆ | ∼ · n 2 m ( n − m ) n − m × p � � z + 1 z ) + 1 4 φ 2 exp − n log ω ( � z ) + 2 m log � 2 φ 0 ( � 0 ( � z ) D., Ravelomanana Shifing the phase transition 23 / 51

  37. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Number of graphs with degree constraints 1 ∆ = Z ≥ 0 . Stirling approximation: √ 2 m n n m m n ! � ∼ 4 π n α · n 2 m ( n − m ) n − m × � ( n 2 ) ( n − m )! m � � n + m 2 − n + m exp n 2 � �� � 2 Arbitrary ∆ ([de Panafieu, Ramos ’16]) 3 / 4 √ 2 m n n m m n ! 4 π n α ( n − m )! |G n , m , ∆ | ∼ · n 2 m ( n − m ) n − m × p � � z + 1 z ) + 1 4 φ 2 exp − n log ω ( � z ) + 2 m log � 2 φ 0 ( � 0 ( � z ) D., Ravelomanana Shifing the phase transition 23 / 51

  38. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Contour integrals for subcritical phase Demonstration on the blackboard � U ( z ) n − m n ! 1 ( n − m )! e V ( z ) dz z n + 1 = 1 − O ( µ − 3 ) |G n , m , ∆ | 2 π i near the critical point m = α n :  z ω ′ ( � z )  def   2 α = φ 0 ( � z ) = � z ) , ω ( � z ω ′′ ( � z )  def   1 = φ 1 ( � z ) = � z ) . ω ′ ( � D., Ravelomanana Shifing the phase transition 24 / 51

  39. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Full range of densities Theorem ( Regime: m = α n ( 1 − µ n − 1 / 3 ) ) 1 if µ → −∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = 1 − Θ( | µ | − 3 ) ; 2 if | µ | = O ( 1 ) , i.e. µ is fixed, then P ( G n , m , ∆ has only trees and unicycles ) → constant ∈ ( 0 , 1 ) , P ( G n , m , ∆ has a complex part with total excess q ) → constant ∈ ( 0 , 1 ) , 3 if µ → + ∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = Θ( e − µ 3 / 6 µ − 3 / 4 ) , P ( G n , m , ∆ has a complex part with excess q ) = Θ( e − µ 3 / 6 µ 3 q / 2 − 3 / 4 ) . D., Ravelomanana Shifing the phase transition 25 / 51

  40. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Full range of densities Theorem ( Regime: m = α n ( 1 − µ n − 1 / 3 ) ) 1 if µ → −∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = 1 − Θ( | µ | − 3 ) ; 2 if | µ | = O ( 1 ) , i.e. µ is fixed, then P ( G n , m , ∆ has only trees and unicycles ) → constant ∈ ( 0 , 1 ) , P ( G n , m , ∆ has a complex part with total excess q ) → constant ∈ ( 0 , 1 ) , 3 if µ → + ∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = Θ( e − µ 3 / 6 µ − 3 / 4 ) , P ( G n , m , ∆ has a complex part with excess q ) = Θ( e − µ 3 / 6 µ 3 q / 2 − 3 / 4 ) . D., Ravelomanana Shifing the phase transition 25 / 51

  41. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Full range of densities Theorem ( Regime: m = α n ( 1 − µ n − 1 / 3 ) ) 1 if µ → −∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = 1 − Θ( | µ | − 3 ) ; 2 if | µ | = O ( 1 ) , i.e. µ is fixed, then P ( G n , m , ∆ has only trees and unicycles ) → constant ∈ ( 0 , 1 ) , P ( G n , m , ∆ has a complex part with total excess q ) → constant ∈ ( 0 , 1 ) , 3 if µ → + ∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = Θ( e − µ 3 / 6 µ − 3 / 4 ) , P ( G n , m , ∆ has a complex part with excess q ) = Θ( e − µ 3 / 6 µ 3 q / 2 − 3 / 4 ) . D., Ravelomanana Shifing the phase transition 25 / 51

  42. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Full range of densities Theorem ( Regime: m = α n ( 1 − µ n − 1 / 3 ) ) 1 if µ → −∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = 1 − Θ( | µ | − 3 ) ; 2 if | µ | = O ( 1 ) , i.e. µ is fixed, then P ( G n , m , ∆ has only trees and unicycles ) → constant ∈ ( 0 , 1 ) , P ( G n , m , ∆ has a complex part with total excess q ) → constant ∈ ( 0 , 1 ) , 3 if µ → + ∞ , | µ | = O ( n 1 / 12 ) , then P ( G n , m , ∆ has only trees and unicycles ) = Θ( e − µ 3 / 6 µ − 3 / 4 ) , P ( G n , m , ∆ has a complex part with excess q ) = Θ( e − µ 3 / 6 µ 3 q / 2 − 3 / 4 ) . D., Ravelomanana Shifing the phase transition 25 / 51

  43. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Geometric statement Demonstration on the blackboard def = r log ω ′ ( z ) − r log z + ( 1 − r ) log ( 2 ω − z ω ′ ) 1 h ( z ; r ) def = Re h ( z 0 e i θ ; r ) , 2 Φ( θ ; r ) � � θ ∈ [ 0 , 2 π ] Φ( θ ; r ) = Φ( θ ; r ) max � θ k = 2 π k p D., Ravelomanana Shifing the phase transition 26 / 51

  44. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Good old hypergeometric (Airy) function [FlJaKnŁuPi] � 1 � k e µ 3 / 6 � 2 3 2 / 3 µ A ( y , µ ) = 3 ( y + 1 ) / 3 k !Γ(( y + 1 − 2 k ) / 3 ) k ≥ 0 1 As µ → −∞ , � � 1 − 3 y 2 + 3 y − 1 1 + O ( µ − 6 ) A ( y , µ ) = √ 6 | µ | 3 2 π | µ | y − 1 / 2 2 As µ → + ∞ , � � e − µ 3 / 6 4 µ − 3 / 2 1 2 Γ( y / 2 − 3 / 2 ) + O ( µ − 2 ) A ( y , µ ) = Γ( y / 2 ) + √ 2 y / 2 | µ | 1 − y / 2 3 D., Ravelomanana Shifing the phase transition 27 / 51

  45. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma In-class excercise Excercise Trees and unicycles: y = 1 / 2. Complex component: y ≥ 1 + 1 / 2. As µ → −∞ , � � 1 − 3 y 2 + 3 y − 1 1 + O ( µ − 6 ) A ( y , µ ) = √ 6 | µ | 3 2 π | µ | y − 1 / 2 What is the asymptotics of A ( y , µ ) ? D., Ravelomanana Shifing the phase transition 28 / 51

  46. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma In-class excercise Excercise Trees and unicycles: y = 1 / 2. Complex component: y ≥ 1 + 1 / 2. As µ → −∞ , � � 1 − 3 y 2 + 3 y − 1 1 + O ( µ − 6 ) √ A ( y , µ ) = 6 | µ | 3 2 π | µ | y − 1 / 2 Asymptotics of A ( y , µ ) : � � 1 5 A ( 1 / 2 , µ ) ∼ √ 1 − 24 | µ | 3 2 π � � 1 1 + O ( | µ | − 3 ) √ A ( 3 / 2 , µ ) ∼ 2 π | µ | D., Ravelomanana Shifing the phase transition 28 / 51

  47. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma More than just probability: Analytic lemma Excercise As m = α n ( 1 − µ n − 1 / 3 ) , U ( z ) n − m √ n ! ( n − m )! |G n , m , ∆ | [ z n ] 2 π C y · A ( y , � C µ ) n y / 3 − 1 / 6 ( 1 − T 2 ( z )) y ∼ Excercise: P of 1 bicycle inside critical phase. Asymptotics? 1 2 D., Ravelomanana Shifing the phase transition 29 / 51

  48. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma More than just probability: Analytic lemma Excercise As m = α n ( 1 − µ n − 1 / 3 ) , √ U ( z ) n − m n ! 2 π C y · A ( y , � C µ ) n y / 3 − 1 / 6 ( n − m )! |G n , m , ∆ | [ z n ] ( 1 − T 2 ( z )) y ∼ Excercise: P of 1 bicycle inside critical phase. Asymptotics? 1 2 2-core contains 3 paths. D., Ravelomanana Shifing the phase transition 29 / 51

  49. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma More than just probability: Analytic lemma Excercise As m = α n ( 1 − µ n − 1 / 3 ) , U ( z ) n − m √ n ! ( n − m )! |G n , m , ∆ | [ z n ] 2 π C y · A ( y , � C µ ) n y / 3 − 1 / 6 ( 1 − T 2 ( z )) y ∼ Excercise: P of 1 bicycle inside critical phase. Asymptotics? 1 2 2-core contains 3 paths. “Mnemonic rule” y = − 1 2 ⇒ y = 3 − 1 2 . D., Ravelomanana Shifing the phase transition 29 / 51

  50. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma More than just probability: Analytic lemma Excercise As m = α n ( 1 − µ n − 1 / 3 ) , √ U ( z ) n − m n ! 2 π C y · A ( y , � C µ ) n y / 3 − 1 / 6 ( n − m )! |G n , m , ∆ | [ z n ] ( 1 − T 2 ( z )) y ∼ Excercise: P of 1 bicycle inside critical phase. Asymptotics? 1 2 C n ( y + 3 ) / 3 − 1 / 6 1 · n − m + 1 = O ( 1 ) n y / 3 − 1 / 6 D., Ravelomanana Shifing the phase transition 29 / 51

  51. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Local summary 1 Airy function from [FlJaKnŁuPi] 2 Contour integrals for m = linear ( n ) � α n 3 Core technical statement (due to Petrov): global max of real part complex function 4 Analytic lemma will be used afer. 1 We gain additional n 1 / 3 for each additional 1 − T 2 ( z ) . D., Ravelomanana Shifing the phase transition 30 / 51

  52. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Local summary 1 Airy function from [FlJaKnŁuPi] 2 Contour integrals for m = linear ( n ) � α n 3 Core technical statement (due to Petrov): global max of real part complex function 4 Analytic lemma will be used afer. 1 We gain additional n 1 / 3 for each additional 1 − T 2 ( z ) . D., Ravelomanana Shifing the phase transition 30 / 51

  53. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Local summary 1 Airy function from [FlJaKnŁuPi] 2 Contour integrals for m = linear ( n ) � α n 3 Core technical statement (due to Petrov): global max of real part complex function 4 Analytic lemma will be used afer. 1 We gain additional n 1 / 3 for each additional 1 − T 2 ( z ) . D., Ravelomanana Shifing the phase transition 30 / 51

  54. Problem and Motivation Desired probability Saddle-point method and analytic lemma Number of graphs with degree constraints Distribution of random parameters Contour integrals Lower bound for 2-SAT More than just probability: Analytic lemma Local summary 1 Airy function from [FlJaKnŁuPi] 2 Contour integrals for m = linear ( n ) � α n 3 Core technical statement (due to Petrov): global max of real part complex function 4 Analytic lemma will be used afer. 1 We gain additional n 1 / 3 for each additional 1 − T 2 ( z ) . D., Ravelomanana Shifing the phase transition 30 / 51

  55. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Outline 1 Problem and Motivation 2 Saddle-point method and analytic lemma 3 Distribution of random parameters 4 Lower bound for 2-SAT D., Ravelomanana Shifing the phase transition 31 / 51

  56. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Length of a 2-path Excercise q — excess (condition and then sum over q ) marked 2-path inside ← − complex component of some graph E [ u P n ] ∝ [ z n ] U ( z ) n − m + q ( n − m + q )! e V ( z ) 1 − T 2 ( z ) 1 − uT 2 ( z ) Qestion: asymptotics of length of 2-path? Hint: analytic lemma. D., Ravelomanana Shifing the phase transition 32 / 51

  57. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Length of a 2-path Excercise q — excess (condition and then sum over q ) marked 2-path inside ← − complex component of some graph E [ u P n ] ∝ [ z n ] U ( z ) n − m + q ( n − m + q )! e V ( z ) 1 − T 2 ( z ) 1 − uT 2 ( z ) � � E P n ⇐ d � Analytic lemma E P n ∼ C · n 1 / 3 du ( ∗ ) ⇐ � u = 1 D., Ravelomanana Shifing the phase transition 32 / 51

  58. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Bivariate EGF for tree height [Flajolet, Odlyzko ’82] n � � z n A [ h ] · u h F ( z , u ) = n n ! ↑ n ≥ 0 h = 0 # trees height h � � � d � 1 − z duF ( z , u ) ∼ C 1 log ρ , 1 � u = 1 � � � − 1 / 2 d 2 � � 1 − z du 2 F ( z , u ) ∼ C 2 2 � ρ u = 1 3 Modify analytic lemma for log ( 1 − φ 1 ( z )) . D., Ravelomanana Shifing the phase transition 33 / 51

  59. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Diameter, circumference and longest path of complex component All of order Θ( n 1 / 3 ) D., Ravelomanana Shifing the phase transition 34 / 51

  60. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Planarity Demonstration on the blackboard Let p ( µ ) be the probability that G n , m , ∆ is planar. 1 p ( µ ) = 1 − Θ( | µ | − 3 ) , as µ → −∞ ; 2 p ( µ ) → constant ∈ ( 0 , 1 ) , as | µ | = O ( 1 ) , and p ( µ ) is computable; 3 p ( µ ) → 0, as µ → + ∞ . D., Ravelomanana Shifing the phase transition 35 / 51

  61. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Experimental results (1/3) D., Ravelomanana Shifing the phase transition 36 / 51

  62. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Experimental results (2/3) D., Ravelomanana Shifing the phase transition 36 / 51

  63. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Experimental results (3/3) D., Ravelomanana Shifing the phase transition 36 / 51

  64. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Local summary 1 Phase transition of diameter, circumference, longest path. 2 Phase transition for planarity. 3 Diameter of trees and unicycles — open question? 4 Largest component — open question? 5 Stay tuned for 2-SAT! D., Ravelomanana Shifing the phase transition 37 / 51

  65. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Local summary 1 Phase transition of diameter, circumference, longest path. 2 Phase transition for planarity. 3 Diameter of trees and unicycles — open question? 4 Largest component — open question? 5 Stay tuned for 2-SAT! D., Ravelomanana Shifing the phase transition 37 / 51

  66. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Local summary 1 Phase transition of diameter, circumference, longest path. 2 Phase transition for planarity. 3 Diameter of trees and unicycles — open question? 4 Largest component — open question? 5 Stay tuned for 2-SAT! D., Ravelomanana Shifing the phase transition 37 / 51

  67. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Local summary 1 Phase transition of diameter, circumference, longest path. 2 Phase transition for planarity. 3 Diameter of trees and unicycles — open question? 4 Largest component — open question? 5 Stay tuned for 2-SAT! D., Ravelomanana Shifing the phase transition 37 / 51

  68. Problem and Motivation Length of a 2-path Saddle-point method and analytic lemma Diameter, circumference and longest path Distribution of random parameters Planarity Lower bound for 2-SAT Experimental results Local summary 1 Phase transition of diameter, circumference, longest path. 2 Phase transition for planarity. 3 Diameter of trees and unicycles — open question? 4 Largest component — open question? 5 Stay tuned for 2-SAT! D., Ravelomanana Shifing the phase transition 37 / 51

  69. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Outline 1 Problem and Motivation 2 Saddle-point method and analytic lemma 3 Distribution of random parameters 4 Lower bound for 2-SAT D., Ravelomanana Shifing the phase transition 38 / 51

  70. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT 2-CNF formula and digraph model Digraph representation and sum-representation of a 2- sat formula ( x 1 ∨ x 2 )( x 2 ∨ x 3 )( x 2 ∨ x 1 )( x 4 ∨ x 3 )( x 4 ∨ x 2 )( x 4 ∨ x 4 ) 1 1 1 4 1 4 2 2 3 4 3 4 + = 2 2 2 2 3 3 3 1 1 3 4 4 D., Ravelomanana Shifing the phase transition 39 / 51

  71. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Excercise on 2-CNF representation construction Excercise 2 2 1 2 2 1 = ??? + 3 3 3 3 1 1 D., Ravelomanana Shifing the phase transition 40 / 51

  72. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Excercise on 2-CNF representation construction Excercise 2 2 1 1 1 2 2 1 2 + = 2 3 3 3 3 3 3 1 1 D., Ravelomanana Shifing the phase transition 40 / 51

  73. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Digraph model from graph with degree constraint Lemma: CNF is UNSAT iff it contains a circuit x � x and x � x . Random CNF: G ( n , m , ∆) ⊕ G ( n , m , ∆) How to control the probability of circuit 1 � 1 � 1? Idea: probability the same as for any other circuit. D., Ravelomanana Shifing the phase transition 41 / 51

  74. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Complicated excercise on cycles Excercise Fix nodes x , y (say, x = 1 and y = 2). Condider random directed graphs with vertex degrees from ∆ , subcritical phase, condition on trees and unicycles. � 2 ℓ P ( x , y ∈ circuit of length ℓ ) =? ℓ ≥ 1 D., Ravelomanana Shifing the phase transition 42 / 51

  75. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Complicated excercise on cycles Excercise Fix nodes x , y (say, x = 1 and y = 2). Condider random directed graphs with vertex degrees from ∆ , subcritical phase, condition on trees and unicycles. � 2 ℓ P ( x , y ∈ circuit of length ℓ ) ℓ ≥ 1 Step 1. Mark the circuit + expectation of 2 L . � � � � � � � � z d z d � � V • ( z ) = circuit > 2 ( uz ) � � dz dz � � �� � � 2 markings z �→ � T 2 ( z ) , u = 2 D., Ravelomanana Shifing the phase transition 42 / 51

  76. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Complicated excercise on cycles Excercise Fix nodes x , y (say, x = 1 and y = 2). Condider random directed graphs with vertex degrees from ∆ , subcritical phase, condition on trees and unicycles. � 2 ℓ P ( x , y ∈ circuit of length ℓ ) ℓ ≥ 1 Step 2. Count the coefficient by analytic lemma. � � 1 U ( z ) n − m exp n ( n − 1 )[ z n ] � � � V • ( z ) , ∝ V ( z ) D., Ravelomanana Shifing the phase transition 42 / 51

  77. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Complicated excercise on cycles Excercise Fix nodes x , y (say, x = 1 and y = 2). Condider random directed graphs with vertex degrees from ∆ , subcritical phase, condition on trees and unicycles. � 2 ℓ P ( x , y ∈ circuit of length ℓ ) ℓ ≥ 1 Step 3. Final expression. 2 markings �→ n 2 / 3 (subcritical ×| µ | − 2 ): ∼ n 2 / 3 | µ | − 2 n ( n − 1 ) ∼ O ( n − 4 / 3 | µ | − 2 ) D., Ravelomanana Shifing the phase transition 42 / 51

  78. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Case without complex component Demonstration on the blackboard Subcritical case: n = α m ( 1 − µ n − 1 / 3 ) , µ → −∞ . 5 24 | µ | 3 + O ( | µ | − 6 ) P ( F n , m is SAT ) ≥ 1 − 4 5 5 3 2 4 2 3 1 1 1 1 = + 1 1 4 5 2 3 3 2 3 2 4 5 4 5 2 3 4 5 D., Ravelomanana Shifing the phase transition 43 / 51

  79. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Full statement of the theorem 1 P ( F n , m , ∆ is sat ) ≥ 1 − O ( | µ | − 3 ) as µ → −∞ , 2 P ( F n , m , ∆ is sat ) ≥ Θ( 1 ) as | µ | = O ( 1 ) , 3 P ( F n , m , ∆ is sat ) ≥ exp ( − Θ( µ 3 )) as µ → + ∞ . D., Ravelomanana Shifing the phase transition 44 / 51

  80. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Local summary 1 No complex component, contradictory circuit. Done by marking + analytic lemma. 2 Correction for non-uniformity? 3 Upper bound — what happens inside complex components? D., Ravelomanana Shifing the phase transition 45 / 51

  81. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Local summary 1 No complex component, contradictory circuit. Done by marking + analytic lemma. 2 Correction for non-uniformity? 3 Upper bound — what happens inside complex components? D., Ravelomanana Shifing the phase transition 45 / 51

  82. Problem and Motivation 2-CNF formula and digraph model Saddle-point method and analytic lemma Case without complex component Distribution of random parameters Full statement of the theorem Lower bound for 2-SAT Local summary 1 No complex component, contradictory circuit. Done by marking + analytic lemma. 2 Correction for non-uniformity? 3 Upper bound — what happens inside complex components? D., Ravelomanana Shifing the phase transition 45 / 51

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Shifing the thresold of phase transition in 2-SAT and random graphs Sergey Dovgal 1 , 2 , 3 , 4

Shifing the thresold of phase transition in 2-SAT and random graphs Sergey Dovgal 1 , 2 , 3 , 4

2-SAT, phase transitions and degree constraints Lower bound for 2-SAT Saddle-point method and analytic lemma Related results Shifing the thresold of phase transition in 2-SAT and random graphs Sergey Dovgal 1 , 2 , 3 , 4 Vlady Ravelomanana 2 1

1.06k views • 81 slides
R2D2P Workshop Workshop on on Transition Transition Phase Phase R2D2P Sydney,Australia 12-16

R2D2P Workshop Workshop on on Transition Transition Phase Phase R2D2P Sydney,Australia 12-16

R2D2P Workshop Workshop on on Transition Transition Phase Phase R2D2P Sydney,Australia 12-16 November 2007 Roberto Anasco EEEEEO O CTUf National Atomic Energy Commission Organization Chart President Executive Branch Regulatory

288 views • 25 slides
Phase Transition in 3SAT Yi Zhou Phase Transition in 3SAT Phase Transition in 3SAT Fine Grained

Phase Transition in 3SAT Yi Zhou Phase Transition in 3SAT Phase Transition in 3SAT Fine Grained

Phase Transition in 3SAT Phase Transition in 3SAT Yi Zhou Phase Transition in 3SAT Phase Transition in 3SAT Fine Grained Complexity Analysis Phase Transition in 3SAT Phase Transition in 3SAT Outline Phase Transition in 3SAT Fine Grained

651 views • 50 slides
Chiral phase transition of (2 + 1)-flavor QCD QCD phase diagram Sheng-Tai Li for HotQCD

Chiral phase transition of (2 + 1)-flavor QCD QCD phase diagram Sheng-Tai Li for HotQCD

Chiral phase transition of (2 + 1)-flavor QCD Chiral phase transition of (2 + 1)-flavor QCD QCD phase diagram Sheng-Tai Li for HotQCD collaboration MEOS Lattice Setup NO evidence Institute of Particle Physics for the 1st order phase

327 views • 18 slides
On the compressible Euler equations for two phase flows with phase transition Maren Hantke

On the compressible Euler equations for two phase flows with phase transition Maren Hantke

Outline Introduction Previous results Model description - nonisothermal case Phase boundaries Creation of new phases Riemann solver On the compressible Euler equations for two phase flows with phase transition Maren Hantke

716 views • 24 slides
Anomaly matching in QCD thermal phase transition Kazuya Yonekura Tohoku U. Based on

Anomaly matching in QCD thermal phase transition Kazuya Yonekura Tohoku U. Based on

1 Anomaly matching in QCD thermal phase transition Kazuya Yonekura Tohoku U. Based on [1706.06104] with Hiroyuki Shimizu [1901.08188] 2 Introduction QCD phase transition is important for cosmology: Axiom abundance etc. Most radical

535 views • 41 slides
Leptogenesis via Phase Transition Ye-Ling Zhou, Southampton, 27 November 2018 1. Baryogenesis

Leptogenesis via Phase Transition Ye-Ling Zhou, Southampton, 27 November 2018 1. Baryogenesis

Leptogenesis via Phase Transition Ye-Ling Zhou, Southampton, 27 November 2018 1. Baryogenesis via leptonic CP-violating phase transition S Pascoli, J Turner, YLZ , arXiv:1609.07969 2. Leptogenesis via Varying Weinberg Operator: the

351 views • 22 slides
Phase Transition of Inhomogeneous Random Graphs lie de Panafieu Liafa, Universit

Phase Transition of Inhomogeneous Random Graphs lie de Panafieu Liafa, Universit

Phase Transition of Inhomogeneous Random Graphs lie de Panafieu Liafa, Universit Paris-Diderot May 28, 2013 Joint work with Vlady Ravelomanana lie de Panafieu Phase Transition of Inhomogeneous Random Graphs Introduction The

863 views • 41 slides
Electroweak Phase Transition and Sphaleron Eibun Senaha (Natl Taiwan U) April 7, 2017 ACFI

Electroweak Phase Transition and Sphaleron Eibun Senaha (Natl Taiwan U) April 7, 2017 ACFI

Electroweak Phase Transition and Sphaleron Eibun Senaha (Natl Taiwan U) April 7, 2017 ACFI Workshop: Making the Electroweak Phase Transition (Theoretically) Strong @Umass-Amherst Outline part1: EWPT and sphaleron in a complex-extended SM

789 views • 77 slides
Phase transition and axial anomaly in the 3-flavor chiral meson model Gergely Fej os Research

Phase transition and axial anomaly in the 3-flavor chiral meson model Gergely Fej os Research

Phase transition and axial anomaly in the 3-flavor chiral meson model Gergely Fej os Research Center for Nuclear Physics Osaka University Workshop on J-PARC hadron physics 2016 a 4th March, 2016 Gergely Fej os Phase transition and

336 views • 22 slides
Phase transition dynamics and gravitational waves Ariel M egevand Universidad Nacional de Mar

Phase transition dynamics and gravitational waves Ariel M egevand Universidad Nacional de Mar

Phase transition dynamics and gravitational waves Ariel M egevand Universidad Nacional de Mar del Plata Argentina XIII MEXICAN SCHOOL OF PARTICLES AND FIELDS October 2008 A. M egevand (Mar del Plata, Argentina) Phase transition dynamics

353 views • 31 slides
Evolution of Critical Corelations in the QCD Phase Transition E. N. Saridakis

Evolution of Critical Corelations in the QCD Phase Transition E. N. Saridakis

Evolution of Critical Corelations in the QCD Phase Transition E. N. Saridakis msaridak@phys.uoa.gr Nuclear and Particle Physics Section, Physics Department, University of Athens in collaboration with N.G.Antoniou and F .K.Diakonos HEP 2006,

442 views • 40 slides
~0 QCD phase diagram (for , , quarks) Phase transition crossover

~0 QCD phase diagram (for , , quarks) Phase transition crossover

Frontiers in Lattice QCD and related topics Kei Suzuki (JAEA) from JLQCD Collaboration: Sinya Aoki (YITP) , Yasumichi Aoki (RIKEN R-CCS) , Guido Cossu (Edinburgh) , Hidenori Fukaya (Osaka U.) , Shoji Hashimoto (KEK) ~0 QCD phase

1.14k views • 39 slides
Phase Transition of Anti-Symmetric Kazumi Okuyama Shinshu U, Japan Workshop@Michigan Kazumi

Phase Transition of Anti-Symmetric Kazumi Okuyama Shinshu U, Japan Workshop@Michigan Kazumi

Phase Transition of Anti-Symmetric Kazumi Okuyama Shinshu U, Japan Workshop@Michigan Kazumi Okuyama (Shinshu U, Japan) Workshop@Michigan 1 / 19 Wilson Loops in N = 4 SYM based on my recent paper [arXiv:1709.04166] Phase Transition of

360 views • 19 slides
The Roberge-Weiss transition Lattice QCD Lattice basics Phase structure of QCD at imaginary

The Roberge-Weiss transition Lattice QCD Lattice basics Phase structure of QCD at imaginary

The Roberge- Weiss transition Michele Andreoli The Roberge-Weiss transition Lattice QCD Lattice basics Phase structure of QCD at imaginary chemical potential Montecarlo Fermion and generic number of flavors. determinant Imaginary A

508 views • 26 slides
Gravitational wave from neutron star phase transition Shu Lin 2018.11.4 ATHIC 2018, Hefei

Gravitational wave from neutron star phase transition Shu Lin 2018.11.4 ATHIC 2018, Hefei

Gravitational wave from neutron star phase transition Shu Lin 2018.11.4 ATHIC 2018, Hefei based on 1810.00528, Gaoqing Cao, SL Outline Introduction GW from binary neutron star merger GW generation from nuclear/quark matter phase

543 views • 19 slides
Non-Redundant Aperture Masking Robert J. Vanderbei 2009 November 6 TPF Group Meeting

Non-Redundant Aperture Masking Robert J. Vanderbei 2009 November 6 TPF Group Meeting

Non-Redundant Aperture Masking Robert J. Vanderbei 2009 November 6 TPF Group Meeting http://www.princeton.edu/ rvdb Forget PICTURES Today were doing MATH Aperture Mask Consider a telescope with focal length f and an aperture

715 views • 20 slides
Outline of the talk Introduction & motivations. The 2-XORSAT phase transition. MAX-2-XORSAT.

Outline of the talk Introduction & motivations. The 2-XORSAT phase transition. MAX-2-XORSAT.

Random 2-XORSAT/MAX-2-XORSAT and their phase transitions V LADY R AVELOMANANA LIAFA UMR CNRS 7089 . Universit Denis Diderot. vlad@liafa.jussieu.fr joint work with H ERV D AUD (LATP Universit de Provence) & V ONJY R

735 views • 52 slides
1. KPZ for surface growth Paper combustion, bacteria colony, crystal growth, liquid crystal

1. KPZ for surface growth Paper combustion, bacteria colony, crystal growth, liquid crystal

KPZ 10 Mar 2014 @ 1 1. KPZ for surface growth Paper combustion, bacteria colony, crystal growth, liquid crystal turbulence Non-equilibrium statistical mechanics

581 views • 41 slides
Geometry of Discrete Painlev e Equations and Applications Anton Dzhamay School of Mathematical

Geometry of Discrete Painlev e Equations and Applications Anton Dzhamay School of Mathematical

Geometry of Discrete Painlev e Equations and Applications Anton Dzhamay School of Mathematical Sciences, University of Northern Colorado, Greeley, CO Based on the joint work with Tomoyuki Takenawa Tokyo University of Marine Science and

2.03k views • 175 slides
Lebesgue integration of oscillating and subanalytic functions Tamara Servi (University of Pisa)

Lebesgue integration of oscillating and subanalytic functions Tamara Servi (University of Pisa)

Lebesgue integration of oscillating and subanalytic functions Tamara Servi (University of Pisa) (joint work with R. Cluckers, G. Comte, D. Miller, J.-P. Rolin) 19th July 2015 Motivation and background Motivation and background Oscillatory

1.32k views • 90 slides
Matrix Schrdinger operator on the half-line: the differential equation with respect to the

Matrix Schrdinger operator on the half-line: the differential equation with respect to the

Motivation Main Results Applications Matrix Schrdinger operator on the half-line: the differential equation with respect to the spectral parameter and an analog of Freuds equations. Valentin Strazdin St.Petersburg State University

331 views • 14 slides
Connection Preserving Deformation Approach to the Q-Difference Equations Chuan-Tsung Chan

Connection Preserving Deformation Approach to the Q-Difference Equations Chuan-Tsung Chan

Connection Preserving Deformation Approach to the Q-Difference Equations Chuan-Tsung Chan Department of Applied Physics, Tunghai University 24th Annual Workshop on Differential Equations National Sun Yat-sen University, Kaohsiung, Taiwan

499 views • 29 slides
2 Outline Motivation Experimental Setup Polarization Observables Analysis Methods Selected

2 Outline Motivation Experimental Setup Polarization Observables Analysis Methods Selected

Polarization Observables T and F in Single 0 and -Photoproduction off Quasi-Free Nucleons Thomas Strub, A2 Collaboration University of Basel 28th August 2014, PANIC 2014 A 2 Outline Motivation Experimental Setup Polarization

448 views • 31 slides

More recommend