Related papers: Poresizes in random line networks
A model of randomly distributed overlapping spheres of different radii is represented to describe a heterogeneous porous medium. Two-particle correlation function of the relative position of pores of different radii in the medium space was…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
Microscopy research often requires recovering particle-size distributions in three dimensions from only a few (10 - 200) profile measurements in the section. This problem is especially relevant for petrographic and mineralogical studies,…
Local porosity distributions for a three-dimensional porous medium and local porosity distributions for a two-dimensional plane-section through the medium are generally different. However, for homogeneous and isotropic media having finite…
We investigate the chemical dissolution of porous media using a network model in which the system is represented as a series of interconnected pipes with the diameter of each segment increasing in proportion to the local reactant…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…
The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…
Theory is presented for the distributions of local process intensity and local average pore dimensions in random fibrous materials. For complete partitioning of the network into contiguous square zones, the variance of local process…
This note presents a simulation method for investigating the relationship between porosity and particle size distribution in porous media characterization. The method simulates particle packing based on particle size distributions,…
The collision dynamics of hard spheres and cylindrical pores is solved exactly, which is the minimal model for a regularly porous membrane. Nonequilibrium event-driven molecular dynamics simulations are used to show that the permeability…
We model porous membrane filters as networks of connected cylindrical pores via a random network generation protocol, and their initial pore radii via a uniform distribution of widths that vary about some mean value. We investigate the…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
In a model of a connected network on random points in the plane, one expects that the mean length of the shortest route between vertices at distance $r$ apart should grow only as $O(r)$ as $r \to \infty$, but this is not always easy to…
Descriptors that characterize the geometry and topology of the pore space of porous media are intimately linked to their transport properties. We quantify such descriptors, including pore-size functions and the critical pore radius…
Porcolation simulations were carried out on various networks; both regular and irregular. The saturation curve was obtained for cubic networks, localized and completely random 3D networks and networks based on exotic graphs like…