text
stringlengths 137
2.43k
| field
stringclasses 2
values | label
int64 0
1
|
|---|---|---|
Title: Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints
Abstract: We study the problem of allocating indivisible items to agents with additive valuations, under the additional constraint that bundles must be connected in an underlying item graph. Previous work has considered the existence and complexity of fair allocations. We study the problem of finding an allocation that is Pareto-optimal. While it is easy to find an efficient allocation when the underlying graph is a path or a star, the problem is NP-hard for many other graph topologies, even for trees of bounded pathwidth or of maximum degree 3. We show that on a path, there are instances where no Pareto-optimal allocation satisfies envy-freeness up to one good, and that it is NP-hard to decide whether such an allocation exists, even for binary valuations. We also show that, for a path, it is NP-hard to find a Pareto-optimal allocation that satisfies maximin share, but show that a moving-knife algorithm can find such an allocation when agents have binary valuations that have a non-nested interval structure. | cs | 1 |
Title: Taming the Beast: Fully Automated Unit Testing with Coyote C++
Abstract: In this paper, we present Coyote C++, a fully automated white-box unit testing tool for C and C++. Whereas existing tools have struggled to realize unit test generation for C++, Coyote C++ is able to produce high coverage results from unit test generation at a testing speed of over 10,000 statements per hour. This impressive feat is made possible by the combination of a powerful concolic execution engine with sophisticated automated test harness generation. Additionally, the GUI of Coyote C++ displays detailed code coverage visualizations and provides various configuration features for users seeking to manually optimize their coverage results. Combining potent one-click automated testing with rich support for manual tweaking, Coyote C++ is the first automated testing tool that is practical enough to make automated testing of C++ code truly viable in industrial applications. | cs | 0 |
Title: Two remarks on graph norms
Abstract: For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t(H,W)$. One may then define corresponding functionals $\|W\|_{H}:=|t(H,W)|^{1/e(H)}$ and $\|W\|_{r(H)}:=t(H,|W|)^{1/e(H)}$ and say that $H$ is (semi-)norming if $\|.\|_{H}$ is a (semi-)norm and that $H$ is weakly norming if $\|.\|_{r(H)}$ is a norm. We obtain two results that contribute to the theory of (weakly) norming graphs. Firstly, answering a question of Hatami, who estimated the modulus of convexity and smoothness of $\|.\|_{H}$, we prove that $\|.\|_{r(H)}$ is not uniformly convex nor uniformly smooth, provided that $H$ is weakly norming. Secondly, we prove that every graph $H$ without isolated vertices is (weakly) norming if and only if each component is an isomorphic copy of a (weakly) norming graph. This strong factorisation result allows us to assume connectivity of $H$ when studying graph norms. In particular, we correct an error in the original statement of the aforementioned theorem by Hatami. | math | 1 |
Title: Low regularity estimates of the Lie-Totter time-splitting Fourier spectral method for the logarithmic Schrödinger equation
Abstract: In this paper, we conduct rigorous error analysis of the Lie-Totter time-splitting Fourier spectral scheme for the nonlinear Schr\"odinger equation with a logarithmic nonlinear term $f(u)=u\ln|u|^2$ (LogSE) and periodic boundary conditions on a $d$-dimensional torus $\mathbb T^d$. Different from existing works based on regularisation of the nonlinear term $ f(u)\approx f^\varepsilon(u)=u\ln (|u| + \varepsilon )^2,$ we directly discretize the LogSE with the understanding $f(0)=0.$ Remarkably, in the time-splitting scheme, the solution flow map of the nonlinear part: $g(u)= u {\rm e}^{-{\rm} i t \ln|u|^{2}}$ has a higher regularity than $f(u)$ (which is not differentiable at $u=0$ but H\"older continuous), where $g(u)$ is Lipschitz continuous and possesses a certain fractional Sobolev regularity with index $0<s<1$. Accordingly, we can derive the $L^2$-error estimate: $O\big((\tau^{s/2} + N^{-s})\ln\! N\big)$ of the proposed scheme for the LogSE with low regularity solution $u\in C((0,T]; H^s( \mathbb{T}^d)\cap L^\infty( \mathbb{T}^d)).$ Moreover, we can show that the estimate holds for $s=1$ with more delicate analysis of the nonlinear term and the associated solution flow maps. Furthermore, we provide ample numerical results to demonstrate such a fractional-order convergence for initial data with low regularity. This work is the first one devoted to the analysis of splitting scheme for the LogSE without regularisation in the low regularity setting, as far as we can tell. | math | 0 |
Title: On the standing waves of the NLS-log equation with point interaction on a star graph
Abstract: We study a nonlinear Schr\"odinger equation with logarithmic nonlinearity on a star graph $\mathcal{G}$. At the vertex an interaction occurs described by a boundary condition of delta type with strength $\alpha\in \mathbb{R}$. We investigate orbital stability and spectral instability of the standing wave solutions $e^{i\omega t}\mathbf{\Phi}(x)$ to the equation when the profile $\mathbf\Phi(x)$ has mixed structure (i.e. has bumps and tails). In our approach we essentially use the extension theory of symmetric operators by Krein - von Neumann, and the analytic perturbations theory. | math | 1 |
Title: Deep Automated Mechanism Design for Integrating Ad Auction and Allocation in Feed
Abstract: E-commerce platforms usually present an ordered list, mixed with several organic items and an advertisement, in response to each user's page view request. This list, the outcome of ad auction and allocation processes, directly impacts the platform's ad revenue and gross merchandise volume (GMV). Specifically, the ad auction determines which ad is displayed and the corresponding payment, while the ad allocation decides the display positions of the advertisement and organic items. The prevalent methods of segregating the ad auction and allocation into two distinct stages face two problems: 1) Ad auction does not consider externalities, such as the influence of actual display position and context on ad Click-Through Rate (CTR); 2) The ad allocation, which utilizes the auction-winning ad's payment to determine the display position dynamically, fails to maintain incentive compatibility (IC) for the advertisement. For instance, in the auction stage employing the traditional Generalized Second Price (GSP) , even if the winning ad increases its bid, its payment remains unchanged. This implies that the advertisement cannot secure a better position and thus loses the opportunity to achieve higher utility in the subsequent ad allocation stage. Previous research often focused on one of the two stages, neglecting the two-stage problem, which may result in suboptimal outcomes... | cs | 0 |
Title: An eigenvalue problem for self-similar patterns in Hele-Shaw flows
Abstract: Hele-Shaw problems are prototypes to study the interface dynamics. Linear theory suggests the existence of self-similar patterns in a Hele-Shaw flow. That is, with a specific injection flux the interface shape remains unchanged while its size increases. In this paper, we explore the existence of self-similar patterns in the nonlinear regime and develop a rigorous nonlinear theory characterizing their fundamental features. Using a boundary integral formulation, we pose the question of self-similarity as a generalized nonlinear eigenvalue problem, involving two nonlinear integral operators. The flux constant $C$ is the eigenvalue and the corresponding self-similar pattern $\mathbf{x}$ is the eigenvector. We develop a quasi-Newton method to solve the problem and show the existence of nonlinear shapes with $k$-fold dominated symmetries. The influence of initial guesses on the self-similar patterns is investigated. We are able to obtain a desired self-similar shape once the initial guess is properly chosen. Our results go beyond the predictions of linear theory and establish a bridge between the linear theory and simulations. | math | 0 |
Title: Compact Group Actions on Topological and Noncommutative Joins
Abstract: We consider the Type 1 and Type 2 noncommutative Borsuk-Ulam conjectures of Baum, D$\k{a}$browski, and Hajac: there are no equivariant morphisms $A \to A \circledast_\delta H$ or $H \to A \circledast_\delta H$, respectively, when $H$ is a nontrivial compact quantum group acting freely on a unital $C^*$-algebra $A$. Here $A \circledast_\delta H$ denotes the equivariant noncommutative join of $A$ and $H$; this join procedure is a modification of the topological join that allows a free action of $H$ on $A$ to produce a free action of $H$ on $A \circledast_\delta H$. For the classical case $H = \mathcal{C}(G)$, $G$ a compact group, we present a reduction of the Type 1 conjecture and counterexamples to the Type 2 conjecture. We also present some examples and conditions under which the Type 2 conjecture does hold. | math | 1 |
Title: Reliability of k-out-of-n Data Storage System with Deterministic Parallel and Serial Repair
Abstract: In this paper, we find the Laplace Stieltjes transform of the probability of data loss for the k-out-of-n distributed storage system with deterministic repair times. We consider two repair models, namely the serial and parallel repair. We show that for failure rate much lower than the repair rate, mean time of data loss for the two models is the same unlike the case for exponential repair models. | cs | 1 |
Title: On Virasoro Constraints for Orbifold Gromov-Witten Theory
Abstract: Virasoro constraints for orbifold Gromov-Witten theory are described. These constraints are applied to the degree zreo, genus zero orbifold Gromov-Witten potentials of the weighted projective stacks $\mathbb{P}(1,N)$, $\mathbb{P}(1,1,N)$ and $\mathbb{P}(1,1,1,N)$ to obtain formulas of descendant cyclic Hurwitz-Hodge integrals. | math | 1 |
Title: Parametric change point detection with random occurrence of the change point
Abstract: We are concerned with the problem of detecting a single change point in the model parameters of time series data generated from an exponential family. In contrast to the existing literature, we allow that the true location of the change point is itself random, possibly depending on the data. Under the alternative, we study the case when the size of the change point converges to zero while the sample size goes to infinity. Moreover, we concentrate on change points in the "middle of the data", i.e., we assume that the change point fraction (the location of the change point relative to the sample size) converges weakly to a random variable $\lambda^*$ which takes its values almost surely in a closed subset of $(0,1).$ We show that the known statistical results from the literature also transfer to this setting. We substantiate our theoretical results with a simulation study. | math | 1 |
Title: Shadow Blade: A tool to interact with attack vectors
Abstract: The increased demand of cyber security professionals has also increased the development of new platforms and tools that help those professionals to improve their offensive skills. One of these platforms is HackTheBox, an online cyber security training platform that delivers a controlled and safe environment for those professionals to explore virtual machines in a Capture the Flag (CTF) competition style. Most of the tools used in a CTF, or even on real-world Penetration Testing (Pentest), were developed for specific reasons so each tool usually has different input and output formats. These different formats make it hard for cyber security professionals and CTF competitors to develop an attack graph. In order to help cyber security professionals and CTF competitors to discover, select and exploit an attack vector, this paper presents Shadow Blade, a tool to aid users to interact with their attack vectors. | cs | 0 |
Title: Two open problems in the fixed point theory of contractive type mappings on first-countable quasimetric spaces
Abstract: Two open problems in the fixed point theory of quasi metric spaces posed in [Berinde, V. and Choban, M. M., {\it Generalized distances and their associate metrics. Impact on fixed point theory}, Creat. Math. Inform. {\bf 22} (2013), no. 1, 23--32] are considered. We give a complete answer to the first problem, a partial answer to the second one, and also illustrate the complexity and relevance of these problems by means of four very interesting and comprehensive examples. | math | 1 |
Title: Exploring Boundary of GPT-4V on Marine Analysis: A Preliminary Case Study
Abstract: Large language models (LLMs) have demonstrated a powerful ability to answer various queries as a general-purpose assistant. The continuous multi-modal large language models (MLLM) empower LLMs with the ability to perceive visual signals. The launch of GPT-4 (Generative Pre-trained Transformers) has generated significant interest in the research communities. GPT-4V(ison) has demonstrated significant power in both academia and industry fields, as a focal point in a new artificial intelligence generation. Though significant success was achieved by GPT-4V, exploring MLLMs in domain-specific analysis (e.g., marine analysis) that required domain-specific knowledge and expertise has gained less attention. In this study, we carry out the preliminary and comprehensive case study of utilizing GPT-4V for marine analysis. This report conducts a systematic evaluation of existing GPT-4V, assessing the performance of GPT-4V on marine research and also setting a new standard for future developments in MLLMs. The experimental results of GPT-4V show that the responses generated by GPT-4V are still far away from satisfying the domain-specific requirements of the marine professions. All images and prompts used in this study will be available at https://github.com/hkust-vgd/Marine_GPT-4V_Eval | cs | 0 |
Title: Energy based diffusion generator for efficient sampling of Boltzmann distributions
Abstract: We introduce a novel sampler called the energy based diffusion generator for generating samples from arbitrary target distributions. The sampling model employs a structure similar to a variational autoencoder, utilizing a decoder to transform latent variables from a simple distribution into random variables approximating the target distribution, and we design an encoder based on the diffusion model. Leveraging the powerful modeling capacity of the diffusion model for complex distributions, we can obtain an accurate variational estimate of the Kullback-Leibler divergence between the distributions of the generated samples and the target. Moreover, we propose a decoder based on generalized Hamiltonian dynamics to further enhance sampling performance. Through empirical evaluation, we demonstrate the effectiveness of our method across various complex distribution functions, showcasing its superiority compared to existing methods. | cs | 0 |
Title: Local Discontinuous Galerkin Methods for Solving Convection-Diffusion and Cahn-Hilliard Equations on Surfaces
Abstract: Local discontinuous Galerkin methods are developed for solving second order and fourth order time-dependent partial differential equations defined on static 2D manifolds. These schemes are second-order accurate with surfaces triangulized by planar triangles and careful design of numerical fluxes. The schemes are proven to be energy stable. Various numerical experiments are provided to validate the new schemes. | math | 0 |
Title: Homotopy Algebras are Homotopy Algebras
Abstract: We prove that strongly homotopy algebras (such as $A_\infty$, $C_\infty$, sh Lie, $B_\infty$, $G_\infty$,...) are homotopically invariant in the category of chain complexes. An important consequence is a rigorous proof that `strongly homotopy structures transfer over chain homotopy equivalences.' | math | 1 |
Title: A Steinberg type decomposition theorem for higher level Demazure modules
Abstract: We study Demazure modules which occur in a level $\ell$ irreducible integrable representation of an affine Lie algebra. We also assume that they are stable under the action of the standard maximal parabolic subalgebra of the affine Lie algebra. We prove that such a module is isomorphic to the fusion product of "prime" \ Demazure modules, where the prime factors are indexed by dominant integral weights which are either a multiple of $\ell$ or take value less than $\ell$ on all simple coroots. Our proof depends on a technical result which we prove in all the classical cases and $G_2$. Calculations with mathematica show that this result is correct for small values of the level. Using our result, we show that there exist generalizations of $Q$--systems to pairs of weights where one of the weights is not necessarily rectangular and is of a different level. Our results also allow us to compare the multiplicities of an irreducible representation occuring in the tensor product of certian pairs of irreducible representations, i.e., we establish a version of Schur positvity for such pairs of irreducible modules for a simple Lie algebra. | math | 1 |
Title: Path-based Explanation for Knowledge Graph Completion
Abstract: Graph Neural Networks (GNNs) have achieved great success in Knowledge Graph Completion (KGC) by modelling how entities and relations interact in recent years. However, the explanation of the predicted facts has not caught the necessary attention. Proper explanations for the results of GNN-based KGC models increase model transparency and help researchers develop more reliable models. Existing practices for explaining KGC tasks rely on instance/subgraph-based approaches, while in some scenarios, paths can provide more user-friendly and interpretable explanations. Nonetheless, the methods for generating path-based explanations for KGs have not been well-explored. To address this gap, we propose Power-Link, the first path-based KGC explainer that explores GNN-based models. We design a novel simplified graph-powering technique, which enables the generation of path-based explanations with a fully parallelisable and memory-efficient training scheme. We further introduce three new metrics for quantitative evaluation of the explanations, together with a qualitative human evaluation. Extensive experiments demonstrate that Power-Link outperforms the SOTA baselines in interpretability, efficiency, and scalability. | cs | 0 |
Title: On the behavior of adjoint ideals under pure morphisms
Abstract: We characterize adjoint ideal sheaves via ultraproducts and, utilizing this characterization, study their behavior under pure morphisms. In particular, given a pure morphism $f:Y \to X$ between normal quasi-projective complex varieties, a reduced divisor $D$ and an effective $\mathbb{Q}$-Weil divisor $\Gamma$ on $X$ without common components, we have the following result: if the cycle-theoretic pullback $E:=f^{\natural}D$ is reduced and $(Y, E+f^*\Gamma)$ is of plt type along $E$, then $(X, D+\Gamma)$ is of plt type along $D$. This provides an affirmative answer to a question posed by Z. Zhuang. | math | 0 |
Title: Radar-Camera Pixel Depth Association for Depth Completion
Abstract: While radar and video data can be readily fused at the detection level, fusing them at the pixel level is potentially more beneficial. This is also more challenging in part due to the sparsity of radar, but also because automotive radar beams are much wider than a typical pixel combined with a large baseline between camera and radar, which results in poor association between radar pixels and color pixel. A consequence is that depth completion methods designed for LiDAR and video fare poorly for radar and video. Here we propose a radar-to-pixel association stage which learns a mapping from radar returns to pixels. This mapping also serves to densify radar returns. Using this as a first stage, followed by a more traditional depth completion method, we are able to achieve image-guided depth completion with radar and video. We demonstrate performance superior to camera and radar alone on the nuScenes dataset. Our source code is available at https://github.com/longyunf/rc-pda. | cs | 1 |
Title: Rectilinear Shortest Paths Among Transient Obstacles
Abstract: This paper presents an optimal $\Theta(n \log n)$ algorithm for determining time-minimal rectilinear paths among $n$ transient rectilinear obstacles. An obstacle is transient if it exists in the scene only for a specific time interval, i.e., it appears and then disappears at specific times. Given a point robot moving with bounded speed among transient rectilinear obstacles and a pair of points $s$, $d$, we determine a time-minimal, obstacle-avoiding path from $s$ to $d$. The main challenge in solving this problem arises as the robot may be required to wait for an obstacle to disappear, before it can continue moving toward the destination. Our algorithm builds on the continuous Dijkstra paradigm, which simulates propagating a wavefront from the source point. We also solve a query version of this problem. For this, we build a planar subdivision with respect to a fixed source point, so that minimum arrival time to any query point can be reported in $O(\log n)$ time, using point location for the query point in this subdivision. | cs | 1 |
Title: LSTMs Exploit Linguistic Attributes of Data
Abstract: While recurrent neural networks have found success in a variety of natural language processing applications, they are general models of sequential data. We investigate how the properties of natural language data affect an LSTM's ability to learn a nonlinguistic task: recalling elements from its input. We find that models trained on natural language data are able to recall tokens from much longer sequences than models trained on non-language sequential data. Furthermore, we show that the LSTM learns to solve the memorization task by explicitly using a subset of its neurons to count timesteps in the input. We hypothesize that the patterns and structure in natural language data enable LSTMs to learn by providing approximate ways of reducing loss, but understanding the effect of different training data on the learnability of LSTMs remains an open question. | cs | 1 |
Title: Signed Latent Factors for Spamming Activity Detection
Abstract: Due to the increasing trend of performing spamming activities (e.g., Web spam, deceptive reviews, fake followers, etc.) on various online platforms to gain undeserved benefits, spam detection has emerged as a hot research issue. Previous attempts to combat spam mainly employ features related to metadata, user behaviors, or relational ties. These works have made considerable progress in understanding and filtering spamming campaigns. However, this problem remains far from fully solved. Almost all the proposed features focus on a limited number of observed attributes or explainable phenomena, making it difficult for existing methods to achieve further improvement. To broaden the vision about solving the spam problem and address long-standing challenges (class imbalance and graph incompleteness) in the spam detection area, we propose a new attempt of utilizing signed latent factors to filter fraudulent activities. The spam-contaminated relational datasets of multiple online applications in this scenario are interpreted by the unified signed network. Two competitive and highly dissimilar algorithms of latent factors mining (LFM) models are designed based on multi-relational likelihoods estimation (LFM-MRLE) and signed pairwise ranking (LFM-SPR), respectively. We then explore how to apply the mined latent factors to spam detection tasks. Experiments on real-world datasets of different kinds of Web applications (social media and Web forum) indicate that LFM models outperform state-of-the-art baselines in detecting spamming activities. By specifically manipulating experimental data, the effectiveness of our methods in dealing with incomplete and imbalanced challenges is valida | cs | 1 |
Title: Coalition Formation Games for Collaborative Spectrum Sensing
Abstract: Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the detection of the primary user (PU) and maintaining a reasonable false alarm probability (e.g., for maintaining a good spectrum utilization). In this paper, we study the impact of this tradeoff on the network structure and the cooperative incentives of the SUs that seek to cooperate for improving their detection performance. We model the CSS problem as a non-transferable coalitional game, and we propose distributed algorithms for coalition formation. First, we construct a distributed coalition formation (CF) algorithm that allows the SUs to self-organize into disjoint coalitions while accounting for the CSS tradeoff. Then, the CF algorithm is complemented with a coalitional voting game for enabling distributed coalition formation with detection probability guarantees (CF-PD) when required by the PU. The CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e., coalitions that achieve the target detection probability with minimal costs. For both algorithms, we study and prove various properties pertaining to network structure, adaptation to mobility and stability. Simulation results show that CF reduces the average probability of miss per SU up to 88.45% relative to the non-cooperative case, while maintaining a desired false alarm. For CF-PD, the results show that up to 87.25% of the SUs achieve the required detection probability through MWC | cs | 1 |
Title: A profile decomposition for the limiting Sobolev embedding
Abstract: For many known non-compact embeddings of two Banach spaces $E\hookrightarrow F$, every bounded sequence in $E$ has a subsequence that takes form of a profile decomposition - a sum of clearly structured terms with asymptotically disjoint supports plus a remainder that vanishes in the norm of $F$. In this note we construct a profile decomposition for arbitrary sequences in the Sobolev space $H^{1,2}(M)$ of a compact Riemannian manifold, relative to the embedding of $H^{1,2}(M)$ into $L^{2^*}(M)$, generalizing the well-known profile decomposition of Struwe ([Proposition 2.1]{Struwe}) to the case of arbitrary bounded sequences. | math | 1 |
Title: VGA: Vision and Graph Fused Attention Network for Rumor Detection
Abstract: With the development of social media, rumors have been spread broadly on social media platforms, causing great harm to society. Beside textual information, many rumors also use manipulated images or conceal textual information within images to deceive people and avoid being detected, making multimodal rumor detection be a critical problem. The majority of multimodal rumor detection methods mainly concentrate on extracting features of source claims and their corresponding images, while ignoring the comments of rumors and their propagation structures. These comments and structures imply the wisdom of crowds and are proved to be crucial to debunk rumors. Moreover, these methods usually only extract visual features in a basic manner, seldom consider tampering or textual information in images. Therefore, in this study, we propose a novel Vision and Graph Fused Attention Network (VGA) for rumor detection to utilize propagation structures among posts so as to obtain the crowd opinions and further explore visual tampering features, as well as the textual information hidden in images. We conduct extensive experiments on three datasets, demonstrating that VGA can effectively detect multimodal rumors and outperform state-of-the-art methods significantly. | cs | 0 |
Title: Dense triangle-free $(n, d, λ)$-graphs for all orders
Abstract: In 1994, Alon construct a triangle-free $(n,d,\lambda)$-graph with $d = \Omega(n^{2/3})$ and $\lambda = O(d^{1/2})$ for an exponentially increasing sequence of integers $n$. Using his ingenious construction, we deduce that there exist triangle-free $(n,d,\lambda)$-graphs with $d = \Omega(n^{2/3})$ and $\lambda = O( (d \log n)^{1/2} )$ for all sufficiently large $n$. | math | 0 |
Title: A Remark on Nonlinear Dirac Equations
Abstract: For a $n$-dimensional spin manifold $M$ with a fixed spin structure and a spinor bundle $\Sigma M$, we prove an $\epsilon$-regularity theorem for weak solutions to the nonlinear Dirac equation of cubic nonlinearity. This, in particular, answers a regularity question raised by Chen-Jost-Wang when $n=2$. | math | 1 |
Title: Ballistic random walks in random environment as rough paths: convergence and area anomaly
Abstract: Annealed functional CLT in the rough path topology is proved for the standard class of ballistic random walks in random environment. Moreover, the `area anomaly', i.e. a deterministic linear correction for the second level iterated integral of the rescaled path, is identified in terms of a stochastic area on a regeneration interval. The main theorem is formulated in more general settings, namely for any discrete process with uniformly bounded increments which admits a regeneration structure where the regeneration times have finite moments. Here the largest finite moment translates into the degree of regularity of the rough path topology. In particular, the convergence holds in the $\alpha$-H\"older rough path topology for all $\alpha<1/2$ whenever all moments are finite, which is the case for the class of ballistic random walks in random environment. The latter may be compared to a special class of random walks in Dirichlet environments for which the regularity $\alpha<1/2$ is bounded away from $1/2$, explicitly in terms of the corresponding trap parameter. | math | 1 |
Title: The weak categorical quiver minor theorem and its applications: matchings, multipaths, and magnitude cohomology
Abstract: Building upon previous works of Proudfoot and Ramos, and using the categorical framework of Sam and Snowden, we extend the weak categorical minor theorem from undirected graphs to quivers. As case of study, we investigate the consequences on the homology of multipath complexes; eg. on its torsion. Further, we prove a comparison result: we show that, when restricted to directed graphs without oriented cycles, multipath complexes and matching complexes yield functors which commute up to a blow-up operation on directed graphs. We use this fact to compute the homotopy type of matching complexes for a certain class of bipartite graphs also known as half-graphs or ladders. We complement the work with a study of the (representation) category of cones, and with analysing related consequences on magnitude cohomology of quivers. | math | 0 |
Title: From a Kac algebra subfactor to Drinfeld double
Abstract: Given a finite-index and finite-depth subfactor, we define the notion of \textit{quantum double inclusion} - a certain unital inclusion of von Neumann algebras constructed from the given subfactor - which is closely related to that of Ocneanu's asymptotic inclusion. We show that the quantum double inclusion when applied to the Kac algebra subfactor $R^H \subset R$ produces Drinfeld double of $H$ where $H$ is a finite-dimensional Kac algebra acting outerly on the hyperfinite $II_1$ factor $R$ and $R^H$ denotes the fixed-point subalgebra. More precisely, quantum double inclusion of $R^H \subset R$ is isomorphic to $R \subset R \rtimes D(H)^{cop}$ for some outer action of $D(H)^{cop}$ on $R$ where $D(H)$ denotes the Drinfeld double of $H$. | math | 1 |
Title: Convex Clustering via Optimal Mass Transport
Abstract: We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we consider is that of approximating sample distributions by ones with sparse support. This provides a new viewpoint to clustering. We propose different relaxations of a cardinality function which penalizes the size of the support set. We establish that a certain relaxation provides the tightest convex lower approximation to the cardinality penalty. We compare the performance of alternative relaxations on a numerical study on clustering. | cs | 1 |
Title: First order sensitivity analysis of symplectic eigenvalues
Abstract: For every $2n \times 2n$ positive definite matrix $A$ there are $n$ positive numbers $d_1(A) \leq \ldots \leq d_n(A)$ associated with $A$ called the symplectic eigenvalues of $A.$ It is known that $d_m$ are continuous functions of $A$ but are not differentiable in general. In this paper, we show that the directional derivative of $d_m$ exists and derive its expression. We also discuss various subdifferential properties of $d_m$ such as Clarke and Michel-Penot subdifferentials. | math | 1 |
Title: The Molecular Characterizations of Variable Triebel-Lizorkin Spaces Associated with the Hermite Operator and Its Applications
Abstract: In this article, we introduce inhomogeneous variable Triebel-Lizorkin spaces, $F_{p(\cdot),q(\cdot)}^{\alpha(\cdot),H}(\mathbb R^n)$, associated with the Hermite operator $H:=-\Delta+|x|^2$, where $\Delta$ is the Laplace operator on $\mathbb R^n$, and mainly establish the molecular characterization of this space. As applications, we obtain some regularity results to fractional Hermite equations $$(-\Delta+|x|^2)^\sigma u=f,\quad (-\Delta+|x|^2+I)^\sigma u=f,$$ and the boundedness of spectral multiplier associated to the operator $H$ on the variable Triebel-Lizorkin space $F_{p(\cdot),q(\cdot)}^{\alpha(\cdot),H}(\mathbb R^n)$. Furthermore, we explain the relationship between $F_{p(\cdot),q(\cdot)}^{\alpha(\cdot),H}(\mathbb R^n)$ and the variable Triebel-Lizorkin spaces $F_{p(\cdot),q(\cdot)}^{\alpha(\cdot)}(\mathbb R^n)$ (introduced in Diening t al. J. Funct. Anal. 256(2009), 1731-1768.) via the atomic decomposition. | math | 0 |
Title: Rough metrics on manifolds and quadratic estimates
Abstract: We study the persistence of quadratic estimates related to the Kato square root problem across a change of metric on smooth manifolds by defining a class of Riemannian-like metrics that are permitted to be of low regularity and degenerate on sets of measure zero. We also demonstrate how to transmit quadratic estimates between manifolds which are homeomorphic and locally bi-Lipschitz. As a consequence, we demonstrate the invariance of the Kato square root problem under Lipschitz transformations of the space and obtain solutions to this problem on functions and forms on compact manifolds with a continuous metric. Furthermore, we show that a lower bound on the injectivity radius is not a necessary condition to solve the Kato square root problem. | math | 1 |
Title: Nonconvex bundle method with application to a delamination problem
Abstract: Delamination is a typical failure mode of composite materials caused by weak bonding. It arises when a crack initiates and propagates under a destructive loading. Given the physical law characterizing the properties of the interlayer adhesive between the bonded bodies, we consider the problem of computing the propagation of the crack front and the stress field along the contact boundary. This leads to a hemivariational inequality, which after discretization by finite elements we solve by a nonconvex bundle method, where upper-$C^1$ criteria have to be minimized. As this is in contrast with other classes of mechanical problems with non-monotone friction laws and in other applied fields, where criteria are typically lower-$C^1$, we propose a bundle method suited for both types of nonsmoothness. We prove its global convergence in the sense of subsequences and test it on a typical delamination problem of material sciences. | math | 1 |
Title: Comptage des quiddit{é}s sur les corps finis et sur quelques anneaux $\mathbb{Z}/N\mathbb{Z}$
Abstract: The $\lambda$-quiddities of size $n$ are $n$-tuples of elements of a fixed set, solutions of a matrix equation appearing in the study of Coxeter friezes. These can be considered on various sets with very different structures from one set to another. The main objective of this text is to obtain explicit formulas giving the number of $\lambda$-quiddities of size $n$ over finite fields and over the rings $\mathbb{Z}/N\mathbb{Z}$ with $N=4m$ and $m$ square free. We will also give some elements about the asymptotic behavior of the number of $\lambda$-quiddities verifying an irreducibility condition over $\mathbb{Z}/N\mathbb{Z}$ when $N$ goes to the infinity. | math | 0 |
Title: Euclidean algorithms are Gaussian over imaginary quadratic fields
Abstract: The distributional analysis of Euclidean algorithms was carried out by Baladi and Vall\'{e}e. They showed the asymptotic normality of the number of division steps and associated costs in the Euclidean algorithm as a random variable on the set of rational numbers with bounded denominator based on the transfer operator methods. We extend their result to the Euclidean algorithm over appropriate imaginary quadratic fields by studying dynamics of the nearest integer complex continued fraction map, which is piecewise analytic and expanding but not a full branch map. By observing a finite Markov partition with a regular CW-structure, which enables us to associate the transfer operator acting on a direct sum of spaces of $C^1$-functions, we obtain the limit Gaussian distribution as well as residual equidistribution. | math | 0 |
Title: On grids in point-line arrangements in the plane
Abstract: The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for point-line incidence. Let $\mathcal{L}_1$ and $\mathcal{L}_2$ be two sets of $t$ lines in the plane and let $P=\{\ell_1 \cap \ell_2 : \ell_1 \in \mathcal{L}_1, \ell_2 \in \mathcal{L}_2\}$ be the set of intersection points between $\mathcal{L}_1$ and $\mathcal{L}_2$. We say that $(P, \mathcal{L}_1 \cup \mathcal{L}_2)$ forms a \emph{natural $t\times t$ grid} if $|P| =t^2$, and $conv(P)$ does not contain the intersection point of some two lines in $\mathcal{L}_i,$ for $i = 1,2.$ For fixed $t > 1$, we show that any arrangement of $n$ points and $n$ lines in the plane that does not contain a natural $t\times t$ grid determines $O(n^{\frac{4}{3}- \varepsilon})$ incidences, where $\varepsilon = \varepsilon(t)$. We also provide a construction of $n$ points and $n$ lines in the plane that does not contain a natural $2 \times 2$ grid and determines at least $\Omega({n^{1+\frac{1}{14}}})$ incidences. | math | 1 |
Title: The line bundles on the moduli stack of principal bundles on families of curves
Abstract: Given a connected reductive algebraic group G, we investigate the Picard group of the moduli stack of principal G-bundles over an arbitrary family of smooth curves. | math | 0 |
Title: Optimal Economic Operation of Liquid Petroleum Products Pipeline Systems
Abstract: The majority of overland transport needs for crude petroleum and refined petroleum products are met using pipelines. Numerous studies have developed optimization methods for design of these systems in order to minimize construction costs while meeting capacity requirements. Here, we formulate problems to optimize the operations of existing single liquid commodity pipeline systems subject to physical flow and pump engineering constraints. The objectives are to maximize the economic value created for users of the system and to minimize operating costs. We present a general computational method for this class of continuous, non-convex nonlinear programs, and examine the use of pump operating settings and flow allocations as decision variables. The approach is applied to compute optimal operating regimes and perform engineering economic sensitivity analyses for a case study of a crude oil pipeline developed using publicly available data. | math | 1 |
Title: Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm
Abstract: This work presents an optimization method for the synthesis of finite state machines. The focus is on the reduction in the on-chip area and the cost of the circuit. A list of finite state machines from MCNC91 benchmark circuits have been evolved using Cartesian Genetic Programming. On the average, almost 30% of reduction in the total number of gates has been achieved. The effects of some parameters on the evolutionary process have also been discussed in the paper. | cs | 0 |
Title: How many digits are needed?
Abstract: Let $X_1,X_2,...$ be the digits in the base-$q$ expansion of a random variable $X$ defined on $[0,1)$ where $q\ge2$ is an integer. For $n=1,2,...$, we study the probability distribution $P_n$ of the (scaled) remainder $T^n(X)=\sum_{k=n+1}^\infty X_k q^{n-k}$: If $X$ has an absolutely continuous CDF then $P_n$ converges in the total variation metric to the Lebesgue measure $\mu$ on the unit interval. Under weak smoothness conditions we establish first a coupling between $X$ and a non-negative integer valued random variable $N$ so that $T^N(X)$ follows $\mu$ and is independent of $(X_1,...,X_N)$, and second exponentially fast convergence of $P_n$ and its PDF $f_n$. We discuss how many digits are needed and show examples of our results. The convergence results are extended to the case of a multivariate random variable defined on a unit cube. | math | 0 |
Title: On the relations between Auerbach or almost Auberbach Markushevich systems and Schauder bases
Abstract: We establish that the summability of the series $\sum\varepsilon_n$ is the necessary and sufficient criterion ensuring that every $(1+\varepsilon_n)$ Markushevich basis in a separable Hilbert space is a Riesz basis. Further we show that if $n\varepsilon_n\to \infty$, then in $\ell_2$ there exists a $(1+\varepsilon_n)$ Markushevich basis that under any permutation is non-equivalent to a Schauder basis. We extend this result to any separable Banach space. Finally we provide examples of Auerbach bases in 1-symmetric separable Banach spaces whose no permutations are equivalent to any Schauder basis or (depending on the space) any unconditional Schauder basis. | math | 0 |
Title: Edge statistics for random band matrices
Abstract: Consider Hermitian and symmetric random band matrices $H=(\sigma_{xy}A_{xy})$ on the $d$-dimensional lattice $\left(\mathbb{Z}/{L\mathbb{Z}}\right)^d$, where $A_{xy}=\overline{A_{yx}}$ are independent uniformly distributed random variables on $S^1$ or $\{+1, -1\}$, and the variance profile $\sigma^{2}_{xy}$ is characterized by the bandwidth $W$ and $\alpha$-stable density with $\alpha\in (0,2]$. We investigate local eigenvalue statistics at the spectral edge as $W\to \infty$ and observe the critical dimension $d_c=3\alpha$ and the critical bandwidth $W_c=L^{(1-\frac{d}{3\alpha})_{+}}$, possibly with a $\log L$ correction when $d=\alpha$ or $2\alpha$. In the Hermitian case, we establish that (i) when $d<2\alpha$, GUE edge, interpolating, and Poisson statistics emerge in the supercritical ($W\gg W_c$), critical ($W\sim W_c$), and subcritical ($W\ll W_c$) regimes, respectively; (ii) when $d\ge 2\alpha$, as long as $W\ge L^{\frac{1}{3}+\epsilon}$ for a small constant $\epsilon>0$, GUE edge universality holds. In the symmetric case, we also establish similar but subtle phenomena. In both $d=1$ and $\alpha=2$, the subcritical and supercritical results have been proven by Sodin for the band model with a cutoff variance profile \cite{sodin2010spectral}. Our proof builds upon Sodin's program and new techniques of taming the singularity of Feynman diagrams and graph integrals through a connection to the $\phi^3$ model. | math | 0 |
Title: HawkRover: An Autonomous mmWave Vehicular Communication Testbed with Multi-sensor Fusion and Deep Learning
Abstract: Connected and automated vehicles (CAVs) have become a transformative technology that can change our daily life. Currently, millimeter-wave (mmWave) bands are identified as the promising CAV connectivity solution. While it can provide high data rate, their realization faces many challenges such as high attenuation during mmWave signal propagation and mobility management. Existing solution has to initiate pilot signal to measure channel information, then apply signal processing to calculate the best narrow beam towards the receiver end to guarantee sufficient signal power. This process takes significant overhead and time, hence not suitable for vehicles. In this study, we propose an autonomous and low-cost testbed to collect extensive co-located mmWave signal and other sensors data such as LiDAR (Light Detection and Ranging), cameras, ultrasonic, etc, traditionally for ``automated'', to facilitate mmWave vehicular communications. Intuitively, these sensors can build a 3D map around the vehicle and signal propagation path can be estimated, eliminating iterative the process via pilot signals. This multimodal data fusion, together with AI, is expected to bring significant advances in ``connected'' research. | cs | 0 |
Title: On a conjecture of George Beck
Abstract: In this paper, we prove a conjecture proposed by George Beck, which involves gap-free partitions and partitions with distinct parts. | math | 1 |
Title: Composition method for chromatic symmetric functions: Neat noncommutative analogs
Abstract: This work is inspired by Shareshian and Wachs's exquisite formula for the chromatic symmetric function of paths. We develop a composition method to unearth neat noncommutative analogs of chromatic symmetric functions. A symmetric function is $e$-positive if and only if it has a $\Lambda$-positive noncommutative analog. We bring to light short and sweet $\Lambda$-positive noncommutative analogs for the chromatic symmetric functions of tadpoles and barbells, with cycles and lollipops as specifications. Using these elegant formulas and the composition method, we discover a new family of $e$-positive graphs and call them hats, which are the unicyclic graphs obtained by adding an edge to a path. A compact ribbon Schur analog for cycles is also obtained as a by-product. | math | 0 |
Title: Trajectory-Oriented Policy Optimization with Sparse Rewards
Abstract: Deep reinforcement learning (DRL) remains challenging in tasks with sparse rewards. These sparse rewards often only indicate whether the task is partially or fully completed, meaning that many exploration actions must be performed before the agent obtains useful feedback. Hence, most existing DRL algorithms fail to learn feasible policies within a reasonable time frame. To overcome this problem, we develop an approach that exploits offline demonstration trajectories for faster and more efficient online RL in sparse reward settings. Our key insight is that by regarding offline demonstration trajectories as guidance, instead of imitating them, our method learns a policy whose state-action visitation marginal distribution matches that of offline demonstrations. Specifically, we introduce a novel trajectory distance based on maximum mean discrepancy (MMD) and formulate policy optimization as a distance-constrained optimization problem. Then, we show that this distance-constrained optimization problem can be reduced into a policy-gradient algorithm with shaped rewards learned from offline demonstrations. The proposed algorithm is evaluated on extensive discrete and continuous control tasks with sparse and deceptive rewards. The experimental results indicate that our proposed algorithm is significantly better than the baseline methods regarding diverse exploration and learning the optimal policy. | cs | 0 |
Title: Stable cohomology of congruence subgroups
Abstract: We describe the $\mathbb{F}_p$-cohomology of the congruence subgroups $SL_n(\mathbb{Z}, p^m)$ in degrees $* < p$, for all large enough $n$, establishing a formula proposed by F. Calegari. Along the way, we also establish a formula for the stable cohomology of $SL_n(\mathbb{Z}/p)$ with certain twisted coefficients. | math | 1 |
Title: Introducing an experimental distortion-tolerant speech encryption scheme for secure voice communication
Abstract: The current increasing need for privacy-preserving voice communications is leading to new ideas for securing voice transmission. This paper refers to a relatively new concept of sending encrypted speech as pseudo-speech in the audio domain over digital voice communication infrastructures, like 3G cellular network and VoIP. This work presents a novel distortion-tolerant speech encryption scheme for secure voice communications over voice channels that combines the robustness of analog speech scrambling and elevated security offered by digital ciphers like AES-CTR. The system scrambles vocal parameters of a speech signal (loudness, pitch, timbre) using distance-preserving pseudo-random translations and rotations on a hypersphere of parameters. Next, scrambled parameters are encoded to a pseudo-speech signal adapted to transmission over digital voice channels equipped with voice activity detection. Upon reception of this pseudo-speech signal, the legitimate receiver restores distorted copies of the initial vocal parameters. Despite some deciphering errors, an integrated neural-based vocoder based on the LPCNet architecture reconstructs an intelligible speech. The experimental implementation of this speech encryption scheme has been tested by simulations and sending an encrypted signal over FaceTime between two iPhones 6 connected to the same WiFi network. Moreover, speech excerpts restored from encrypted signals were evaluated by a speech quality assessment on a group of about 40 participants. The experiments demonstrated that the proposed scheme produces intelligible speech with a gracefully progressive quality degradation depending on the channel noise. Finally, the preliminary computational analysis suggested that the presented setting may operate on high-end portable devices in nearly real-time. | cs | 1 |
Title: Kempe equivalence and quadratic toric rings
Abstract: Perfectly contractile graphs form a typical class of perfect graphs. In particular, all $k$-colorings of a perfectly contractile graph are Kempe equivalent. Everett and Reed conjectured that a graph is perfectly contractile if and only if it contains no odd holes, no antiholes and no odd prisms. On the other hand the authors and Shibata conjectured that a perfect graph is perfectly contractile if and only if its toric ring, which is called the stable set ring, is quadratic. In the present paper, we characterize when the stable set ring of a (not necessarily perfect) graph is quadratic by using Kempe equivalence. As applications of this characterization, we can claim that if Everett and Reed conjecture is true, then the conjecture of the authors and Shibata is also true. Moreover, we can show that for several important classes of perfectly contractile graphs, the stable set rings are quadratic. | math | 0 |
Title: Generalised Dirac-Schrödinger operators and the Callias Theorem
Abstract: We consider generalised Dirac-Schr\"odinger operators, consisting of a self-adjoint elliptic first-order differential operator D with a skew-adjoint 'potential' given by a (suitable) family of unbounded operators on an auxiliary Hilbert module. The index of such an operator represents the pairing (Kasparov product) of the K-theory class of the potential with the K-homology class of D. Our main result in this paper is a generalisation of the Callias Theorem: the index of the Dirac-Schr\"odinger operator can be computed from its restriction to a hypersurface. Our theorem simultaneously generalises (and is inspired by) the well-known result that the spectral flow of a path of relatively compact perturbations depends only on the endpoints. | math | 0 |
Title: Hyperbolic Graph Diffusion Model
Abstract: Diffusion generative models (DMs) have achieved promising results in image and graph generation. However, real-world graphs, such as social networks, molecular graphs, and traffic graphs, generally share non-Euclidean topologies and hidden hierarchies. For example, the degree distributions of graphs are mostly power-law distributions. The current latent diffusion model embeds the hierarchical data in a Euclidean space, which leads to distortions and interferes with modeling the distribution. Instead, hyperbolic space has been found to be more suitable for capturing complex hierarchical structures due to its exponential growth property. In order to simultaneously utilize the data generation capabilities of diffusion models and the ability of hyperbolic embeddings to extract latent hierarchical distributions, we propose a novel graph generation method called, Hyperbolic Graph Diffusion Model (HGDM), which consists of an auto-encoder to encode nodes into successive hyperbolic embeddings, and a DM that operates in the hyperbolic latent space. HGDM captures the crucial graph structure distributions by constructing a hyperbolic potential node space that incorporates edge information. Extensive experiments show that HGDM achieves better performance in generic graph and molecule generation benchmarks, with a $48\%$ improvement in the quality of graph generation with highly hierarchical structures. | cs | 0 |
Title: Semifinite harmonic functions on branching graphs
Abstract: We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs. This method was proposed by A. Wassermann in terms of operator algebras, while we rephrase, clarify, and simplify the main arguments, working only with combinatorial objects. This work was inspired by the theory of traceable factor representations of the infinite symmetric group $S(\infty)$. | math | 1 |
Title: Higher convexity and iterated sum sets
Abstract: Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. We deduce several new sum-product type implications, e.g. that $A+A$ being small implies unbounded growth for a many enough times iterated product set $A \cdots A$. | math | 1 |
Title: Frequency-Adaptive Pan-Sharpening with Mixture of Experts
Abstract: Pan-sharpening involves reconstructing missing high-frequency information in multi-spectral images with low spatial resolution, using a higher-resolution panchromatic image as guidance. Although the inborn connection with frequency domain, existing pan-sharpening research has not almost investigated the potential solution upon frequency domain. To this end, we propose a novel Frequency Adaptive Mixture of Experts (FAME) learning framework for pan-sharpening, which consists of three key components: the Adaptive Frequency Separation Prediction Module, the Sub-Frequency Learning Expert Module, and the Expert Mixture Module. In detail, the first leverages the discrete cosine transform to perform frequency separation by predicting the frequency mask. On the basis of generated mask, the second with low-frequency MOE and high-frequency MOE takes account for enabling the effective low-frequency and high-frequency information reconstruction. Followed by, the final fusion module dynamically weights high-frequency and low-frequency MOE knowledge to adapt to remote sensing images with significant content variations. Quantitative and qualitative experiments over multiple datasets demonstrate that our method performs the best against other state-of-the-art ones and comprises a strong generalization ability for real-world scenes. Code will be made publicly at \url{https://github.com/alexhe101/FAME-Net}. | cs | 0 |
Title: Stability and instability of Kelvin waves
Abstract: The $m$-waves of Kelvin are uniformly rotating patch solutions of the 2D Euler equations with $m$-fold rotational symmetry for $m\geq 2$. For Kelvin waves sufficiently close to the disc, we prove a nonlinear stability result up to an arbitrarily long time in the $L^1$ norm of the vorticity, for $m$-fold symmetric perturbations. To obtain this result, we first prove that the Kelvin wave is a strict local maximizer of the energy functional in some admissible class of patches, which had been claimed by Wan in 1986. This gives an orbital stability result with a support condition on the evolution of perturbations, but using a Lagrangian bootstrap argument which traces the particle trajectories of the perturbation, we are able to drop the condition on the evolution. Based on this unconditional stability result, we establish that long time filamentation, or formation of long arms, occurs near the Kelvin waves, which have been observed in various numerical simulations. Additionally, we discuss stability of annular patches in the same variational framework. | math | 1 |
Title: Stability of strong viscous shock wave under periodic perturbation for 1-D isentropic Navier-Stokes system in the half space
Abstract: In this paper, a viscous shock wave under space-periodic perturbation of 1-D isentropic Navier-Stokes system in the half space is investigated. It is shown that if the initial periodic perturbation around the viscous shock wave is small, then the solution time asymptotically tends to a viscous shock wave with a shift partially determined by the periodic oscillations. Moreover, the strength of {the} shock wave could be arbitrarily large. This result essentially improves the previous work " A. Matsumura, M. Mei, Convergence to travelling fronts of solutions of the p-system with viscosity in the presence of a boundary. Arch. Ration. Mech. Anal. 146 (1999), no. 1, 1-22." where the strength of shock wave is sufficiently small and the initial periodic oscillations vanish. | math | 0 |
Title: A bridge between the circular and linear normal distributions
Abstract: In this short note, we present a refined approximation for the log-ratio of the density of the von Mises$(\mu,\kappa)$ distribution (also called the circular normal distribution) to the standard (linear) normal distribution when the concentration parameter \k{appa} is large. Our work complements the one of Hill (1976), who obtained a very similar approximation along with quantile couplings, using earlier approximations by Hill & Davis (1968) of Cornish-Fisher type. One motivation for this note is to highlight the connection between the circular and linear normal distributions through their circular variance and (linear) variance. | math | 0 |
Title: Linear subspaces of the intersection of two quadrics via Kuznetsov component
Abstract: Let $Q_i(i=1,2)$ be $2g$ dimensional quadrics in $\mathbb{P}^{2g+1}$ and let $Y$ be the smooth intersection $Q_1\cap Q_2$. We associate the linear subspace in $Y$ with vector bundles on the hyperelliptic curve $C$ of genus $g$ by the left adjoint functor of $\Phi:D^b(C)\rightarrow D^b(Y)$. As an application, we give a different proof of the classification of line bundles and stable bundles of rank $2$ on hyperelliptic curves given by Desale and Ramanan. When $g=3$, we show that the projection functor induces a closed embedding $\alpha:Y\rightarrow SU^s_C(4,h)$ into the moduli space of stable bundles on $C$ of rank $4$ of fixed determinant. | math | 0 |
Title: Reciprocity formulas for certain generalized Hardy sums
Abstract: In this paper, we establish some reciprocity formulas for certain generalized Hardy sums by using the Fourier series technique and some properties of the periodic zeta function and Lerch zeta function. It turns out that one of Hardy's reciprocity theorems is deduced as a special case. | math | 0 |
Title: A fractional conformal curvature flow on the unit sphere
Abstract: We study a fractional conformal curvature flow on the standard unit sphere and prove a perturbation result of the fractional Nirenberg problem with fractional exponent $\sigma \in (1/2,1)$. This extends the result of Chen-Xu (Invent. Math. 187, no. 2, 395-506, 2012) for the scalar curvature flow on the standard unit sphere. | math | 1 |
Title: Predicting parametric spatiotemporal dynamics by multi-resolution PDE structure-preserved deep learning
Abstract: Pure data-driven deep learning models suffer from high training costs, error accumulation, and poor generalizability when predicting complex physical processes. A more promising way is to leverage our prior physics knowledge in scientific deep learning models, known as physics-informed deep learning (PiDL). In most PiDL frameworks, the physics prior is utilized to regularize neural network training by incorporating governing equations into the loss function. The resulting physical constraint, imposed in a soft manner, relies heavily on a proper setting of hyperparameters that weigh each loss term. To this end, we propose a new direction to leverage physics prior knowledge by ``baking'' the mathematical structure of governing equations into the neural network architecture, namely PDE-preserved neural network (PPNN). The discretized PDE is preserved in PPNN as convolutional residual networks formulated in a multi-resolution setting. This physics-inspired learning architecture endows PPNN with excellent generalizability and long-term prediction accuracy compared to the state-of-the-art black-box baselines. The effectiveness and merit of the proposed methods have been demonstrated over a handful of spatiotemporal dynamical systems governed by spatiotemporal PDEs, including reaction-diffusion, Burgers', and Navier-Stokes equations. | cs | 1 |
Title: Two dimensional gravity waves at low regularity II: Global solutions
Abstract: This article represents the second installment of a series of papers concerned with low regularity solutions for the water wave equations in two space dimensions. Our focus here is on global solutions for small and localized data. Such solutions have been proved to exist earlier in [15, 7, 10, 12] in much higher regularity. Our goal in this paper is to improve these results and prove global well-posedness under minimal regularity and decay assumptions for the initial data. One key ingredient here is represented by the balanced cubic estimates in our first paper. Another is the nonlinear vector field Sobolev inequalities, an idea first introduced by the last two authors in the context of the Benjamin-Ono equations [14]. | math | 1 |
Title: Analyticity of Entropy Rate of Hidden Markov Chains
Abstract: We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine the domain of analyticity is stated. An example is given to estimate the radius of convergence for the entropy rate. We then show that the positivity assumptions can be relaxed, and examples are given for the relaxed conditions. We study a special class of hidden Markov chains in more detail: binary hidden Markov chains with an unambiguous symbol, and we give necessary and sufficient conditions for analyticity of the entropy rate for this case. Finally, we show that under the positivity assumptions the hidden Markov chain {\em itself} varies analytically, in a strong sense, as a function of the underlying Markov chain parameters. | math | 1 |
Title: On the non-transverse homoclinic channel of a center manifold
Abstract: We consider a scenario when a stable and unstable manifolds of compact center manifold of a saddle-center coincide. The normal form of the ODE governing the system near the center manifold is derived and so is the normal form of the return map to the neighbourhood of the center manifold. The limit dynamics of the return map is investigated by showing that it might take the form of a Henon-like map possessing a Lorenz-like attractor or satisfy 'cone-field condition' resulting in partial hyperbolicity. We consider also motivating example from game theory. | math | 1 |
Title: On the Lebesgue measure of the Feigenbaum Julia set
Abstract: We show that the Julia set of the Feigenbaum polynomial has Hausdorff dimension less than~2 (and consequently it has zero Lebesgue measure). This solves a long-standing open question. | math | 1 |
Title: Bounded diameter tree-decompositions
Abstract: When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is called having bounded ``tree-length''. We will show that this is equivalent to being ``boundedly quasi-isometric to a tree'', which for infinite graphs is a much-studied property from metric geometry. One object of this paper is to tie these two areas together. We will prove that there is a tree-decomposition in which each bag has small diameter, if and only if there is a map $\phi$ from $V(G)$ into the vertex set of a tree $T$, such that for all $u,v\in V(G)$, the distances $d_G(u,v), d_T(\phi(u),\phi(v))$ differ by at most a constant. A ``geodesic loaded cycle'' in $G$ is a pair $(C,F)$, where $C$ is a cycle of $G$ and $F\subseteq E(C)$, such that for every pair $u,v$ of vertices of $C$, one of the paths of $C$ between $u,v$ contains at most $d_G(u,v)$ $F$-edges, where $d_G(u,v)$ is the distance between $u,v$ in $G$. We will show that a graph $G$ admits a tree-decomposition in which every bag has small diameter, if and only if $|F|$ is small for every geodesic loaded cycle $(C,F)$. Our proof is an extension of an algorithm to approximate tree-length in finite graphs by Dourisboure and Gavoille. In metric geometry, there is a similar theorem that characterizes when a graph is quasi-isometric to a tree, ``Manning's bottleneck criterion''. The goal of this paper is to tie all these concepts together, and add a few more related ideas. For instance, we prove a conjecture of Rose McCarty, that $G$ admits a tree-decomposition in which every bag has small diameter, if and only if for all vertices $u,v,w$ of $G$, some ball of small radius meets every path joining two of $u,v,w$. | math | 0 |
Title: A Survey of Protocol Fuzzing
Abstract: Communication protocols form the bedrock of our interconnected world, yet vulnerabilities within their implementations pose significant security threats. Recent developments have seen a surge in fuzzing-based research dedicated to uncovering these vulnerabilities within protocol implementations. However, there still lacks a systematic overview of protocol fuzzing for answering the essential questions such as what the unique challenges are, how existing works solve them, etc. To bridge this gap, we conducted a comprehensive investigation of related works from both academia and industry. Our study includes a detailed summary of the specific challenges in protocol fuzzing, and provides a systematic categorization and overview of existing research efforts. Furthermore, we explore and discuss potential future research directions in protocol fuzzing. This survey serves as a foundational guideline for researchers and practitioners in the field. | cs | 0 |
Title: Supervised learning on heterogeneous, attributed entities interacting over time
Abstract: Most physical or social phenomena can be represented by ontologies where the constituent entities are interacting in various ways with each other and with their environment. Furthermore, those entities are likely heterogeneous and attributed with features that evolve dynamically in time as a response to their successive interactions. In order to apply machine learning on such entities, e.g., for classification purposes, one therefore needs to integrate the interactions into the feature engineering in a systematic way. This proposal shows how, to this end, the current state of graph machine learning remains inadequate and needs to be be augmented with a comprehensive feature engineering paradigm in space and time. | cs | 1 |
Title: Fringe Analysis of Plane Trees Related to Cutting and Pruning
Abstract: Rooted plane trees are reduced by four different operations on the fringe. The number of surviving nodes after reducing the tree repeatedly for a fixed number of times is asymptotically analyzed. The four different operations include cutting all or only the leftmost leaves or maximal paths. This generalizes the concept of pruning a tree. The results include exact expressions and asymptotic expansions for the expected value and the variance as well as central limit theorems. | math | 1 |
Title: Weaving continuous generalized frames for operators
Abstract: Recently, Bemrose et al. \cite{BE} developed a theory of weaving frames, which was motivated by a problem regarding distributed signal processing. In this present article, we introduce the atomic $g$-system and we generalize some of the known results in continuous $L$-frames, weaving continuous and weaving continuous $ g$-frames, also we study weaving continuous $ L$-$g$-frames in Hilbert spaces. Moreover, we study the behaviour continuous $ L$-$g$-frames under some perturbations, and we show that approximate $L$-duals are stable under small perturbation and that it is possible to remove some elements of a woven continuous $ L$-$g$-frame and still have a woven continuous $ L$-$g$-frame. | math | 0 |
Title: Economics Arena for Large Language Models
Abstract: Large language models (LLMs) have been extensively used as the backbones for general-purpose agents, and some economics literature suggest that LLMs are capable of playing various types of economics games. Following these works, to overcome the limitation of evaluating LLMs using static benchmarks, we propose to explore competitive games as an evaluation for LLMs to incorporate multi-players and dynamicise the environment. By varying the game history revealed to LLMs-based players, we find that most of LLMs are rational in that they play strategies that can increase their payoffs, but not as rational as indicated by Nash Equilibria (NEs). Moreover, when game history are available, certain types of LLMs, such as GPT-4, can converge faster to the NE strategies, which suggests higher rationality level in comparison to other models. In the meantime, certain types of LLMs can win more often when game history are available, and we argue that the winning rate reflects the reasoning ability with respect to the strategies of other players. Throughout all our experiments, we observe that the ability to strictly follow the game rules described by natural languages also vary among the LLMs we tested. In this work, we provide an economics arena for the LLMs research community as a dynamic simulation to test the above-mentioned abilities of LLMs, i.e. rationality, strategic reasoning ability, and instruction-following capability. | cs | 0 |
Title: Chebyshev Subdivision and Reduction Methods for Solving Multivariable Systems of Equations
Abstract: We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and elimination checks that leverage special properties of Chebyshev polynomials. We prove the method has R-quadratic convergence locally near simple zeros of the system. We also analyze the temporal complexity and the numerical stability of the algorithm and provide numerical evidence in dimensions up to three that the method is both fast and accurate on a wide range of problems. The algorithm should also work well in higher dimensions. Our tests show that the algorithm outperforms other standard methods on this problem of finding all real zeros in a bounded domain. Our Python implementation of the algorithm is publicly available. | math | 0 |
Title: High-Resolution Image Inpainting with Iterative Confidence Feedback and Guided Upsampling
Abstract: Existing image inpainting methods often produce artifacts when dealing with large holes in real applications. To address this challenge, we propose an iterative inpainting method with a feedback mechanism. Specifically, we introduce a deep generative model which not only outputs an inpainting result but also a corresponding confidence map. Using this map as feedback, it progressively fills the hole by trusting only high-confidence pixels inside the hole at each iteration and focuses on the remaining pixels in the next iteration. As it reuses partial predictions from the previous iterations as known pixels, this process gradually improves the result. In addition, we propose a guided upsampling network to enable generation of high-resolution inpainting results. We achieve this by extending the Contextual Attention module to borrow high-resolution feature patches in the input image. Furthermore, to mimic real object removal scenarios, we collect a large object mask dataset and synthesize more realistic training data that better simulates user inputs. Experiments show that our method significantly outperforms existing methods in both quantitative and qualitative evaluations. More results and Web APP are available at https://zengxianyu.github.io/iic. | cs | 1 |
Title: Privacy concerns from variances in spatial navigability in VR
Abstract: Current Virtual Reality (VR) input devices make it possible to navigate a virtual environment and record immersive, personalized data regarding the user's movement and specific behavioral habits, which brings the question of the user's privacy concern to the forefront. In this article, the authors propose to investigate Machine Learning driven learning algorithms that try to learn with human users co-operatively and can be used to countermand existing privacy concerns in VR but could also be extended to Augmented Reality (AR) platforms. | cs | 1 |
Title: Joint distribution in residue classes of families of polynomially-defined additive functions
Abstract: Let $g_1, \dots , g_M$ be additive functions for which there exist nonconstant polynomials $G_1, \dots , G_M$ satisfying $g_i(p) = G_i(p)$ for all primes $p$ and all $i \in \{1, \dots , M\}$. Under fairly general and nearly optimal hypotheses, we show that the functions $g_1, \dots , g_M$ are jointly equidistributed among the residue classes to moduli $q$ varying uniformly up to a fixed but arbitrary power of $\log x$. Thus, we obtain analogues of the Siegel-Walfisz Theorem for primes in arithmetic progressions, but with primes replaced by values of such additive functions. Our results partially extend work of Delange from fixed moduli to varying moduli, and also generalize recent work done for a single additive function. | math | 0 |
Title: Event-Object Reasoning with Curated Knowledge Bases: Deriving Missing Information
Abstract: The broader goal of our research is to formulate answers to why and how questions with respect to knowledge bases, such as AURA. One issue we face when reasoning with many available knowledge bases is that at times needed information is missing. Examples of this include partially missing information about next sub-event, first sub-event, last sub-event, result of an event, input to an event, destination of an event, and raw material involved in an event. In many cases one can recover part of the missing knowledge through reasoning. In this paper we give a formal definition about how such missing information can be recovered and then give an ASP implementation of it. We then discuss the implication of this with respect to answering why and how questions. | cs | 1 |
Title: Simplified Information Geometry Approach for Massive MIMO-OFDM Channel Estimation -- Part II: Convergence Analysis
Abstract: In Part II of this two-part paper, we prove the convergence of the simplified information geometry approach (SIGA) proposed in Part I. For a general Bayesian inference problem, we first show that the iteration of the common second-order natural parameter (SONP) is separated from that of the common first-order natural parameter (FONP). Hence, the convergence of the common SONP can be checked independently. We show that with the initialization satisfying a specific but large range, the common SONP is convergent regardless of the value of the damping factor. For the common FONP, we establish a sufficient condition of its convergence and prove that the convergence of the common FONP relies on the spectral radius of a particular matrix related to the damping factor. We give the range of the damping factor that guarantees the convergence in the worst case. Further, we determine the range of the damping factor for massive MIMO-OFDM channel estimation by using the specific properties of the measurement matrices. Simulation results are provided to confirm the theoretical results. | cs | 0 |
Title: Improving Approximate Optimal Transport Distances using Quantization
Abstract: Optimal transport (OT) is a popular tool in machine learning to compare probability measures geometrically, but it comes with substantial computational burden. Linear programming algorithms for computing OT distances scale cubically in the size of the input, making OT impractical in the large-sample regime. We introduce a practical algorithm, which relies on a quantization step, to estimate OT distances between measures given cheap sample access. We also provide a variant of our algorithm to improve the performance of approximate solvers, focusing on those for entropy-regularized transport. We give theoretical guarantees on the benefits of this quantization step and display experiments showing that it behaves well in practice, providing a practical approximation algorithm that can be used as a drop-in replacement for existing OT estimators. | cs | 1 |
Title: Do the Hodge spectra distinguish orbifolds from manifolds? Part 2
Abstract: In \cite{GGKM-SSS} we examined the relationship between the singular set of a compact Riemannian orbifold and the spectrum of the Hodge Laplacian on $p$-forms by computing the heat invariants associated to the $p$-spectrum. We showed that the heat invariants of the $0$-spectrum together with those of the $1$-spectrum for the corresponding Hodge Laplacians are sufficient to distinguish orbifolds from manifolds as long as the singular sets have codimension $\le 3.$ This is enough to distinguish orbifolds from manifolds for dimension $\le 3.$ Here we give both positive and negative inverse spectral results for the individual $p$-spectra considered separately. For example, we give conditions on the codimension of the singular set which guarantee that the volume of the singular set is determined, and in many cases we show by providing counterexamples that the conditions are sharp. | math | 0 |
Title: Looking forwards and backwards: dynamics and genealogies of locally regulated populations
Abstract: We introduce a broad class of spatial models to describe how spatially heterogeneous populations live, die, and reproduce. Individuals are represented by points of a point measure, whose birth and death rates can depend both on spatial position and local population density, defined via the convolution of the point measure with a nonnegative kernel. We pass to three different scaling limits: an interacting superprocess, a nonlocal partial differential equation (PDE), and a classical PDE. The classical PDE is obtained both by first scaling time and population size to pass to the nonlocal PDE, and then scaling the kernel that determines local population density; and also (when the limit is a reaction-diffusion equation) by simultaneously scaling the kernel width, timescale and population size in our individual based model. A novelty of our model is that we explicitly model a juvenile phase: offspring are thrown off in a Gaussian distribution around the location of the parent, and reach (instant) maturity with a probability that can depend on the population density at the location at which they land. Although we only record mature individuals, a trace of this two-step description remains in our population models, resulting in novel limits governed by a nonlinear diffusion. Using a lookdown representation, we retain information about genealogies and, in the case of deterministic limiting models, use this to deduce the backwards in time motion of the ancestral lineage of a sampled individual. We observe that knowing the history of the population density is not enough to determine the motion of ancestral lineages in our model. We also investigate the behaviour of lineages for three different deterministic models of a population expanding its range as a travelling wave: the Fisher-KPP equation, the Allen-Cahn equation, and a porous medium equation with logistic growth. | math | 0 |
Title: From Bi-immunity to Absolute Undecidability
Abstract: An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether, unlike the case for bi-immunity, there is an absolutely undecidable set in every non-zero Turing degree. We provide a positive answer to this question by applying techniques from coding theory. We show how to use Walsh-Hadamard codes to build a truth-table functional which maps any sequence A to a sequence B, such that given any restriction of B to a set of positive upper density, one can recover A. This implies that if A is non-computable, then B is absolutely undecidable. Using a forcing construction, we show that this result cannot be strengthened in any significant fashion. | math | 1 |
Title: Stress and Adaptation: Applying Anna Karenina Principle in Deep Learning for Image Classification
Abstract: Image classification with deep neural networks has reached state-of-art with high accuracy. This success is attributed to good internal representation features that bypasses the difficulties of the non-convex optimization problems. We have little understanding of these internal representations, let alone quantifying them. Recent research efforts have focused on alternative theories and explanations of the generalizability of these deep networks. We propose the alternative perturbation of deep models during their training induces changes that lead to transitions to different families. The result is an Anna Karenina Principle AKP for deep learning, in which less generalizable models unhappy families vary more in their representation than more generalizable models happy families paralleling Leo Tolstoy dictum that all happy families look alike, each unhappy family is unhappy in its own way. Anna Karenina principle has been found in systems in a wide range: from the surface of endangered corals exposed to harsh weather to the lungs of patients suffering from fatal diseases of AIDs. In our paper, we have generated artificial perturbations to our model by hot-swapping the activation and loss functions during the training. In this paper, we build a model to classify cancer cells from non-cancer ones. We give theoretical proof that the internal representations of generalizable happy models are similar in the asymptotic limit. Our experiments verify similar representations of generalizable models. | cs | 1 |
Title: Some Aspects on Solving Transportation Problem
Abstract: In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of special structure. We observe that the optimality of North West corner solution holds for the general problem where cost component is replaced by a convex function. We revisit assignment problem and present a weighted version of K$\ddot{o}$nig-Egerv$\acute{a}$ry theorem and Hungarian method. The weighted Hungarian method proposed in the paper can be used for solving transportation problem. | math | 1 |
Title: Fractal geometry of the space-time difference profile in the directed landscape via construction of geodesic local times
Abstract: The Directed Landscape, a random directed metric on the plane (where the first and the second coordinates are termed spatial and temporal respectively), was constructed in the breakthrough work of Dauvergne, Ortmann, and Vir\'ag, and has since been shown to be the scaling limit of various integrable models of Last Passage percolation, a central member of the Kardar-Parisi-Zhang universality class. It exhibits several scale invariance properties making it a natural source of rich fractal behavior. Such a study was initiated in Basu-Ganguly-Hammond, where the difference profile i.e., the difference of passage times from two fixed points (say $(\pm 1,0)$), was considered. Owing to geodesic geometry, it turns out that this difference process is almost surely locally constant. The set of non-constancy is connected to disjointness of geodesics and inherits remarkable fractal properties. In particular, it has been established that when only the spatial coordinate is varied, the set of non-constancy of the difference profile has Hausdorff dimension $1/2$, and bears a rather strong resemblance to the zero set of Brownian motion. The arguments crucially rely on a monotonicity property, which is absent when the temporal structure of the process is probed, necessitating the development of new methods. In this paper, we put forth several new ideas, and show that the set of non-constancy of the 2D difference profile and the 1D temporal process (when the spatial coordinate is fixed and the temporal coordinate is varied) have Hausdorff dimensions $5/3$ and $2/3$ respectively. A particularly crucial ingredient in our analysis is the novel construction of a local time process for the geodesic akin to Brownian local time, supported on the "zero set" of the geodesic. Further, we show that the latter has Hausdorff dimension $1/3$ in contrast to the zero set of Brownian motion which has dimension $1/2.$ | math | 1 |
Title: On the error term in a mixed moment of L-functions
Abstract: There has recently been some interest in optimizing the error term in the asymptotic for the fourth moment of Dirichlet L-functions and a closely related mixed moment of L-functions involving automorphic L-functions twisted by Dirichlet characters. We obtain an improvement for the error term of the latter. | math | 0 |
Title: A multiscale quasilinear system for colloids deposition in porous media: Weak solvability and numerical simulation of a near-clogging scenario
Abstract: We study the weak solvability of a quasilinear reaction-diffusion system nonlinearly coupled with an linear elliptic system posed in a domain with distributed microscopic balls in $2D$. The size of these balls are governed by an ODE with direct feedback on the overall problem. The system describes the diffusion, aggregation, fragmentation, and deposition of populations of colloidal particles of various sizes inside a porous media made of prescribed arrangement of balls. The mathematical analysis of the problem relies on a suitable application of Schauder's fixed point theorem which also provides a convergent algorithm for an iteration method to compute finite difference approximations of smooth solutions to our multiscale model. Numerical simulations illustrate the behavior of the local concentration of the colloidal populations close to clogging situations. | math | 1 |
Title: Towards dense volumetric pancreas segmentation in CT using 3D fully convolutional networks
Abstract: Pancreas segmentation in computed tomography imaging has been historically difficult for automated methods because of the large shape and size variations between patients. In this work, we describe a custom-build 3D fully convolutional network (FCN) that can process a 3D image including the whole pancreas and produce an automatic segmentation. We investigate two variations of the 3D FCN architecture; one with concatenation and one with summation skip connections to the decoder part of the network. We evaluate our methods on a dataset from a clinical trial with gastric cancer patients, including 147 contrast enhanced abdominal CT scans acquired in the portal venous phase. Using the summation architecture, we achieve an average Dice score of 89.7 $\pm$ 3.8 (range [79.8, 94.8]) % in testing, achieving the new state-of-the-art performance in pancreas segmentation on this dataset. | cs | 1 |
Title: Watkins' conjecture for elliptic curves over function fields
Abstract: In 2002 Watkins conjectured that given an elliptic curve defined over $\mathbb{Q}$, its Mordell-Weil rank is at most the $2$-adic valuation of its modular degree. We consider the analogous problem over function fields of positive characteristic, and we prove it in several cases. More precisely, every modular semi-stable elliptic curve over $\mathbb{F}_q(T)$ after extending constant scalars, and every quadratic twist of a modular elliptic curve over $\mathbb{F}_q(T)$ by a polynomial with sufficiently many prime factors satisfy the analogue of Watkins' conjecture. Furthermore, for a well-known family of elliptic curves with unbounded rank due to Ulmer, we prove the analogue of Watkins' conjecture. | math | 1 |
Title: Speeding up the Euler scheme for killed diffusions
Abstract: Let $X$ be a linear diffusion taking values in $(\ell,r)$ and consider the standard Euler scheme to compute an approximation to $\mathbb{E}[g(X_T)\mathbf{1}_{[T<\zeta]}]$ for a given function $g$ and a deterministic $T$, where $\zeta=\inf\{t\geq 0: X_t \notin (\ell,r)\}$. It is well-known since \cite{GobetKilled} that the presence of killing introduces a loss of accuracy and reduces the weak convergence rate to $1/\sqrt{N}$ with $N$ being the number of discretisatons. We introduce a drift-implicit Euler method to bring the convergence rate back to $1/N$, i.e. the optimal rate in the absence of killing, using the theory of recurrent transformations developed in \cite{rectr}. Although the current setup assumes a one-dimensional setting, multidimensional extension is within reach as soon as a systematic treatment of recurrent transformations is available in higher dimensions. | math | 1 |
Title: Enumerating m-Length Walks in Directed Graphs with Constant Delay
Abstract: In this paper, we provide a novel enumeration algorithm for the set of all walks of a given length within a directed graph. Our algorithm has worst-case constant delay between outputting succinct representations of such walks, after a preprocessing step requiring linear time relative to the size of the graph. We apply these results to the problem of enumerating succinct representations of the strings of a given length from a prefix-closed regular language (languages accepted by a finite automaton which has final states only). | cs | 0 |
Title: Adaptive estimation of a function from its Exponential Radon Transform in presence of noise
Abstract: In this article we propose a locally adaptive strategy for estimating a function from its Exponential Radon Transform (ERT) data, without prior knowledge of the smoothness of functions that are to be estimated. We build a non-parametric kernel type estimator and show that for a class of functions comprising a wide Sobolev regularity scale, our proposed strategy follows the minimax optimal rate up to a $\log{n}$ factor. We also show that there does not exist an optimal adaptive estimator on the Sobolev scale when the pointwise risk is used and in fact the rate achieved by the proposed estimator is the adaptive rate of convergence. | math | 1 |
Title: Structure of betweenness uniform graphs with low values of betweenness centrality
Abstract: This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not trivial and its classification is still an open problem. Recently, Gago, Coroni\v{c}ov\'a-Hurajov\'a and Madaras conjectured that for every rational $\alpha\ge 3/4$ there exists a BUG having betweenness centrality~$\alpha$. We disprove this conjecture, and provide an alternative view of the structure of betweenness-uniform graphs from the point of view of their complement. This allows us to characterise all the BUGs with betweennes centrality at most 9/10, and show that their betweenness centrality is equal to $\frac{\ell}{\ell+1}$ for some integer $\ell\le 9$. We conjecture that this characterization extends to all the BUGs with betweenness centrality smaller than~1. | math | 0 |
Title: Boson Operator Ordering Identities from Generalized Stirling and Eulerian Numbers
Abstract: Ordering identities in the Weyl-Heisenberg algebra generated by single-mode boson operators are investigated. A boson string composed of creation and annihilation operators can be expanded as a linear combination of other such strings, the simplest example being a normal ordering. The case when each string contains only one annihilation operator is already combinatorially nontrivial. Two kinds of expansion are derived: (i) that of a power of a string $\Omega$ in lower powers of another string $\Omega'$, and (ii) that of a power of $\Omega$ in twisted versions of the same power of $\Omega'$. The expansion coefficients are shown to be, respectively, generalized Stirling numbers of Hsu and Shiue, and certain generalized Eulerian numbers. Many examples are given. These combinatorial numbers are binomial transforms of each other, and their theory is developed, emphasizing schemes for computing them: summation formulas, Graham-Knuth-Patashnik (GKP) triangular recurrences, terminating hypergeometric series, and closed-form expressions. The results on the first type of expansion subsume a number of previous results on the normal ordering of boson strings. | math | 0 |
Title: Harvesting of a stochastic population under a mixed regular-singular control formulation
Abstract: This work focuses on optimal harvesting-renewing for a stochastic population. A mixed regular-singular control formulation with a state constraint and regime-switching is introduced. The decision-makers either harvest or renew with finite or infinite harvesting/renewing rates. The payoff functions depend on the harvesting/renewing rates. Several properties of the value functions are established. The limiting value function as the white noise intensity approaches infinity is identified. The Markov chain approximation method is used to find a numerical approximation of the value function and optimal strategies. | math | 1 |
Title: Team Semantics and Independence Notions in Quantum Physics
Abstract: We study dependence and independence concepts found in quantum physics, especially those related to hidden variables and non-locality, through the lens of team semantics and probabilistic team semantics, adapting a relational framework introduced by the first author in a prior paper. This leads to new developments also in independence logic and probabilistic independence logic. | math | 1 |
Title: Spin systems with hyperbolic symmetry: a survey
Abstract: Spin systems with hyperbolic symmetry originated as simplified models for the Anderson metal--insulator transition, and were subsequently found to exactly describe probabilistic models of linearly reinforced walks and random forests. In this survey we introduce these models, discuss their origins and main features, some existing tools available for their study, recent probabilistic results, and relations to other well-studied probabilistic models. Along the way we discuss some of the (many) open questions that remain. | math | 1 |
End of preview. Expand
in Dataset Viewer.
Dataset Card for ArxivMIA
To evaluate various pre-training data detection methods in a more challenging scenario, we introduce ArxivMIA, a new benchmark comprising abstracts from the fields of Computer Science (CS) and Mathematics (Math) sourced from Arxiv.
- Repository: https://github.com/zhliu0106/probing-lm-data
- Paper: Probing Language Models for Pre-training Data Detection
- Downloads last month
- 3