SearcharxivSearch

arXiv subjects

Reza Rastegar

Publications and source records attributed to Reza Rastegar.

At least 19 recordsLinked to original sources

Soft-to-Hard Routing in Sparse Mixture-of-Experts Models

Softmax routing approaches hard top-1 routing as the temperature tends to zero, but the limiting passage is singular at router ties. This paper develops a boundary-layer calculus for this soft-to-hard limit in population squared-loss mixture-of-experts regression. For a router with logits $a_k(x;\phi)$, the relevant local quantity is the top-two margin $\Delta(x;\phi)$, and the relevant global quantity is the boundary mass $\mathbb{P}(\Delta(X;\phi)\le w)$. Under smoothness and transversality assumptions, coarea and tubular-neighborhood estimates show how this mass scales with the slab width; in the binary case the leading coefficient is an explicit surface integral over the routing interface. These geometric estimates give quantitative bounds between the soft objective $L_\tau$ and the hard objective $L_0$, including an $O(\tau^\alpha)$ uniform comparison under a margin-tail condition, and yield $\Gamma$-convergence of the soft objectives on compact parameter spaces. The main conclusion is that the zero-temperature approximation is controlled by the probability carried by an $O(\tau)$ neighborhood of the routing interfaces, not by temperature alone. After isolating this boundary-layer part of the problem, we record a conditional landscape-transfer theorem from hard to small-temperature soft routing and a reduced two-expert Gaussian calculation illustrating local symmetry breaking. Synthetic diagnostics are included only as controlled checks of the boundary-layer predictions.

cs.LG

Lyapunov Exponents for Sparsely Coupled Linear Cocycles

This paper studies structured products of real matrices for which the top Lyapunov exponent can be accessed by reducing the dynamics to an amenable generalization of upper triangular matrices. Exploiting prescribed zero patterns (including block-triangularity and sparse decompositions, conveniently encoded by a directed sparsity graph), we obtain explicit, computable bounds and, in favorable cases, formulas for $\gamma_1$ by combining deterministic triangular controls with a suitable refinement of the Furstenberg--Kifer lemma for block-triangular products. The estimates apply both to tempered (possibly deterministic) sequences and to stationary ergodic random cocycles under standard integrability. We also discuss applications to perturbation models for linear systems, including low-rank updates, where the reduction converts the problem to lower-dimensional or scalar cocycles.

math.DS

Catalyzing System-level Decarbonization: An Analysis of Carbon Matching As An Accounting Framework

Carbon matching aims to improve corporate carbon accounting by tracking emissions rather than energy consumption and production. We present a mathematical derivation of carbon matching using marginal emission rates, where the unit of matching is tons of carbon emitted. We present analysis and open source notebooks showing how marginal emissions can be calculated on simulated electric bus networks. Importantly, we prove mathematically that distinct emissions rates can be assigned to all aspects of the electric grid - including transmission, storage, generation, and consumption - completely allocating electric grid emissions. We show that carbon matching is an accurate carbon accounting framework that can inspire ambitious and impactful action. This research fills a gap by blending carbon accounting expertise and power systems modeling to consider the effectiveness of alternative methodologies for allocating electric system emissions.

math.OC

Growing Avoiders from the Right: An Operator-Theoretic Approach

(Work in progress) Marcus and Tardos \cite{MarcusTardos2004} proved the Stanley--Wilf conjecture by reducing pattern avoidance to an extremal problem on $0$--$1$ matrices. We give a parallel proof for classical permutation patterns that stays entirely in the ``grow from the right'' world of enumerative combinatorics. A $v$-avoiding permutation is built by right insertion; at each step we keep a pruned family of locations of $(k{-}1)$-partial occurrences of $v$ (the \emph{frontier}), each carrying its forbidden rank interval. The insertion step then induces a nonnegative transfer operator on a doubly weighted $\ell^\infty$ space. A quadratic penalty in the length makes this operator bounded, and a Neumann-series argument on a natural separable predual yields analyticity of the growth series, hence finite exponential growth for $\Av(v)$. The formulation is completely internal -- we never pass to $0$--$1$ matrices -- and it cleanly separates the pattern-dependent combinatorics of the frontier from a purely operator-theoretic core. In particular, we obtain an abstract ``right-insertion/transfer-operator'' theorem: any system whose frontier grows at most linearly and whose transfer operator satisfies a uniform quadratic length bound has an analytic growth series.

math.CO

ReCoGNet: Recurrent Context-Guided Network for 3D MRI Prostate Segmentation

Prostate gland segmentation from T2-weighted MRI is a critical yet challenging task in clinical prostate cancer assessment. While deep learning-based methods have significantly advanced automated segmentation, most conventional approaches-particularly 2D convolutional neural networks (CNNs)-fail to leverage inter-slice anatomical continuity, limiting their accuracy and robustness. Fully 3D models offer improved spatial coherence but require large amounts of annotated data, which is often impractical in clinical settings. To address these limitations, we propose a hybrid architecture that models MRI sequences as spatiotemporal data. Our method uses a deep, pretrained DeepLabV3 backbone to extract high-level semantic features from each MRI slice and a recurrent convolutional head, built with ConvLSTM layers, to integrate information across slices while preserving spatial structure. This combination enables context-aware segmentation with improved consistency, particularly in data-limited and noisy imaging conditions. We evaluate our method on the PROMISE12 benchmark under both clean and contrast-degraded test settings. Compared to state-of-the-art 2D and 3D segmentation models, our approach demonstrates superior performance in terms of precision, recall, Intersection over Union (IoU), and Dice Similarity Coefficient (DSC), highlighting its potential for robust clinical deployment.

eess.IV

Consecutive Pattern Containment and c-Wilf Equivalence

We offer elementary proofs for several results in consecutive pattern containment that were previously demonstrated using ideas from cluster method and analytical combinatorics. Furthermore, we establish new general bounds on the growth rates of consecutive pattern avoidance in permutations.

math.CO

Balancing art and money in pursuit of a Kelly-type optimality

We introduce and study a mathematical model of an art collector. In our model, the collector is a rational agent whose actions in the art market are driven by two competing long-term objectives, namely sustainable financial health and maintaining the collection. Mathematically, our model is a two-dimensional random linear dynamical system with transformation matrix of a peculiar type. In some examples we are able to show that within the Kelly-type optimization paradigm, that is optimizing the system's Lyapunov exponent over a set of policy parameters, the dilemma ``art or money" can be successfully resolved, namely the optimal policy creates a coexistence equilibrium where the value of both is increasing over the time.

math.PR

Assorted inequalities for pattern occurrences

In this note, we present several inequalities in the context of pattern containment, utilizing elementary applications of the Fortuin-Kasteleyn-Ginibre (FKG) inequality and Shearer's lemma.

math.CO

Pattern occurrences in $k$-ary words revisited: a few new and old observations

In this paper, we study the pattern occurrence in $k$-ary words. We prove an explicit upper bound on the number of $k$-ary words avoiding any given pattern using a random walk argument. Additionally, we reproduce several already known results and establish a simple connection among pattern occurrences in permutations and $k$-ary words. A simple consequence of this connection is that Wilf-equivalence of two patterns in words implies their Wilf-equivalence in permutations.

math.CO

On a characterization of exponential and double exponential distributions

Recently, G.~Yanev obtained a characterization of the exponential family of distributions in terms of a functional equation for certain mixture densities. The purpose of this note is twofold: we extend Yanev's theorem by relaxing a restriction on the sign of mixture coefficients and, in addition, obtain a similar characterization for the Laplace family of distributions.

math.PR

Subregularity in infinitely labeled generating trees of restricted permutations

In this paper, we revisit the application of generating trees to the pattern avoidance problem for permutations. In particular, we study this problem for certain general sets of patterns and propose a new procedure leveraging the FinLabel algorithm and exploiting the subregularities in the associated generating trees. We consider some general kinds of generating trees for which the FinLabel algorithm fails to determine in a finite number of iterations the generating function that enumerates the underlying class of permutations. Our procedure provides a unified approach in these cases leading to a system of equations satisfied by a certain finite set of generating functions which can be readily solved with the aid of programming.

math.CO

Fixed points of a random restricted growth sequence

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by calculation of generating functions and leveraging a probabilistic sampling method.

math.CO

On column-convex and convex Carlitz polyominoes

In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as $n$ grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{9\sqrt{2}(14+3\sqrt{3})}{2704\sqrt{πn^3}}4^n. \feq \item convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{n+1}{10}\left(\frac{3+\sqrt{5}}{2}\right)^{n-2}. \feq \end{enumerate}

math.CO

Enumeration of Various Animals on the Triangular Lattice

In this paper, we consider various classes of polyiamonds that are animals residing on the triangular lattice. By careful analyses through certain layer-by-layer decompositions and cell pruning/growing arguments, we derive explicit forms for the generating functions of the number of nonempty translation-invariant baryiamonds (bargraphs in the triangular lattice), column-convex polyiamonds, and convex polyiamonds with respect to their perimeter. In particular, we show that the number of (A) baryiamonds of perimeter $n$ is asymptotically $$\frac{(ξ+1)^2\sqrt{ξ^4+ξ^3-2ξ+1}}{2\sqrt{πn^3}}ξ^{-n-2},$$ where $ξ$ is a root of a certain explicit polynomial of degree 5. (B) column-convex polyiamonds of perimeter $n$ is asymptotic to $$\frac{(17997809\sqrt{17}+3^3\cdot13\cdot175463)\sqrt{95\sqrt{17}-119}}{2^7\cdot43^2\cdot 89^2\sqrt{6πn^3}}\left(\frac{3+\sqrt{17}}{2}\right)^{n-1}.$$ (C) convex polyiamonds of perimeter $n$ is asymptotic to $$\frac{1280}{441\sqrt{3πn^3}}3^n.$$

math.CO

Convex polyominoes revisited: Enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees

The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior vertices, boundary vertices of certain degrees, and outer site perimeter. Using this decomposition, among other things, we show that A) the average number of interior vertices over all convex polyominoes of perimeter $2n$ is asymptotic to $\frac{n^2}{12}+\frac{n\sqrt{n}}{3\sqrtπ} -\frac{(21π-16)n}{12π}.$ B) the average number of boundary vertices with degree two over all convex polyominoes of perimeter $2n$ is asymptotic to $\frac{n+6}{2}+\frac{1}{\sqrt{πn}}+\frac{(16-7π)}{4πn}.$ Additionally, we obtain an explicit generating function counting the number of convex polyominoes with $n$ boundary vertices of degrees at most three and show that this number is asymptotic to $ \frac{n+1}{40}\left(\frac{3+\sqrt{5}}{2}\right)^{n-3} +\frac{\sqrt[4]{5}(2-\sqrt{5})}{80\sqrt{πn}}\left(\frac{3+\sqrt{5}}{2}\right)^{n-2}. $ Moreover, we show that the expected number of the boundary vertices of degree four over all convex polyominoes with $n$ vertices of degrees at most three is asymptotically $ \frac{n}{\sqrt{5}}-\frac{\sqrt[4]{125}(\sqrt{5}-1)\sqrt{n}}{10\sqrtπ}. $ C) the number of convex polyominoes with the outer-site perimeter $n$ is asymptotic to $\frac{3(\sqrt{5}-1)}{20\sqrt{π n}\sqrt[4]{5}}\left(\frac{3+\sqrt{5}}{2}\right)^n,$ and show the expected number of the outer-site perimeter over all convex polyominoes with perimeter $2n$ is asymptotic to $\frac{25n}{16}+\frac{\sqrt{n}}{4\sqrtπ}+\frac{1}{8}.$ Lastly, we prove that the expected perimeter over all convex polyominoes with the outer-site perimeter $n$ is asymptotic to $\sqrt[4]{5}n$.

math.CO

On typical triangulations of a convex $n$-gon

Let $f_n$ be a function assigning weight to each possible triangle whose vertices are chosen from vertices of a convex polygon $P_n$ of $n$ sides. Suppose ${\mathcal T}_n$ is a random triangulation, sampled uniformly out of all possible triangulations of $P_n$. We study the sum of weights of triangles in ${\mathcal T}_n$ and give a general formula for average and variance of this random variable. In addition, we look at several interesting special cases of $f_n$ in which we obtain explicit forms of generating functions for the sum of the weights. For example, among other things, we give new proofs for already known results such as the degree of a fixed vertex and the number of ears in ${\mathcal T}_n,$ as well as, provide new results on the number of "blue" angles and refined information on the distribution of angles at a fixed vertex. We note that our approach is systematic and can be applied to many other new examples while generalizing the existing results.

math.CO

Random walk on the Poincaré disk induced by a group of Möbius transformations

We consider a discrete-time random motion, Markov chain on the Poincaré disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random Möbius transformations. We exploit an isomorphism between the underlying group of Möbius transformations and $\rr$ to study the random motion through its relation to a one-dimensional random walk. More specifically, we show that key geometric characteristics of the random motion, such as Busemann functions and bipolar coordinates evaluated at its location, and hyperbolic distance from the origin, can be either explicitly computed or approximated in terms of the random walk. We also consider a variant of the model where the motion is not confined to a single arc, but rather the particle switches between arcs of a parabolic pencil of circles at random times.

math.PR