Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 27 February
Aldous' spectral gap conjecture, proven by Caputo, Liggett and Richthammer, states the following: for any set of transpositions in the symmetric group $\mathrm{Sym}(n)$, the spectral gap of the corresponding random walk on the group – an $n!$-state process – coincides with that of the corresponding random walk of a single element – an $n$-state process. This paper presents an analog of this conjecture in the unitary group $\mathrm{U}(n)$, and proves it in several non-trivial cases. The phenomenon we discover is that for some natural families of probability distributions on $\mathrm{U}(n)$, the spectral gap of the corresponding random walk, which has a continuous state space, is identical to that of a discrete KMP process (also known as the uniform reshuffling process) with two indistinguishable particles on a hypergraph on $n$ vertices – a discrete Markov chain with $\binom{n+1}{2}$ states.
Probability
Return probability on Bienaymé-Galton-Watson trees and spectral asymptotics of sparse Erdős-Rényi random graphs
We derive an upper bound for the annealed return probability of the simple random walk on supercritical Bienaymé-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all offspring distributions with a finite first moment and is optimal whenever the offspring distribution does not exclude leaves or linear pieces in the tree. This solves completely the cases left open by Piau [Ann. Probab. 26, 1016-1040 (1998)]. A new feature of our proof is a far-reaching flexibility in the location of regions with bad isoperimetric properties in the tree. It allows to efficiently treat general offspring distributions and is gained from the joint consideration of the random tree and the random walk as it is inherent under the annealed measure. In the special case of a Poissonian offspring distribution we apply the upper bound for the annealed return probability to deduce a Lifshits tail for the empirical eigenvalue distribution of the graph Laplacian on supercritical Erdős–Rényi random graphs with finite mean degree.
Read the full abstract
Analysis of PDEs
Laplace problem with an exponential nonlinear boundary condition
In this paper, we establish a new result for the Laplace problem with exponential Robin boundary conditions posed on the unit disk in $\R^2$. More precisely, we prove the existence and uniqueness of a solution under suitable smallness assumptions on the boundary data. Our approach relies on an iterative method combined with periodic Sobolev embedding results.
Read the full abstract
Combinatorics
Lower Bounds for the Pfaffian Number of Graphs
The number of perfect matchings of a $k$-pfaffian graph can be counted by computing a linear combination of the pfaffians of $k$ matrices. The pfaffian number of a graph $G$ is the smallest integer $k$ such that $G$ is $k$-pfaffian. We present the first known lower bounds for the pfaffian number of graphs. As an intermediate step, we prove an upper bound for the rank of two matrices related to their Khatri-Rao product, a result of independent relevance. One of the consequences of these results is the existence of graphs whose pfaffian numbers are arbitrarily large.
Read the full abstract
Optimization and Control
Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
This paper investigates numerical solution methods for the Schatten-$p$ quasi-norm regularized problem with $p \in [0,1]$, which has been widely studied for finding low-rank solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. We propose a dynamic proximal gradient algorithm that, through the use of the Cayley transformation, avoids computationally expensive singular value decompositions at each iteration, thereby significantly reducing the computational complexity. The algorithm incorporates two step size selection strategies: an adaptive backtracking search and an explicit step size rule. We establish the sublinear convergence of the proposed algorithm for all $p \in [0,1]$ within the framework of the Kurdyka-Lojasiewicz property. Notably, under mild assumptions, we show that the generated sequence converges to a stationary point of the objective function of the problem. For the special case when $p=1$, the linear convergence is further proved under the strict complementarity-type regularity condition commonly used in the linear convergence analysis of the forward-backward splitting algorithms. Preliminary numerical results validate the superior computational efficiency of the proposed algorithm.
Read the full abstract
Optimization and Control
Stabilization of the Marine Riser model by controllers depending on finitely many parameters
We prove global stabilization of the marine riser models using a feedback controller that depend on finitely many finite-volume elements and finitely many nodal observables. Our approach is based on a feedback control design for dissipative nonlinear partial differential equations, inspired by the methodology introduced in [Evol. Equ. Control Theory, Vol. 3 (2014), 579-594]. The proposed control strategy ensures asymptotic stabilization while maintaining computational feasibility, making it suitable for practical applications.
Read the full abstract
Optimization and Control
Asymptotic Bounds for the Traveling Salesman Problem with Drone
The asymptotic behavior of the optimal TSP tour length is well known from the classical Beardwood–Halton–Hammersley theorem. We extend this result to the Traveling Salesman Problem with Drone (TSPD), a cooperative routing problem in which a truck and a drone jointly serve customers. Using a nonmonotone subadditive Euclidean functional framework, we establish the existence of an almost sure limit for the optimal TSPD makespan scaled by the square root of the problem size. We derive explicit upper and lower bounds for the speed-scaled Euclidean TSPD model: upper bounds are obtained via structured ring-based tour constructions and Monte Carlo evaluation, while lower bounds are derived using nearest-neighbor distance distributions and the $k$-traveling salesman problem. Computational results illustrate how tight the bounds are. We also extend the analysis to the Rectilinear–Euclidean mixed TSPD model, in which truck travel is measured by the rectilinear distance and drone travel by the Euclidean distance.
Read the full abstract
Complex Variables
Analytic and quasiregular distortion of Nagata dimension
We study how analytic functions, and more generally quasiregular mappings, distort Nagata dimension. Quasiconformal mappings of domains preserve the Nagata dimension of compact subsets, in view of a result of Lang and Schlichenmaier. We establish the same conclusion for analytic functions defined on general planar domains. On the other hand, polynomials (and more generally, rational maps) preserve the Nagata dimension of arbitrary subsets of their domain. In the absence of the compactness assumption, we provide examples to show that an entire function can increase or decrease the Nagata dimension of subsets of the domain. Some of these results generalize to meromorphic functions, and separately to planar quasiregular maps in view of Stoilow factorization. We also show that conformal mappings can change the porosity behavior of noncompact subsets of their domain; this yields examples of planar conformal maps which take sets of Nagata dimension strictly less than two onto set of Nagata dimension two. We conclude with open questions and potential future work related to the distortion of Nagata dimension by higher-dimensional quasiregular maps.
Read the full abstract
Logic
Scales in the Point Spectrum
We study the Point/Tukey spectrum of a general directed set using PCF theoretic tools and uncover basic connections between the theories. In particular, we prove that if the supremum of the Tukey spectrum is singular, then its cofinality must also be a member of the Tukey spectrum.
Read the full abstract
Combinatorics
Burning rooted graph products
The burning number $b(G)$ of a graph $G$ is the minimum number of rounds required to burn all vertices when, at each discrete step, existing fires spread to neighboring vertices and one new fire may be ignited at an unburned vertex. This parameter measures the speed of influence propagation in a network and has been studied as a model for information diffusion and resource allocation in distributed systems. A central open problem, the Burning Number Conjecture (BNC), asserts that every graph on $n$ vertices can be burned in at most $\lceil \sqrt n\rceil$ rounds, a bound known to be sharp for paths and verified for several structured families of trees. We investigate rooted graph products, focusing on comb graphs obtained by attaching a path (a “tooth”) to each vertex of a path (the “spine”). Unlike classical symmetric graph products, rooted products introduce hierarchical bottlenecks: communication between local subnetworks must pass through designated root vertices, providing a natural model for hub-and-spoke or chain-of-command architectures. We prove that the BNC holds for all comb graphs and determine the precise asymptotic order of their burning number in every parameter regime, including exact formulas in the spine-dominant case that generalize the known formula for paths. Our approach is constructive, based on an explicit greedy algorithm that is optimal or near-optimal depending on the regime.
Read the full abstract
Number Theory
Unconditional Density Bounds for Quadratic Norm-Form Energies via Lorentzian Spectral Weights
For a real quadratic field $\mathbb{Q}(\sqrt{d})$, we study the norm-form energy $N = S_\zeta^2 - d \cdot S_L^2$, where $S_\zeta$ and $S_L$ are Lorentzian-weighted zero sums with $w(\rho) = 2/(\tfrac{1}{4} + \gamma^2)$. We prove three main results. (1) Spacelike spectral data: $N < 0$ unconditionally for all squarefree $d > 1$, as a consequence of a low-lying zero dominance theorem proved via explicit zero-counting. (2) Effective density bound: at each verified truncation level $M$, $\mathrm{dens}\{N > 0\} \leq 2\|f_{S_L^{(M)}}\|_\infty \cdot (W_1(\zeta)/\sqrt{d} + \epsilon_M)$, established unconditionally via Jacobi–Anger resonance analysis. At fixed $M$ the bound is nontrivial only for sufficiently large $d$; the $O(1/\sqrt{d})$ rate requires $M$ to grow with $d$, which in turn requires a uniform density bound that we establish under a computationally verified finite-rank condition on the resonance lattice. (3) Exact asymptotic: under the computationally verified hypothesis that the infinite resonance lattice $\Lambda_\infty$ has finite rank (verified to have rank $0$ for $M \leq 20$), the sharp asymptotic $\mathrm{dens}\{N > 0\} = C(d)/\sqrt{d} + o(1/\sqrt{d})$ holds. For $d = 5$, $C(5) = 2\,f_{S_L}(0)\cdot\mathbb{E}[|S_\zeta|] = 0.1193$; the constant depends on $d$ through the zeros of $L(s,\chi_d)$, and $C(d) = O(1/\log d)$ as $d \to \infty$. Appendix F tabulates between 1004 and 1044 zeros at 70 decimal places for $L(s,\chi_2)$, $L(s,\chi_3)$, $L(s,\chi_5)$, $L(s,\chi_6)$, $L(s,\chi_7)$, $L(s,\chi_{10})$, $L(s,\chi_{11})$, and $L(s,\chi_{13})$, all rigorously certified by ARB interval arithmetic.
Read the full abstract
Classical Analysis and ODEs
Analysis of the long-term behavior of the "Bando–follow-the-leader” car-following model
In this article, we investigate the long-term behavior of the “Bando–follow-the-leader” car-following model, whose well-posedness and stability with respect to delay were analyzed in a recent work \cite{gong2023well}. We first establish the collision-free property of the model with \(N+1\in\N_{\geq2}\) vehicles over an infinite time horizon, assuming that the trajectory of the first vehicle is prescribed, by demonstrating the existence of a uniform strictly positive lower bound on the space headway between adjacent vehicles. Furthermore, assuming that the first vehicle travels at a constant velocity and \(N\in\N_{\geq1}\) vehicles follow it according to the Bando–follow-the-leader model on a single lane, our main results state that, with certain reasonable constraints imposed on the modeling parameters, all \(N\) following vehicles will eventually (i.e., when time goes to infinity) converge to the same headway and velocity with a globally exponential convergence rate. The analytical methods are based on Lyapunov functions and a perturbation argument. Numerical simulations are also provided to illustrate the obtained theoretical convergence guarantees.
Read the full abstract
Spectral Theory
Remling's Theorem for vector-valued discrete Schrodinger operators
Combinatorics
Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs
In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.
Read the full abstract
Combinatorics
Surface topology and incidence theorems over division rings
Incidence theorems concern configurations of points, lines, and, more generally, higher-dimensional subspaces in projective space. Broadly speaking, such theorems fall into two classes: those that hold over an arbitrary division ring, such as Desargues' theorem, and those that hold only over fields, such as Pappus' theorem. In this paper, we explain the topological origin of this distinction. To this end, we extend to the noncommutative setting the surface-graph approach to incidence theorems developed by Richter-Gebert, Fomin, and Pylyavskyy. We then show that theorems associated with graphs embedded on the sphere, such as Desargues' theorem, hold over any division ring, whereas theorems corresponding to graphs embedded on surfaces of positive genus, such as Pappus' theorem, typically hold if and only if the ground ring is a field. We also extend these results to the setting of arbitrary rings, not necessarily admitting division.
Read the full abstract
Optimization and Control
Linear Threshold for Oertel's Conjecture on the Mixed-Integer Volume
Grünbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets $S=C\cap(\mathbb Z^n\times\mathbb{R}^d)$ where $C$ is a convex body, Oertel conjectured that there exists $y\in S$ such that every closed halfspace $H$ containing $y$ satisfies $H_d(S\cap H)\ge \frac{1}{2^ne} H_d(S)$, where $H_d(X)$ denotes the $d$-dimensional Hausdorff measure of $X$. This conjecture is closely connected to complexity bounds for cutting plane methods and information complexity in mixed-integer convex optimization. Basu and Oertel established this conjecture for sets of sufficiently large lattice width, with the required lower bound on lattice width depending exponentially on the dimension. More recently, Cristi and Salas reduced this threshold to a polynomial one by assuming that $\mathrm{proj}_{\mathbb{R}^n}(C)$ contains a Euclidean ball of radius at least $1178 d^2n^{3/2}$. We prove that when the projection contains an $\ell_\infty$ ball of radius $k\ge(3e/2)(n+d)$, which is linear in the dimensions $n$ and $d$, there exists $y^*\in S$ such that every closed halfspace $H$ containing $y^*$ satisfies $H_d(S\cap H)\ge\left(\frac{1}{e}-\frac{3(n+d)}{2k}\right)H_d(S)$. In particular, when $k\ge 3e(n+d)$ we obtain $H_d(S\cap H)\ge \frac{1}{2e}H_d(S)\ge \frac{1}{2^ne}H_d(S)$, thus verifying Oertel's conjecture for a significantly larger family of sets than previous results. We also show that this linear scaling is necessary: when the radius is sublinear in the total dimension, the maximum achievable halfspace depth can be arbitrarily small relative to the total mixed-integer volume, so no dimension-independent constant fraction lower bound is possible under such an assumption alone. However, the conjecture remains open in its full generality.
Read the full abstract
Optimization and Control
Finite convergence of the Moment-SOS hierarchy under hidden convexity
We consider polynomial optimization problems with compact feasible set ${\bf\Omega}\subset\mathbb{R}^d$ defined by SOS-concave polynomials $g_j$ of arbitrary degree, and whose objective function $f$ is not necessarily convex on $\mathbb{R}^d$. We show that, if $f$ is Hessian-$Q$-module convex over ${\bf\Omega}$ in the sense that its Hessian admits a specific quadratic-module representation, then the standard Moment-SOS hierarchy converges in finitely many steps without prior knowledge of this hidden (local) convexity. Strong convexity of $f$ on ${\bf\Omega}$ is a sufficient condition for the required Hessian representation. In addition, we give an explicit relaxation order at which exactness occurs. This demonstrates that a general-purpose hierarchy can adapt to favorable hidden properties of a specific instance without being informed of them, yielding certified global minimizers.
Read the full abstract
Number Theory
Zolotarev's Magical Proof of Quadratic Reciprocity
We present a creative reimagining of Zolotarev's classical proof of the Law of Quadratic Reciprocity.
Operator Algebras
On the convex structure of the space of quantum channels which act as Fourier multipliers
If $G$ is a compact group, continuous normalized positive definite functions are in one-to-one correspondence with unital quantum channels acting as Fourier multipliers on the group von Neumann algebra $\mathrm{VN}(G)$. We study the convex geometry of the convex set $\mathrm{P}_1(G)$ of normalized positive definite functions, equipped with the topology induced by the norm topology of the Fourier algebra $\mathrm{A}(G)$, and its relation with the structure of $\mathrm{VN}(G)$. We show that the von Neumann algebras of two compact groups $G$ and $H$ are $*$-isomorphic if and only if the convex sets $\mathrm{P}_1(G)$ and $\mathrm{P}_1(H)$ are affinely homeomorphic. We also describe the group of affine homeomorphisms of $\mathrm{P}_1(G)$ in terms of Jordan $*$-automorphisms of $\mathrm{VN}(G)$.
Read the full abstract
Dynamical Systems
Existence of stable periodic orbits in billiards close to lemon and moon billiards
It is known that at lemon and moon billiards that have a sufficiently small curvature on one of their circular arcs are hyperbolic. In this paper we show that replacing this circular arc by a more general boundary component of small curvature could produce billiard tables that admit nonlinearly stable periodic orbits.
Read the full abstract
Numerical Analysis
An unconditionally stable hybridizable-embedded discontinuous Galerkin method for the phase field crystal equation
This paper presents a first-order convex splitting hybridizable/embedded discontinuous Galerkin method for the phase field crystal equation written in mixed form. Since the sixth-order phase field crystal equation is rewritten as a first-order system, our scheme avoids the calculation of high-order derivatives, which can be computationally expensive. The proposed method uses continuous facet unknowns and static condensation, which significantly reduces the number of coupled degrees of freedom. Using stabilization parameters that satisfy a simple and explicit relation, we show that our scheme is unconditionally energy stable. Moreover, we show the existence and uniqueness of the discrete solution for the case of variable mobility. The scheme's performance and properties are demonstrated through several numerical examples, including benchmark results that align with the existing literature, as well as a comparison of degrees of freedom against other methods.
Read the full abstract
Analysis of PDEs
Vanishing permeability limit of convection in multilayer porous media
We analyze the asymptotic behavior of the Boussinesq-Darcy system describing convection in layered porous media in the limit where the permeability of one layer tends to zero. We show that the limiting dynamics are governed by the Boussinesq-Darcy model with an impermeable layer, both in terms of convergence of solutions in L2 on finite time intervals and convergence of the corresponding global attractors. This limit is singular, as the pressure equation becomes degenerate when the permeability vanishes in part of the domain, resulting in a loss of uniqueness of the pressure in the impermeable layer. This difficulty is resolved by combining uniform estimates in the permeable layers with refined control of the pressure equation in the vanishing-permeability layer. The results provide a rigorous description of the zero-permeability limit in layered porous-media convection models.
Read the full abstract
Statistics Theory
The relative efficiency of sequential tests
While many statistical procedures rely on a fixed sample size, sequential methods allow a decision-maker to adapt the sample size to achieve a given precision. In this way, sequential tests reduce the average number of observations required to achieve a given power of the test – but by how much? To address this question, we focus on the scenario of testing the unknown drift of a Brownian motion, comparing the Wald sequential probability ratio test with tests that use a pre-determined fixed sample size. We provide precise bounds on the average reduction in sample size needed to achieve a desired precision. Specifically, we demonstrate that for symmetric error bounds, the sequential test reduces the average sample size by at least 36% and by at most 75%. Moreover, the reduction in sample size increases monotonically with the power of the test, meaning that the relative advantage of using a sequential test over a fixed sample size test grows as higher power is required. We also study the relative efficiency in the case with asymmetric error bounds, and we provide a lower bound in terms of the symmetric case.
Read the full abstract
Combinatorics
On the Guy-Kelly Conjecture for the No-Three-In-Line Problem
We provide details of the error Gabor Ellmann found in 2004 in a heuristic argument of Guy and Kelly on this problem. This led to a correction of their conjectured upper bound for the no-three-in-line problem. However, details of the issue and its correction, including the actual location of the issue, while simple, do not seem to have appeared in the literature previously. That said, very recent work of Prellberg [5] does contain a derivation of the corrected conjectured upper bound.
Read the full abstract
General Mathematics
Moment-based Piecewise Polynomial Probability Density Estimation with Quantile-Based Binning
Accurate reconstruction of probability density functions (PDFs) from data is essential in engineering applications. Classical global moment-based polynomial approximations often suffer from oscillations, instability in the tails, and sensitivity to the choice of support. This work proposes a quantile-based piecewise polynomial density reconstruction approach that combines equal-probability binning with local moment-matched polynomials within each bin. Two variants are considered: piecewise monomial and piecewise Lagrange polynomials with Chebyshev nodes. The numbers of bins and polynomial degrees are selected by a proposed grid search approach guided by the Kolmogorov-Smirnov (K-S) test statistic under non-negativity constraints. Across several benchmark distributions, the proposed methods reduce K-S errors by about $80$-$96\%$ relative to standard monomial and Lagrange polynomial approaches, and by about $83$-$97\%$ compared with spline density estimation. For real-world household electricity consumption and solar irradiance data, the piecewise approaches achieve K-S test statistic performance comparable to kernel density estimation while offering improved control over tail behavior and oscillations. Overall, the results demonstrate that quantile-based localization substantially enhances the robustness and fidelity of moment-based polynomial PDF reconstruction.
Read the full abstract
Probability · Cross-listed from stat.ML
The Partition Principle Revisited: Non-Equal Volume Designs Achieve Minimal Expected Star Discrepancy
We study the expected star discrepancy under a newly designed class of non-equal volume partitions. The main contributions are twofold. First, we establish a strong partition principle for the star discrepancy, showing that our newly designed non-equal volume partitions yield stratified sampling point sets with lower expected star discrepancy than classical jittered sampling. Specifically, we prove that $\mathbb{E}(D^{*}_{N}(Z)) < \mathbb{E}(D^{*}_{N}(Y))$, where $Y$ and $Z$ represent jittered sampling and our non-equal volume partition sampling, respectively. Second, we derive explicit upper bounds for the expected star discrepancy under our non-equal volume partition models, which improve upon existing bounds for jittered sampling. Our results provide a theoretical foundation for using non-equal volume partitions in high-dimensional numerical integration.
Read the full abstract
Numerical Analysis · Cross-listed from physics.flu-dyn
Multi-Condition Digital Twin Calibration for Axial Piston Pumps : Compound Fault Simulation
Axial piston pumps are indispensable power sources in high-stakes fluid power systems, including aerospace, marine, and heavy machinery applications. Their operational reliability is frequently compromised by compound faults that simultaneously affect multiple friction pairs. Conventional data-driven diagnosis methods suffer from severe data scarcity for compound faults and poor generalization across varying operating conditions. This paper proposes a novel multi-condition physics-data coupled digital twin calibration framework that explicitly resolves the fundamental uncertainty of pump outlet flow ripple. The framework comprises three synergistic stages: in-situ virtual high-frequency flow sensing on a dedicated rigid metallic segment, surrogate model-assisted calibration of the 3D CFD source model using physically estimated ripple amplitudes, and multi-objective inverse transient analysis for viscoelastic unsteady-friction pipeline parameter identification. Comprehensive experiments on a test rig demonstrate that the calibrated digital twin accurately reproduces both single-fault and two representative compound-fault. These results establish a high-fidelity synthetic fault-generation capability that directly enables robust zero-shot fault diagnosis under previously unseen operating regimes and fault combinations, thereby advancing predictive maintenance in complex hydraulic systems.
Read the full abstract
Combinatorics
Untranscendable order types
We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception of the two-point type, every untranscendable type is additively indecomposable, and every $\sigma$-scattered untranscendable type is strongly indecomposable. Under the Proper Forcing Axiom, every untranscendable Aronszajn type is strongly indecomposable. We also show that a theorem of Hagendorf and Jullien, that every strictly additively indecomposable type must be strictly indecomposable to either the left or right, has a natural analogue for $s$-untranscendable types.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Asymptotically Solvable Quantum Circuits
The discovery of chaotic quantum circuits with (partially) solvable dynamics has played a key role in our understanding of non-equilibrium quantum matter and, at the same time, has helped the development of concrete platforms for quantum computation. It was shown that solvability does not prevent the generation of chaotic dynamics, however, it imposes non-trivial constraints on the generated correlations. A natural question is then whether it is possible to gain insight into the generic case despite the latter being very hard to access. To address this question here we introduce a family of 'asymptotically solvable' quantum circuits where the solvability constraints only affect correlations on length scales beyond a tuneable threshold. This means that their dynamics are only solvable for long enough times: for times shorter than the threshold they are generic. We show this by computing both their dynamical correlations on the equilibrium (infinite temperature) state and their thermalisation dynamics following quantum quenches from compatible (asymptotically solvable) non-equilibrium initial states. The class of systems we introduce is generically ergodic but contains a non-interacting point, which we use to provide exact analytical results, complementing those of numerical experiments, on the non-solvable early time regime.
Read the full abstract
Combinatorics
On the singularity and the inverse of 3-colored digraphs
This article considers the class of connected 3-colored digraphs. Let $G$ be a 3-colored digraph and $A(G)$ be its adjacency matrix. $G$ is said to be non-singular (resp. singular) if $A(G)$ is a non-singular (resp. singular) matrix. A connected digraph is k-cyclic if it has $n$ vertices and $n+k-1$ edges. The main objective of this article is to provide a characterization of non-singular 3-colored unicyclic and bicyclic digraphs. If $A(G)$ is non-singular and $A(G)^{-1}$ has a $zero$ diagonal, then $A(G)^{-1}$ can be realized as the adjacency matrix of a digraph with complex weights. Therefore, we also identify all 3-colored bicyclic digraphs such that the diagonal of $A(G)^{-1}$ is zero. Furthermore, we study the invertibility of these digraphs and identify all those bicyclic 3-colored digraphs whose inverse is also a 3-colored digraph. We conduct the same study for the class of unicyclic 3-colored digraphs.