Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Friday 6 March

Mathematical Physics

New results for Heisenberg dynamics for non self-adjoint Hamiltonians

In a previous paper we began our analysis on the role of non self-adjoint Hamiltonians in connection with the Heisenberg dynamics for quantum systems. Here, motivated by the growing interest on this topic and on some recent results on dynamical systems, we continue this analysis focusing on what we believe is an unexplored (or, at least, not so explored! aspect of Heisenberg dynamics, related to the need for using vectors which are brute-force normalized. Our main interest is on conserved quantities, and on conditions which guarantee that some observables of the system, or their mean values, do not evolve in time.
Read the full abstract

Analysis of PDEs

On semilinear Grushin–Schrödinger equation in $\mathbb{R}^N$

We establish the existence of nontrivial nonnegative weak solutions to the following equation \begin{equation*} -\Delta_\gamma u + V(z)u = Q(z)f(u), \quad z\in \mathbb{R}^N, \end{equation*} where $\Delta_\gamma $ denotes the so-called Grushin-type operator in $\mathbb{R}^N$. The potentials $V$ and $Q$ are assumed to be controlled below and above, respectively, by functions of type $(1+|z|)^a$, $a\in\mathbb{R}$. The main result is the embedded of the space $E_V^\gamma$ into the weighted Lebesgue space $L_Q^p(\mathbb{R}^N)$, under suitable conditions. Finally, we derive regularity results for the obtained weak solutions.
Read the full abstract

Combinatorics

Matchings in hypergraphs via Ore-degree conditions

Let $\mathcal{H} \subseteq \binom{[n]}{r}$ be an $r$-uniform hypergraph on vertex set $[n] = \{1,2,\dots, n\}$. For an $r$-set of vertices $S \subseteq [n]$, the degree of $S$ is defined as $\textrm{deg}(S)=\sum_{v \in S}\textrm{deg}(v)$ and the minimum of $\textrm{deg}(S)$ over all non-edge $r$-subsets $S \not \in E(\mathcal{H})$ of $V({\cal H})$ is the Ore-degree of ${\cal H}$, denoted by ${\sigma_r}({\cal H})$. We prove several Ore-degree results about existence of matchings in hypergraphs: (1) For $n\geq 2r+2$, if ${\cal H}$ is an intersecting $r$-uniform hypergraph on $n$ vertices, then $\sigma_r({\cal H})\leq r{n-2 \choose r-2}$, and there is equality only when ${\cal H}$ is a $1$-star. (2) For $r\geq 3$ and $n\geq 4r^2$, if is a non-trivial intersecting $r$-uniform hypergraph on $n$ vertices, then $\sigma_r({\cal H})\leq r\left({n-2 \choose r-2}-{n-r-2 \choose r-2}\right)$. (3) For $s\geq 2$ and $n\geq 3r^2(s-1)$, if ${\cal H}$ is an $r$-uniform hypergraph on $n$ vertices and $\sigma_r({\cal H})>r\left({n-1 \choose r-1}-{n-s \choose r-1}\right)$, then ${\cal H}$ contains $s$ pairwise disjoint edges.
Read the full abstract

Analysis of PDEs

Long-time behaviour of a nonlocal stochastic fractional reaction–diffusion equation arising in tumour dynamics

We introduce a stochastic nonlocal reaction–diffusion model arising in tumour dynamics. Spatial dispersal is described by the fractional Laplacian, accounting for anomalous diffusion and long–range relocation events. The system is perturbed by multiplicative fractional Brownian motion (fBm) with Hurst parameter $H>1/2$, which we interpret as temporally correlated fluctuations in the tumour microenvironment and host response. We first establish well–posedness and identify parameter regimes leading to global–in–time solutions or finite–time blow–up under general multiplicative fractional noise. We then focus on linear multiplicative noise and, via a Doss–Sussmann transformation, derive sharper results: explicit lower and upper bounds for the blow–up time together with quantitative estimates of the blow–up probability, clarifying how noise intensity can accelerate progression or, on favourable paths, enhance suppression consistent with extinction (loss of viability). Finally, one–dimensional simulations illustrate the interplay between anomalous diffusion, fractional noise, and the nonlocal reaction mechanism in shaping the long–time dynamics.
Read the full abstract

All authors Nikos I. Kavallaris, Subramani Sankar, Manil T. Mohan, Christos V. Nikolopoulos, Shanmugasundaram Karthikeyan

Analysis of PDEs

Exponential stability of the linearized viscous Saint-Venant equations using a quadratic Lyapunov function

In this work, we investigate the exponential stability of the viscous Saint-Venant equations by adding to the standard hyperbolic Saint-Venant equations a viscosity term coming from the higher order approximation of the Saint-Venant equations from Navier-Stokes equations. The inclusion of viscosity transforms these equations into more complex second-order partial differential equations, accurately modeling the behavior of real-world fluids that inherently possess viscosity. We construct an explicit quadratic Lyapunov function and demonstrate that it must be diagonal in physical coordinates, revealing that certain quadratic Lyapunov functions effective in non-viscous cases become inadequate when viscosity is introduced. We find explicit sufficient conditions on the parameters of the boundary conditions such that for small viscosities a quadratic Lyapunov function exists. This result ensures the exponential stability of the linearized system around the steady-state solutions in the $L^2$ norm.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Spinor moving frame, type II superparticle quantization, hidden $SU(8)$ symmetry of linearized 10D supergravity, and superamplitudes

A covariant quantization of type IIB and type IIA superparticles in their spinor moving frame formulation reveals the hidden $SU(8)$ symmetry of the linearized type II supergravity. It acts on auxiliary variables parameterizing the possible choices of complex structures which is necessary to arrive at the realization of the quantum state vector as an analytic on-shell superfield, the one-particle counterpart of analytical superamplitudes for type IIB and type IIA supergravity multiplets. The description of the type IIA supergraity multiplet in terms of an analytic on-shell superfield is then identical to that for type IIB supermultiplet; the difference is in spacetime interpretation. However, the definition of suitable auxiliary variables in type IIA case requires introduction of covariantly constant $SO(8)$ vector which can be related to T-duality transform between type IIA and type IIB superspaces. The simplest analytic IIB superamplitudes discussed in the literature thus also describe type IIA processes. We elaborate on these using the spinor moving frame (Lorentz harmonic) formalism and point out the restrictions on computation of many particle type IIA amplitudes in this approach. We also briefly discuss the initial steps towards type IIA superamplitudes involving, besides supergravity multiplets, also D$0$-branes (Dirichlet superparticles), which was recently quantized in the similar formalism, and indicate some problems which appear are to be solved to proceed on this way.
Read the full abstract

Probability

Computing Stationary Distribution via Dirichlet-Energy Minimization by Coordinate Descent

We present an optimization-based formulation of the Red Light Green Light (RLGL) algorithm for computing stationary distributions of large Markov chains. This perspective clarifies the algorithm's behavior, establishes exponential convergence for a class of chains, and suggests practical scheduling strategies to accelerate convergence.
Read the full abstract

Analysis of PDEs

Normalized solutions to mass supercritical Schrödinger equations with radial potentials

We study the stationary nonlinear Schrödinger equation \begin{equation}-\Delta u+V(x)u+\lambda u=|u|^{q-2}u,\quad u \in H^1(\mathbb{R}^N), \quad N \geq 2\end{equation} where $V \in L^{\infty}(\mathbb{R}^N)$ is a radial potential. In the $L^2$-supercritical regime, we show the existence of an explicit $\mu_0 >0$ such that, for any $\mu \in (0, \mu_0)$, the equation admits two solutions having $L^2$ norm $\mu$. The potential $V$ is not assumed to have a sign, nor a specific behavior at infinity and only a low regularity is required. Our proof relies on the use of Morse type information, on some spectral arguments, and on a blow-up analysis developed in a radial setting.
Read the full abstract

Numerical Analysis

Kinetic-based regularization: Learning spatial derivatives and PDE applications

Accurate estimation of spatial derivatives from discrete and noisy data is central to scientific machine learning and numerical solutions of PDEs. We extend kinetic-based regularization (KBR), a localized multidimensional kernel regression method with a single trainable parameter, to learn spatial derivatives with provable second-order accuracy in 1D. Two derivative-learning schemes are proposed: an explicit scheme based on the closed-form prediction expressions, and an implicit scheme that solves a perturbed linear system at the points of interest. The fully localized formulation enables efficient, noise-adaptive derivative estimation without requiring global system solving or heuristic smoothing. Both approaches exhibit quadratic convergence, matching second-order finite difference for clean data, along with a possible high-dimensional formulation. Preliminary results show that coupling KBR with conservative solvers enables stable shock capture in 1D hyperbolic PDEs, acting as a step towards solving PDEs on irregular point clouds in higher dimensions while preserving conservation laws.
Read the full abstract

Dynamical Systems

Decay of correlations on Abelian covers of isometric extensions of volume-preserving Anosov flows

We establish an asymptotic expansion in inverse powers of time of the correlation function of isometric extensions of volume-preserving Anosov flows on Abelian covers of closed manifolds.

Numerical Analysis · Cross-listed from cs.LG

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization

We propose ALFCG (Adaptive Lipschitz-Free Conditional Gradient), the first adaptive projection-free framework for stochastic composite nonconvex minimization that requires neither global smoothness constants nor line search. Unlike prior conditional gradient methods that use openloop diminishing stepsizes, conservative Lipschitz constants, or costly backtracking, ALFCG maintains a self-normalized accumulator of historical iterate differences to estimate local smoothness and minimize a quadratic surrogate model at each step. This retains the simplicity of Frank-Wolfe while adapting to unknown geometry. We study three variants. ALFCG-FS addresses finite-sum problems with a SPIDER estimator. ALFCG-MVR1 and ALFCG-MVR2 handle stochastic expectation problems by using momentum-based variance reduction with single-batch and two-batch updates, and operate under average and individual smoothness, respectively. To reach an $\epsilon$-stationary point, ALFCG-FS attains $\mathcal{O}(N+\sqrt{N}\epsilon^{-2})$ iteration complexity, while ALFCG-MVR1 and ALFCG-MVR2 achieve $\tilde{\mathcal{O}}(\sigma^2\epsilon^{-4}+\epsilon^{-2})$ and $\tilde{\mathcal{O}}(\sigma\epsilon^{-3}+\epsilon^{-2})$, where $N$ is the number of components and $\sigma$ is the noise level. In contrast to typical $\mathcal{O}(\epsilon^{-4})$ or $\mathcal{O}(\epsilon^{-3})$ rates, our bounds reduce to the optimal rate up to logarithmic factors $\tilde{\mathcal{O}}(\epsilon^{-2})$ as the noise level $\sigma \to 0$. Extensive experiments on multiclass classification over nuclear norm balls and $\ell_p$ balls show that ALFCG generally outperforms state-of-the-art conditional gradient baselines.
Read the full abstract

Probability

One-sided large deviations for the ground-state energy of spin glasses

We describe the large deviations above its typical value of the maximal energy of a spin glass with +/-1 spins. Thanks to the relatively explicit description of the rate function we identify, we then show that the latter is asymptotically quadratic near its minimum if and only if an external magnetic field is present. The proof starts from a Parisi-type formula for the fractional moments of the partition function, which we then leverage to obtain the limit of the Laplace transform of the maximum energy. Using convex-duality arguments, we then rewrite this Laplace transform as a supremum over martingales, and thereby deduce the large-deviation principle with explicit rate function.
Read the full abstract

All authors Hong-Bin Chen, Alice Guionnet, Justin Ko, Bertrand Lacroix-A-Chez-Toine, Jean-Christophe Mourrat

Combinatorics

The five-sequence of adjoints for combinatorial simplicial complexes

For a set $A$ let ${{\mathbf {SC}}_A}$ be the poset of simplicial complexes whose vertices are in $A$. For a function $f : A \rightarrow B$ there are functors $ f^{! !}, f^{**}, f^{ii}: {{\mathbf {SC}}_A} \rightarrow {{\mathbf {SC}}_B}, \quad f^{!*}, f^{i*} : {{\mathbf {SC}}_B} \rightarrow {{\mathbf {SC}}_A}, $ forming a five sequence of adjoints $f^{ !!} \dashv f^{* !} \dashv f^{* *} \dashv f^{*i} \dashv f^{ii}$. We investigate in detail these functors, and use this to give three categorical structures on simplicial complexes on finite sets such that the Stanley-Reisner correspondence to commutative monomial rings gives dualities.
Read the full abstract

Analysis of PDEs

Dimension of the singular set in the parabolic obstacle problem

In this paper we study the singular set in the parabolic obstacle problem for general obstacles $\varphi \in C^{2,1}$, with $\Delta \varphi < 0$. We prove that the singular set has parabolic Hausdorff dimension at most $n-1$. Prior to our result, this was only known when $\Delta \varphi \equiv -1$. Our approach combines a truncated parabolic frequency formula and monotonicity estimates with an iterative argument showing that the frequency is saturated for all values of the truncation parameter between $2$ and $3$.
Read the full abstract

Analysis of PDEs

On Local Regularity of Distributional Solutions to the Navier–Stokes Equations

We provide a sharp result that guarantees that a distributional solution satisfying the Prodi-Serrin condition is regular in the spatial variables. The solution does not need to belong to the (local) Leray-Hopf class.

Geometric Topology

A table of knotoids in $S^3$ up to seven crossings

We present a complete classification of spherical knotoids with up to six crossings and conjecture that our classification up to seven crossings is complete. Our work extends the tradition of knot tabulation to the setting of knotoids introduced by Turaev. We describe the methods used to enumerate diagrams, simplify them, and distinguish equivalence classes using a collection of invariants including the Kauffman bracket, the Arrow polynomial, the Affine index polynomial, the Mock Alexander polynomial, and the Yamada polynomial of the closure. We also investigate the chirality and rotational symmetries of these knotoids. Applications to protein entanglement illustrate the importance of such classifications.
Read the full abstract

Analysis of PDEs

Subcritical bifurcations of shear flows

It is well-known that shear flows in a strip or in the half plane are unstable for the incompressible Navier-Stokes equations if the viscosity $\nu$ is small enough, provided the horizontal wave number $\alpha$ lies in a small interval, between the so called lower and upper marginal stability curves. Moreover, a Hopf bifurcation occurs at the upper marginal stability curve. In this article, for various shear flows, we give numerical evidences that this bifurcation is subcritical.
Read the full abstract

Geometric Topology

Infinite families of non-fibered twisted torus knots

We present explicit infinite families of twisted torus knots that are not fibered. Our approach relies on an explicit formula for the Alexander polynomial derived in our previous work. We show that the leading coefficients of the Alexander polynomials of twisted torus knots can take arbitrary integer values, which immediately yields infinitely many examples of non-fibered twisted torus knots.
Read the full abstract

Optimization and Control

Intrinsic Information Flow in Structureless NP Search

Rather than measuring NP search in terms of Turing-machine time, we reinterpret witness recovery as an information-acquisition process: the hidden witness is the sole source of uncertainty, and identification requires sufficient reduction of this uncertainty through a rate-limited access interface in the sense of Shannon. To make this perspective explicit, we analyze an extreme regime, the psocid model, in which the witness is accessible only via equality probes $[\pi = w^\star]$ under a uniform, structureless prior. Each probe reveals at most $O(N/2^N)$ bits of mutual information, so polynomially many probes accumulate only $o(1)$ total information. By Fano's inequality, reliable recovery requires $\Omega(N)$ bits, creating a fundamental mismatch between the information required for recovery and that obtainable through the interface. The psocid setting isolates a fully symmetric search regime in which no intermediate computation yields global eliminative leverage, thereby exposing an intrinsic informational origin of exponential search complexity.
Read the full abstract

Information Theory

Quasi-twisted codes and their connection with additive constacyclic codes over finite fields

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to quasi-cyclic codes and determine Euclidean, Hermitian, and symplectic duals of quasi-twisted codes with index $2$. Additionally, we provide necessary and sufficient conditions for the self-orthogonality of appropriate quasi-twisted codes. Next, we explore a one-to-one correspondence between quasi-twisted codes of length $lm$ with index $l$ over $\mathbb{F}_q$ and additive constacyclic codes of length $m$ over $\mathbb{F}_{q^l}$. We establish relationships between trace inner products in the additive setting and Euclidean, symplectic inner products in the quasi-twisted setting. Using these relations and the correspondence, we determine the dual of additive constacyclic codes with respect to the trace inner products. As a consequence, we conclude that determining the trace Euclidean dual and trace Hermitian dual of an additive constacyclic code is equivalent to determining the Euclidean and symplectic dual of the corresponding quasi-twisted code.
Read the full abstract

Information Theory

Belief-Adaptive MAP Detection for Molecular ISI Channels with Heteroscedastic Noise

Inter-symbol interference (ISI) with heteroscedastic (state-dependent) noise is a defining feature of molecular communication via diffusion (MCvD). However, such noise variance dependency across ISI states has not been systematically considered in prior detector designs. This letter introduces two decoding mechanisms, Belief-Adaptive Maximum A Posteriori (BA-MAP) and Soft BA-MAP, that explicitly incorporate state-dependent count means and variances of the molecular channel. The BA-MAP method derives per-symbol adaptive MAP thresholds based on the receiver's current state beliefs, whereas Soft BA-MAP computes mixture log-likelihood ratios by weighting all possible ISI states. Simulation and analyses confirm that the proposed detectors outperform conventional equalization and fixed-threshold methods, and approach ideal zero-decision-delay MAP detection with perfect ISI-state knowledge.
Read the full abstract

Optimization and Control

Solving the Line-Based Dial-a-Ride Problem by Generating Stopping Patterns

In the line-based dial-a-ride problem (liDARP), vehicles operate along a predefined bus line, with the possibility of skipping stations and turning when empty. Motivated by the practical observation that tight passenger time windows often limit pooling in on-demand services, we introduce a new variant of this transportation system by removing all temporal constraints, which we call the liDARP without TWs. We introduce a new MILP formulation for the liDARP without TWs, which constructs feasible tours as sequences of stopping patterns; first, we consider a fundamental single-vehicle, single-pass special case. Based on our insights, we develop a branch-and-price algorithm where the pricing problem generates profitable stopping patterns. For practical applications, we additionally propose a root node heuristic, using the stopping patterns generated at the root node. Computational experiments show that our branch-and-price algorithm is competitive, finding solutions with a MIP gap of less than 5% for large instances in 60 minutes. Further, the root node heuristic scales to instances with up to 100 requests, outperforming the state-of-the-art and reaching optimality gaps of less than 5% within 15 minutes. This method is highly effective in generating solutions for practical applications, where solving large problems quickly is more valuable than reaching optimality.
Read the full abstract

All authors Antonio Lauerbach, Sven Mallach, Kendra Reiter, Marie Schmidt, Michael Stiglmayr

Analysis of PDEs · Cross-listed from cs.CE

Learning Where the Physics Is: Probabilistic Adaptive Sampling for Stiff PDEs

Modeling stiff partial differential equations (PDEs) with sharp gradients remains a significant challenge for scientific machine learning. While Physics-Informed Neural Networks (PINNs) struggle with spectral bias and slow training times, Physics-Informed Extreme Learning Machines (PIELMs) offer a rapid, closed-form linear solution but are fundamentally limited by physics-agnostic, random initialization. We introduce the Gaussian Mixture Model Adaptive PIELM (GMM-PIELM), a probabilistic framework that learns a probability density function representing the “location of physics” for adaptively sampling kernels of PIELMs. By employing a weighted Expectation-Maximization (EM) algorithm, GMM-PIELM autonomously concentrates radial basis function centers in regions of high numerical error, such as shock fronts and boundary layers. This approach dynamically improves the conditioning of the hidden layer without the expensive gradient-based optimization(of PINNs) or Bayesian search. We evaluate our methodology on 1D singularly perturbed convection-diffusion equations with diffusion coefficients $\nu=10^{-4}$. Our method achieves $L_2$ errors up to $7$ orders of magnitude lower than baseline RBF-PIELMs, successfully resolving exponentially thin boundary layers while retaining the orders-of-magnitude speed advantage of the ELM architecture.
Read the full abstract

Logic

Homogeneity of the Lévy collapse from the perspective of Fraïssé theory

Given a strongly inaccessible cardinal $\lambda$, we study the Fraïssé class of all Boolean algebras of size $<\lambda$, together with regular embeddings. We prove that this is indeed a Fraïsséclass, and its limit has the same completion as the Lévy collapse. We also give a direct proof that the collapsing algebra of density $\kappa$ is not the union of a $\kappa$-chain of regular sub-algebras of density $<\kappa$.
Read the full abstract

Dynamical Systems

On the Combinatorial Rigidity for Polynomials with Attracting Cycles

We show that every polynomial of degree $d \geq 2$ in the connectedness locus with an attracting cycle which attracts at least two critical points and no indifferent cycles is not combinatorially rigid. In particular, we prove that a hyperbolic polynomial with connected Julia set is combinatorially rigid if and only if it is of the “disjoint type”.
Read the full abstract

Combinatorics

On a question about pattern avoidance of cyclic permutations

Recently, Archer et al.\ studied cyclic permutations that avoid the decreasing pattern $\delta_k=k(k-1)\cdots21$ in one-line notation and avoid another pattern $\tau$ of length $4$ in all their cycle forms. There are three cases in total to consider, namely, $\tau=1324, 1342$ and $1432$. They determined two of them, leaving the case $\tau=1432$ as an open question. In this paper, we resolve this case by deriving explicit formulas based on an analysis of the structure of cycle forms and an application of Dilworth's theorem.
Read the full abstract

Mathematical Physics

Gaussian free field convergence of the six-vertex model with $-1\leq\Delta\leq-\frac12$

We study the isotropic six-vertex model on $\mathbb{Z}^2$ with spectral parameter $\Delta\in[-1,-1/2]$, that is, with weights $\mathbf{a}=\mathbf{b}=1$ and $\mathbf{c}\in[\sqrt{3},2]$. We show that the associated height function converges, in the scaling limit, to a properly scaled full-plane Gaussian free field. The result extends to anisotropic weights $\mathbf{a}\neq\mathbf{b}$ upon using a suitable embedding of the lattice.
Read the full abstract

All authors Hugo Duminil-Copin, Karol Kajetan Kozlowski, Piet Lammers, Ioan Manolescu

Numerical Analysis

A hybrid reduced-order and high-fidelity discontinuous Galerkin Spectral Element framework for large-scale PMUT array simulations

Piezoelectric Micromachined Ultrasonic Transducers (PMUTs) are essential for next-generation ultrasonic sensing and imaging due to their bidirectional electromechanical behavior, compact design, and compatibility with low-voltage electronics. As PMUT arrays grow in size and complexity, efficiently modeling their coupled electromechanical-acoustic behavior becomes increasingly challenging. This work presents a novel computational framework that combines model order reduction with a Discontinuous Galerkin Spectral Element Method (DGSEM) paradigm to simulate large PMUT arrays. Each PMUT's mechanical behavior is represented using a reduced set of vibration modes, which are coupled to an acoustic domain model to describe the full array. To further improve efficiency, a secondary acoustic domain is connected via DG interfaces, enabling non-conforming mesh refinement, with variable approximation order, and accurate wave propagation. The framework is implemented in the SPectral Elements in Elastodynamics with Discontinuous Galerkin (SPEED) software, an open-source, parallelized platform leveraging domain decomposition, high-order polynomials, METIS graph partitioning, and MPI for scalable performance. The proposed methodology addresses key challenges in meshing, supporting high-fidelity simulations for both PMUT transmission and reception phases. Numerical results demonstrate the framework's accuracy, scalability, and efficiency for large PMUT array simulations.
Read the full abstract

All authors Paola F. Antonietti, Omer M.O. Abdalla, Michelangelo G. Garroni, Ilario Mazzieri, Nicola Parolini

Complex Variables

Real Laminations of Cubic Polynomials on Boundaries of Hyperbolic Components

Milnor divides all bounded hyperbolic components of cubic polynomials into 4 types (A), (B), (C) and (D). In this article, we characterize the real laminations of cubic polynomials on the tame boundary of all bounded hyperbolic components of type (A), (B), or (C). For such maps, we prove that the real lamination is the smallest lamination which contains the real lamination of maps in the hyperbolic component and an equivalence relation generated by one characteristic equivalence class. As an application, we show that every hyperbolic cubic polynomial except type (D) is not combinatorially rigid.
Read the full abstract

Probability

Large deviations for subgraphs in inhomogeneous random graphs

Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the heavy-tailed nature observed in many contexts. While various graph functionals have been studied in this setting, inhomogeneity makes their analysis significantly more challenging. The goal of this paper is to investigate the large deviations of subgraph counts in inhomogeneous random graphs. Rare events concerning these functionals translate into quantifying the probability that extremely large hubs appear in the graph. This can be achieved by defining a specific optimization problem that captures the most likely way to generate numerous additional subgraphs. When the expected number of subgraphs is sublinear in the graph size, polynomially large deviations are possible, and in this case, we can derive sharp results on clique counts.
Read the full abstract