Averaging Principle

The Averaging Principle is a mathematical theorem within combinatorial analysis that states if the average of a set of values exceeds a certain threshold, then at least one element in the set must be greater than or equal to that threshold, thereby guaranteeing the existence of a particular lower bound instance.

177

Publications

7.1K

Citations

354

Authors

199

Institutions

Publications per year

2017–2026

29

Authors

354

  1. MF
    Mark Freidlin

    University of Maryland, College Park, United States

    5 publications · 200 citations

    5

    h-index

  2. YX
    Yong Xu

    Northwestern Polytechnical University, China

    4 publications · 146 citations

    4

    h-index

  3. BP
    Bin Pei

    Northwestern Polytechnical University, China

    4 publications · 146 citations

    4

    h-index

  4. AY
    A. Yu. Veretennikov

    Institute for Information Transmission Problems, Russia

    3 publications · 99 citations

    3

    h-index

  5. JL
    Jicheng Liu

    North China Electric Power University, China

    3 publications · 116 citations

    3

    h-index

1–5 of 354

Venues

  1. 7

    h-index

  2. Stochastics and Dynamics

    5 publications · 186 citations

    5

    h-index

  3. Fractal and Fractional

    4 publications · 97 citations

    4

    h-index

  4. The Journal of Chemical Physics

    3 publications · 324 citations

    3

    h-index

  5. SIAM Journal on Control and Optimization

    2 publications · 82 citations

    2

    h-index

1–5