Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 103 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 27 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 92 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 241 tok/s Pro
2000 character limit reached

Nearest-neighbor connectedness theory: A general approach to continuum percolation (2103.12406v1)

Published 23 Mar 2021 in cond-mat.stat-mech and cond-mat.soft

Abstract: We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by investigating geometric percolation of non-interacting line segments and disks in two spatial dimensions. These examples serve as models for electrical percolation of elongated and flat nanofillers in thin film composites. While the standard contact volume argument and extensions thereof in connectedness percolation theory yield accurate predictions for slender nanofillers in three dimensions, they fail to do so in two dimensions, making our test a stringent one. In fact, neither a systematic order-by-order correction to the standard argument nor invoking the connectedness version of the Percus-Yevick approximation yield significant improvements for either type of particle. Making use of simple geometric considerations, our new method predicts a percolation threshold of $\rho_c l2 \approx 5.83$ for segments of length $l$, which is close to the $\rho_c l2 \approx 5.64$ found in Monte Carlo simulations. For disks of area $a$ we find $\rho_c a \approx 1.00$, close to the Monte Carlo result of $\rho_c a \approx 1.13$. We discuss the shortcomings of the conventional approaches and explain how usage of the nearest-neighbor distribution in our new method bypasses those complications.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run paper prompts using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube