Related papers: Branching Law for Axons
In this paper we develop a probabilistic micro-scale compartmental model and use it to study macro-scale properties of axonal transport, the process by which intracellular cargo is moved in the axons of neurons. By directly modeling the…
The evolution of aligned DNA sequence sites is generally modeled by a Markov process operating along the edges of a phylogenetic tree. It is well known that the probability distribution on the site patterns at the tips of the tree…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
Efficient LLM pre-training requires well-tuned hyperparameters (HPs), including learning rate $\eta$ and weight decay $\lambda$. We study scaling laws for HPs: formulas for how to scale HPs as we scale model size N, dataset size D, and…
We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume that the leaves have access to independent and identically…
Given two phylogenetic trees on the same set of taxa X, the maximum parsimony distance d_MP is defined as the maximum, ranging over all characters c on X, of the absolute difference in parsimony score induced by c on the two trees. In this…
Differential growth processes play a prominent role in shaping leaves and biological tissues. Using both analytical and numerical calculations, we consider the shapes of closed, elastic strips which have been subjected to an inhomogeneous…
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…
Axons functionally link the somato-dendritic compartment to synaptic terminals. Structurally and functionally diverse, they accomplish a central role in determining the delays and reliability with which neuronal ensembles communicate. By…
Machine learning is increasingly used to guide branch-and-cut (B&C) for mixed-integer linear programming by learning score-based policies for selecting branching variables and cutting planes. Many approaches train on local signals from…
We study ancestral lineages of individuals of a stationary discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice $\mathbb{Z}^d$. Each individual produces a Poissonian number of offspring with mean $\mu$…
We consider two Dirichlet p-branes with lower dimensional brane charges and their scattering. We first calculate the cylinder amplitude of open string with suitable boundary conditions. We compare this result with that in the IIB matrix…
We propose a theory for ocular dominance (OD) patterns in mammalian primary visual cortex. This theory is based on the premise that OD pattern is an adaptation to minimize the length of intra-cortical wiring. Thus we can understand the…
We consider the problem of slotted asynchronous coded communication, where in each time frame (slot), the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide…
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that…
We consider a particle system in continuous time, discrete population, with spatial motion and nonlocal branching. The offspring's weights and their number may depend on the mother's weight. Our setting captures, for instance, the processes…
This article explores an optimal stopping problem for branching diffusion processes. It consists in looking for optimal stopping lines, a type of stopping time that maintains the branching structure of the processes under analysis. By using…
The branching geometry of biological transport networks is characterized by a diameter scaling exponent $\alpha$. Two structural attractors compete: impedance matching ($\alpha \sim 2$) for pulsatile flow and viscous-metabolic minimization…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
The Artificial Axon is a unique synthetic system, based on biomolecular components, which supports action potentials. Here we examine, experimentally and theoretically, the properties of the threshold for firing in this system. As in real…