The role of BKM-type theorems in 3D3D Euler, Navier-Stokes and Cahn-Hilliard-Navier-Stokes analysis

The Beale-Kato-Majda theorem contains a single criterion that controls the behaviour of solutions of the $3D$ incompressible Euler equations. Versions of this theorem are discussed in terms of the regularity issues surrounding the $3D$ incompressible Euler and Navier-Stokes equations together with a phase-field model for the statistical mechanics of binary mixtures called the $3D$ Cahn-Hilliard-Navier-Stokes (CHNS) equations. A theorem of BKM-type is established for the CHNS equations for the full parameter range. Moreover, for this latter set, it is shown that there exists a Reynolds number and a bound on the energy-dissipation rate that, remarkably, reproduces the $Re^{3/4}$ upper bound on the inverse Kolmogorov length normally associated with the Navier-Stokes equations alone. An alternative length-scale is introduced and discussed, together with a set of pseudo-spectral computations on a $128^{3}$ grid.Comment: 3 figures and 3 table

A regularity criterion for solutions of the three-dimensional Cahn-Hilliard-Navier-Stokes equations and associated computations

We consider the 3D Cahn-Hilliard equations coupled to, and driven by, the forced, incompressible 3D Navier-Stokes equations. The combination, known as the Cahn-Hilliard-Navier-Stokes (CHNS) equations, is used in statistical mechanics to model the motion of a binary fluid. The potential development of singularities (blow-up) in the contours of the order parameter $\phi$ is an open problem. To address this we have proved a theorem that closely mimics the Beale-Kato-Majda theorem for the $3D$ incompressible Euler equations [Beale et al. Commun. Math. Phys., Commun. Math. Phys., ${\rm 94}$, $61-66 ({\rm 1984})$]. By taking an $L^{\infty}$ norm of the energy of the full binary system, designated as $E_{\infty}$, we have shown that $\int_{0}^{t}E_{\infty}(\tau)\,d\tau$ governs the regularity of solutions of the full 3D system. Our direct numerical simulations (DNSs), of the 3D CHNS equations, for (a) a gravity-driven Rayleigh Taylor instability and (b) a constant-energy-injection forcing, with $128^3$ to $512^3$ collocation points and over the duration of our DNSs, confirm that $E_{\infty}$ remains bounded as far as our computations allow.Comment: 11 pages, 3 figure

Characterization and control of small-world networks

Recently Watts and Strogatz have given an interesting model of small-world networks. Here we concretise the concept of a ``far away'' connection in a network by defining a {\it far edge}. Our definition is algorithmic and independent of underlying topology of the network. We show that it is possible to control spread of an epidemic by using the knowledge of far edges. We also suggest a model for better advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.Comment: 9 pages and 6 figure

Effect of shape anisotropy on transport in a 2-dimensional computational model: Numerical simulations showing experimental features observed in biomembranes

We propose a 2-d computational model-system comprising a mixture of spheres and the objects of some other shapes, interacting via the Lennard-Jones potential. We propose a reliable and efficient numerical algorithm to obtain void statistics. The void distribution, in turn, determines the selective permeability across the system and bears a remarkable similarity with features reported in certain biological experiments.Comment: 1 tex file, 2 sty files and 5 figures. To appear in Proc. of StatPhys conference held in Calcutta, Physica A 199

Random spread on the family of small-world networks

We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the random walk. We introduce an {\em independent step approximation}, which enables us to obtain analytic results for the average access time. We observe a scaling relation for the average access time in the degree of the nodes. The behavior of average access time as a function of $p$, shows striking similarity with that of the {\em characteristic length} of the graph. This observation may have important applications in routing and switching in networks with large number of nodes.Comment: RevTeX4 file with 6 figure