Hi, I'm James Raj!

Physics PhD student at UCLA, advised by Mason Porter.

About Me

James Raj

I am a 4th year Physics PhD student at UCLA working with Mason Porter. My research focuses on networks that arise from physical systems. For example, I study networks generated from hyperuniform point patterns, which are disordered arrangements of points that suppress large-scale density fluctuations (see figure below) and appear in settings ranging from leaf vein networks to the large-scale distribution of galaxies. I also study networks extracted from scale-rich metamaterials, which are engineered structures with elements spanning many length scales. I use tools from network science, topological data analysis (TDA), and statistical physics to understand how the structure and connectivity of these networks shape their transport and mechanical properties.

I am also interested in physical learning, where physical systems such as resistor networks are trained to perform computational tasks through local adaptation rules, and in persistent homology, a technique from TDA for detecting multi-scale structure in data.

Comparison of Poisson vs hyperuniform point patterns, their Delaunay networks, and structure factor S(k) scaling
Poisson (top) vs hyperuniform (bottom) point patterns, their Delaunay networks, and structure factor S(k). Hyperuniform patterns suppress long-wavelength density fluctuations: S(k) → 0 as k → 0.

Current Research

Trained conductances in a random geometric network showing learned edge weights
Network structure shapes accessible solutions in physical learning

Many network-based physical systems, from spring networks to electrical circuits, can adapt themselves through purely local interactions, with no centralized control and no global signal indicating the desired output. We study how the underlying network topology shapes what such local rules can achieve. As a concrete case, we consider opening a phononic band gap on a disordered mass-spring network using a strictly local update rule. Whether the system succeeds depends heavily on the network. Spatial Delaunay and Watts-Strogatz networks typically succeed, while Erdős-Rényi networks mostly fail. These results point to network structure as a fundamental determinant of what local-rule physical learning can achieve.

Eigenfrequency histograms before and after training for four network topologies, with target band-gap window highlighted

Eigenfrequency distributions before and after training for one representative run on each of four network families, with the target band-gap window highlighted. The diagram beside each histogram shows the corresponding trained network, with edge thickness proportional to the learned weight.

Scale-rich metamaterial tessellation
Understanding Network Properties of Scale-Rich Metamaterials

Scale-rich network-based metamaterials (Both et al., 2025) are engineered structures built by placing ligaments with power-law-distributed thicknesses and lengths. I develop a novel network formulation for these structures, where edge weights correspond to axial conductances derived from beam mechanics, making the graph Laplacian equivalent to the mechanical stiffness matrix. Using this formulation, I derive analytic bounds on transport properties like directional effective resistance and anisotropy, and study Anderson-like localization in the Laplacian spectrum, where vibrational modes become spatially trapped as structural heterogeneity increases.

Directional effective resistance anisotropy: polar plots at three alpha values and anisotropy ratio vs alpha

Directional effective resistance becomes increasingly anisotropic as the heterogeneity parameter α grows. Polar plots show Reff measured along 6 directions; the rightmost panel summarizes the anisotropy ratio (max/min Reff) across α values.

Simplicial complex on a clustered point pattern
TDA for Clustering Detection

Topological data analysis (TDA) applies ideas from algebraic topology and computational geometry to study the shape of data. We use TDA to detect clustering at multiple scales in spatial point patterns, such as distinguishing tightly packed clumps from loosely spread ones, and connect these topological signatures to classical statistical physics measures of correlation and connectivity.

Simplicial complexes on a clustered point pattern at three filtration scales

A clustered point pattern and its Vietoris-Rips simplicial complex at increasing filtration radius ε. As ε grows, local clusters connect and topological features (loops, voids) appear and disappear. Persistent homology tracks these changes.

Publications

Local Geometric and Transport Properties of Networks that are Generated from Hyperuniform Point Patterns
J. V. Raj, X. Sun, C. E. Maher, K. A. Newhall, M. A. Porter. arXiv preprint (2025).
Abstract ▼
Hyperuniformity, which is a type of long-range order that is characterized by the suppression of long-range density fluctuations in comparison to the fluctuations in standard disordered systems, has emerged as a powerful concept to aid in the understanding of diverse natural and engineered phenomena. In the present paper, we harness hyperuniform point patterns to generate a class of disordered, spatially embedded networks that are distinct from both perfectly ordered lattices and uniformly random geometric graphs. We refer to these networks as hyperuniform-point-pattern-induced (HuPPI) networks, and we compare them to their counterpart Poisson-point-pattern-induced (PoPPI) networks. By computing the local geometric and transport properties of HuPPI networks, we demonstrate how hyperuniformity imparts advantages in both transport efficiency and robustness. Specifically, we show that HuPPI networks have systematically smaller total effective resistances, slightly faster random-walk mixing times, and fewer extreme-curvature edges than PoPPI networks. Counterintuitively, we also find that HuPPI networks simultaneously have more negative mean Ollivier–Ricci curvatures and smaller total effective resistances than PoPPI networks, indicating that edges with moderately negative curvatures need not create severe bottlenecks to transport. Moreover, HuPPI networks are consistently more robust under both random edge removals and curvature-based targeted edge removals, maintaining larger connected components for larger fractions of removed edges than their PoPPI counterparts. We also demonstrate that the network-generation method strongly influences these properties and in particular that it often overshadows differences that arise from underlying point patterns.
Phase-field simulations of morphology development in reactive polymer blending
R. Sengupta, M. D. Tikekar, J. V. Raj, K. T. Delaney, M. C. Villet, G. H. Fredrickson. Journal of Rheology 67(1), 1-14 (2023).
Abstract ▼
Reactive blending is an efficient method for synthesizing polymer blends. Industrially, this process is carried out in extruders where reacting polymers and generated copolymers are subjected to high shear stresses. The dynamics and resulting morphology are dictated by coupling of hydrodynamic forces in the extruder, thermodynamic interactions between species, and reaction kinetics on a complex interfacial manifold. We use phase-field simulations to quantify the evolution of reactive blending under external shear flow for model systems of two homopolymers of equal length that react via end-coupling to produce a diblock copolymer. We compare morphology development in cylindrical thread and droplet geometries. Our results indicate that shear suppresses Rayleigh capillary instability in threads while accelerating reaction rates in drops by expanding the interfacial contact area.

Personal

Hobbies

I love baking! I make everything from sourdough and pizzas to croissants, brioche rolls, cookies, and all sorts of other things. I enjoy making a lot of the recipes from Claire Saffitz's YouTube channel. I'm also really into chess, both playing and watching. My peak rating is 2150 on Chess.com Rapid, though I try not to think about where it is right now.

Music

Some of my favorite artists are yeule, Sufjan Stevens, Quadeca, Jane Remover, Porter Robinson, and Alex G. If I had to pick one album, it would be Sufjan Stevens' Carrie & Lowell. If you haven't listened to it, I'd really recommend it. See more of my favorite songs →

Contact

james@physics.ucla.edu

Office: Mathematical Sciences (MS) 7611