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
Parents
177
The spatial averaging theorem revisited
F. A. Howes, Stephen Whitaker · Chemical Engineering Science · 1985 · 306 citations
1–5 of 177
354
5
h-index
4
h-index
4
h-index
Institute for Information Transmission Problems, Russia
3 publications · 99 citations
3
h-index
3
h-index
1–5 of 354
199
University of Maryland, College Park
College Park, United States
8 h-index
11 publications
530 citations

Northwestern Polytechnical University
Xi'an, China
6 h-index
12 publications
404 citations
University of California, Los Angeles
Los Angeles, United States
5 h-index
8 publications
144 citations

Huazhong University of Science and Technology
Wuhan, China
5 h-index
8 publications
285 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
7 publications
197 citations

Swansea University
Swansea, United Kingdom
3 h-index
3 publications
123 citations

Sorbonne Université
Paris, France
3 h-index
3 publications
308 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
3 publications
47 citations
1–8 of 199
8 publications · 266 citations
7
h-index
5 publications · 186 citations
5
h-index
4 publications · 97 citations
4
h-index
3 publications · 324 citations
3
h-index
2 publications · 82 citations
2
h-index
1–5