Related papers: Loewner Evolution for Critical Invasion Percolatio…
Previous studies of connectivity in wireless networks have focused on undirected geometric graphs. More sophisticated models such as Signal-to-Interference-and-Noise-Ratio (SINR) model, however, usually leads to directed graphs. In this…
We prove that the Minimal Spanning Tree and the Invasion Percolation Tree on a version of the triangular lattice in the complex plane have unique scaling limits, which are invariant under rotations, scalings, and, in the case of the MST,…
We analyse the scaling of the weights added by invasion percolation on a branching process tree. This process is a paradigm model of self-organised criticality, where criticality is approach without a prespecified parameter. In this paper,…
Electromigration (EM) is one of the major concerns in the reliability analysis of very large scale integration (VLSI) systems due to the continuous technology scaling. Accurately predicting the time-to-failure of integrated circuits (IC)…
We propose to use a simulation driven inverse inference approach to model the dynamics of tree branches under manipulation. Learning branch dynamics and gaining the ability to manipulate deformable vegetation can help with occlusion-prone…
We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…
The diffusion of tracer particles immersed in a granular gas under uniform shear flow (USF) is analyzed within the framework of the inelastic Boltzmann equation. Two different but complementary approaches are followed to achieve exact…
Evolving graphs arise in problems where interrelations between data change over time. We present a breadth first search (BFS) algorithm for evolving graphs that computes the most direct influences between nodes at two different times. Using…
Recent advances in machine learning have become increasingly popular in the applications of phase transitions and critical phenomena. By machine learning approaches, we try to identify the physical characteristics in the two-dimensional…
We derive the Ward identities of Conformal Field Theory (CFT) within the framework of Schramm-Loewner Evolution (SLE) and some related processes. This result, inspired by the observation that particular events of SLE have the correct…
Recent DiT-based text-to-image models increasingly adopt LLMs as text encoders, yet text conditioning remains largely static and often utilizes only a single LLM layer, despite pronounced semantic hierarchy across LLM layers and…
Linear Mode Connectivity (LMC) refers to the phenomenon that performance remains consistent for linearly interpolated models in the parameter space. For independently optimized model pairs from different random initializations, achieving…
We study the dynamics of the Fisher-KPP equation on the infinite homogeneous tree and Erd\H{o}s-R\'eyni random graphs. We assume initial data that is zero everywhere except at a single node. For the case of the homogeneous tree, the…
We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus…
Despite significant progress in alignment, large language models (LLMs) remain vulnerable to adversarial attacks that elicit harmful behaviors. Activation steering techniques offer a promising inference-time intervention approach, but…
We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…
Reinforcement learning with stochastic optimal control offers a promising framework for diffusion fine-tuning, where a pre-trained diffusion model is optimized to generate paths that lead to a reward-tilted distribution. While these…
Invasion bond percolation (IBP) is mapped exactly into Prim's algorithm for finding the shortest spanning tree of a weighted random graph. Exploring this mapping, which is valid for arbitrary dimensions and lattices, we introduce a new IBP…
Scaling laws have emerged as a unifying lens for understanding and guiding the training of large language models (LLMs). However, existing studies predominantly focus on the final-step loss, leaving open whether the entire loss dynamics…
Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O(m+n)$ time for a graph having $n$ vertices and $m$ edges. In the streaming model, an algorithm is…