Tootfinder

Automorphisms of prime power order of weighted hypersurfaces
Alvaro Liendo, Ana Julisa Palomino
https://arxiv.org/abs/2507.13538 https://

Automorphisms of prime power order of weighted hypersurfaces
We study automorphisms of quasi-smooth hypersurfaces in weighted projective spaces, extending classical results for smooth hypersurfaces in projective space to the weighted setting. We establish effective criteria for when a power of a prime number can occur as the order of an automorphism, and we derive explicit bounds on the possible prime orders. A key role is played by a weighted analogue of the classical Klein hypersurface, which we show realizes the maximal prime order of an automorphism …

On weighted multilinear polynomial averages in finite fields
Guo-Dong Hong
https://arxiv.org/abs/2507.14414 https://arxiv.org/pdf/250…

On weighted multilinear polynomial averages in finite fields
We study the weighted multilinear polynomial averages in finite fields. The essential ingredient is the $u^s$-norm control of the corresponding weighted multilinear polynomial averages in finite fields, which is motivated by Teräväinen \cite{T24}. As an application, we prove an asymptotic formula for the number of the following multidimensional rational function progressions in the subsets of $\mathbb{F}_p^D$: \[ \textbf{x}, \textbf{x}+ P_1(φ(y))v_1,\cdots, \textbf{x}+ P_k(φ(y))v_k, \] wher…

Self-Supervised Joint Reconstruction and Denoising of T2-Weighted PROPELLER MRI of the Lungs at 0.55T
Jingjia Chen, Haoyang Pei, Christoph Maier, Mary Bruno, Qiuting Wen, Seon-Hi Shin, William Moore, Hersh Chandarana, Li Feng
https://arxiv.org/abs/2507.14308

Self-Supervised Joint Reconstruction and Denoising of T2-Weighted PROPELLER MRI of the Lungs at 0.55T
Purpose: This study aims to improve 0.55T T2-weighted PROPELLER lung MRI through a self-supervised joint reconstruction and denoising model. Methods: T2-weighted 0.55T lung MRI dataset including 44 patients with previous covid infection were used. A self-supervised learning framework was developed, where each blade of the PROPELLER acquisition was split along the readout direction into two partitions. One subset trains the unrolled reconstruction network, while the other subset is used for lo…

On Weighted Entropy Generating Function
Smitha S., Mary Andrewsa, Sudheesh K. Kattumannil
https://arxiv.org/abs/2507.15057 https://ar…

On Weighted Entropy Generating Function
In this paper, we study the properties of the weighted entropy generating function (WEGF). We also introduce the weighted residual entropy generating function (WREGF) and establish some characterization results based on its connections with the hazard rate and the mean residual life function. Furthermore, we propose two new classes of life distributions derived from WREGF. We also study the non-parametric estimation of WREGF. A non-parametric test for the Pareto type I distribution is developed…

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

Improved girth approximation in weighted undirected graphs
Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
https://arxiv.org/abs/2507.13869

Improved girth approximation in weighted undirected graphs
Let $G = (V,E,\ell)$ be a $n$-node $m$-edge weighted undirected graph, where $\ell: E \rightarrow (0,\infty)$ is a real \emph{length} function defined on its edges, and let $g$ denote the girth of $G$, i.e., the length of its shortest cycle. We present an algorithm that, for any input, integer $k \geq 1$, in $O(kn^{1+1/k}\log{n} + m(k+\log{n}))$ expected time finds a cycle of length at most $\frac{4k}{3}g$. This algorithm nearly matches a $O(n^{1+1/k}\log{n})$-time algorithm of \cite{KadriaRSWZ…

New curvature characterization for the weighted Sasaki sphere
Pak Tung Ho, Kuang-Ru Wu
https://arxiv.org/abs/2508.15560 https://arxiv.org/pdf/2508.15560

New curvature characterization for the weighted Sasaki sphere
In this paper, we use the shifted cones introduced by Yang and Zhang to classify Sasaki manifolds. This gives a new curvature characterization for the weighted Sasaki sphere.

Weighted finite difference methods for the semiclassical nonlinear Schr\"odinger equation with multiphase oscillatory initial data
Yanyan Shi, Christian Lubich
https://arxiv.org/abs/2508.15683

Weighted finite difference methods for the semiclassical nonlinear Schrödinger equation with multiphase oscillatory initial data
This paper introduces weighted finite difference methods for numerically solving dispersive evolution equations with solutions that are highly oscillatory in both space and time. We consider a semiclassically scaled cubic nonlinear Schrödinger equation with highly oscillatory initial data, first in the single-phase case and then in the general multiphase case. The proposed methods do not need to resolve high-frequency oscillations in both space and time by prohibitively fine grids as would be …

Matrix-Weighted Campanato Spaces: Duality and Calder\'on--Zygmund Operators
Yiqun Chen, Dachun Yang, Wen Yuan
https://arxiv.org/abs/2508.15195 https://…

Matrix-Weighted Campanato Spaces: Duality and Calderón--Zygmund Operators
Let $p\in(0,\infty)$, $q\in[1,\infty)$, $s\in\mathbb Z_+$, and $W$ be an $A_p$-matrix weight, which in the scalar case is exactly a Muckenhoupt $A_{\max\{1,p\}}$ weight. In this article, by using the reducing operators of $W$, we introduce matrix-weighted Campanato spaces $\mathcal L_{p,q,s,W}$. When $p\in(0,1]$, applying the atomic and the finite atomic characterizations of the matrix-weighted Hardy space $H^p_W$, we prove that the dual space of $H^p_W$ is precisely $\mathcal L_{p,q,s,W}$, whi…

Average weighted ratio of consecutive level spacings for infinite-dimensional orthogonal random matrices
Wouter Buijsman
https://arxiv.org/abs/2508.14172 https://

Average weighted ratio of consecutive level spacings for infinite-dimensional orthogonal random matrices
The onset of quantum ergodicity is often quantified by the average ratio of consecutive level spacings. The reference values for ergodic quantum systems have been obtained numerically from the spectra of large but finite-dimensional random matrices. This work introduces a weighted ratio of consecutive level spacings, having the propery that the average can be computed numerically for random matrices of infinite dimension. A Painlevé differential equation is solved numerically in order to deter…

Functional calculus on weighted Sobolev spaces for the Laplacian on rough domains
Nick Lindemulder, Emiel Lorist, Floris Roodenburg, Mark Veraar
https://arxiv.org/abs/2507.13478

Functional calculus on weighted Sobolev spaces for the Laplacian on rough domains
We study the Laplace operator on domains subject to Dirichlet or Neumann boundary conditions. We show that these operators admit a bounded $H^{\infty}$-functional calculus on weighted Sobolev spaces, where the weights are powers of the distance to the boundary. Our analysis applies to bounded $C^{1,λ}$-domains with $λ\in[0,1]$, revealing a crucial trade-off: lower domain regularity can be compensated by enlarging the weight exponent. As a primary consequence, we establish maximal regularity f…

Robust and Smooth Estimation of the Extreme Tail Index via Weighted Minimum Density Power Divergence
Saida Mancer, Abdelhakim Necir, Djamel Meraghni
https://arxiv.org/abs/2507.15744

Robust and Smooth Estimation of the Extreme Tail Index via Weighted Minimum Density Power Divergence
By introducing a weight function into the density power divergence, we develop a new class of robust and smooth estimators for the tail index of Pareto-type distributions, offering improved efficiency in the presence of outliers. These estimators can be viewed as a robust generalization of both weighted least squares and kernel-based tail index estimators. We establish the consistency and asymptotic normality of the proposed class. A simulation study is conducted to assess their finite-sample p…

Weighted Kernel Functions on Planar Domains
Aakanksha Jain, Kaushal Verma
https://arxiv.org/abs/2508.14016 https://arxiv.org/pdf/2508.14016

Weighted Kernel Functions on Planar Domains
We study the variation of weighted Szegő and Garabedian kernels on planar domains as a function of the weight. A Ramadanov type theorem is shown to hold as the weights vary. As a consequence, we derive properties of the zeros of the weighted Szegő and Garabedian kernel for weights close to the constant function $1$ on the boundary. We further study the weighted Ahlfors map and strengthen results concerning its boundary behaviour. Explicit examples of the weighted kernels are presented for cer…

Enhancing POI Recommendation through Global Graph Disentanglement with POI Weighted Module
Pei-Xuan Li, Wei-Yun Liang, Fandel Lin, Hsun-Ping Hsieh
https://arxiv.org/abs/2507.14612

Enhancing POI Recommendation through Global Graph Disentanglement with POI Weighted Module
Next point of interest (POI) recommendation primarily predicts future activities based on users' past check-in data and current status, providing significant value to users and service providers. We observed that the popular check-in times for different POI categories vary. For example, coffee shops are crowded in the afternoon because people like to have coffee to refresh after meals, while bars are busy late at night. However, existing methods rarely explore the relationship between POI categ…

Replaced article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reduc...
Kuan Cheng, Ruiyang Wu

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

Eigenvalue Distribution of Large Weighted Random Sparse Uniform $q$-Hypergraphs
Valentin Vengerovsky
https://arxiv.org/abs/2508.13297 https://arxiv.org/pdf…

Eigenvalue Distribution of Large Weighted Random Sparse Uniform $q$-Hypergraphs
We study eigenvalue distribution of the adjacency matrix $A^{(N,p,q)}$ of weighted random uniform $q$-hypergraphs $Γ= Γ_{N,p,q}$. We assume that the graphs have $N$ vertices and the average number of hyperedges attached to one vertex is $(q-1)!\cdot p$. To each edge of the graph $e_{ij}$ we assign a weight given by a random variable $a_{ij}$ with all moments finite. We consider the moments of normalized eigenvalue counting function $σ_{N,p,q}$ of $A^{(N,p,q)}$. Assuming all moments of $a$ fi…

Correlations of error terms for weighted prime counting functions
Shubhrajit Bhattacharya, Greg Martin, Reginald M. Simpson
https://arxiv.org/abs/2507.13504

Correlations of error terms for weighted prime counting functions
Standard prime-number counting functions, such as $ψ(x)$, $θ(x)$, and $π(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $π_r(x) = \sum_{p\le x} \frac1p$ and $π_\ell(x) = \sum_{p\le x} \log(1-\frac1p)^{-1}$, that were studied by Mertens. These limiting distributions are all identical, but passing to the limit loses information about how these error terms are correlated with one another. In t…

Converting T1-weighted MRI from 3T to 7T quality using deep learning
Malo Gicquel, Ruoyi Zhao, Anika Wuestefeld, Nicola Spotorno, Olof Strandberg, Kalle {\AA}str\"om, Yu Xiao, Laura EM Wisse, Danielle van Westen, Rik Ossenkoppele, Niklas Mattsson-Carlgren, David Berron, Oskar Hansson, Gabrielle Flood, Jacob Vogel
https://ar…

Converting T1-weighted MRI from 3T to 7T quality using deep learning
Ultra-high resolution 7 tesla (7T) magnetic resonance imaging (MRI) provides detailed anatomical views, offering better signal-to-noise ratio, resolution and tissue contrast than 3T MRI, though at the cost of accessibility. We present an advanced deep learning model for synthesizing 7T brain MRI from 3T brain MRI. Paired 7T and 3T T1-weighted images were acquired from 172 participants (124 cognitively unimpaired, 48 impaired) from the Swedish BioFINDER-2 study. To synthesize 7T MRI from 3T imag…

Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Scheduling
Nikolai Antonov, Pr\v{e}mysl \v{S}\r{u}cha, Mikol\'a\v{s} Janota, Jan H\r{u}la
https://arxiv.org/abs/2508.13703

Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Scheduling
Existing research on single-machine scheduling is largely focused on exact algorithms, which perform well on typical instances but can significantly deteriorate on certain regions of the problem space. In contrast, data-driven approaches provide strong and scalable performance when tailored to the structure of specific datasets. Leveraging this idea, we focus on a single-machine scheduling problem where each job is defined by its weight, duration, due date, and deadline, aiming to minimize the …

Weighted First Order Model Counting for Two-variable Logic with Axioms on Two Relations
Qipeng Kuang, V\'aclav K\r{u}la, Ond\v{r}ej Ku\v{z}elka, Yuanhong Wang, Yuyi Wang
https://arxiv.org/abs/2508.11515

Weighted First Order Model Counting for Two-variable Logic with Axioms on Two Relations
The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. The boundary between fragments for which WFOMC can be computed in polynomial time relative to the domain size lies between the two-variable fragment ($\text{FO}^2$) and the three-variable fragment ($\text{FO}^3$). It is known that WFOMC for \FOthree{} is $\mathsf{\#P_1}$-hard while polynomial-time algorithms exist for computing WFOMC for $…

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
Zolt\'an F\"ul\"op, Heiko Vogler
https://arxiv.org/abs/2509.14914

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality of syntactic vector spaces. Here we prove a characterization of bottom-up deterministically recognizable weighted tree languages over commutative semifields in terms of the requirement that the respective m-syntactic scalar algebras are finitely generated. The concept of scalar algebra is introduced in this paper; it…

Toeplitz operators and weighted composition operators on variable exponent Bergman spaces
Cezhong Tong, Zicong Yang, Zehua Zhou
https://arxiv.org/abs/2507.13675

Toeplitz operators and weighted composition operators on variable exponent Bergman spaces
In a recent paper [JFA, 278 (2020), 108401], Choe et al. obtained characterizations for bounded and compact differences of two weighted composition operators acting on standard weighted Bergman spaces over the unit disk in terms of Carleson measures. Then they extended the results to the ball setting. In this paper, we further generalize those results to variable exponent Bergman spaces over the unit ball. Our proofs, when restricted to the case of constant variable, are new and simpler. Moreov…

game_thrones: Game of Thrones coappearances
Network of coappearances of characters in the Game of Thrones series, by George R. R. Martin, and in particular coappearances in the book "A Storm of Swords." Nodes are unique characters, and edges are weighted by the number of times the two characters' names appeared within 15 words of each other in the text.
This network has 107 nodes and 352 edges.
Tags: Social, Fictional, Weighted

DiffPF: Differentiable Particle Filtering with Generative Sampling via Conditional Diffusion Models
Ziyu Wan, Lin Zhao
https://arxiv.org/abs/2507.15716 htt…

DiffPF: Differentiable Particle Filtering with Generative Sampling via Conditional Diffusion Models
This paper proposes DiffPF, a differentiable particle filter that leverages diffusion models for state estimation in dynamic systems. Unlike conventional differentiable particle filters, which require importance weighting and typically rely on predefined or low-capacity proposal distributions. DiffPF learns a flexible posterior sampler by conditioning a diffusion model on predicted particles and the current observation. This enables accurate, equally-weighted sampling from complex, high-dimensi…

Weighted Matching in a Poly-Streaming Model
Ahammed Ullah, S. M. Ferdous, Alex Pothen
https://arxiv.org/abs/2507.14114 https://arxiv.…

Weighted Matching in a Poly-Streaming Model
We introduce the poly-streaming model, a generalization of streaming models of computation in which $k$ processors process $k$ data streams containing a total of $N$ items. The algorithm is allowed $O\left(f(k)\cdot M_1\right)$ space, where $M_1$ is either $o\left(N\right)$ or the space bound for a sequential streaming algorithm. Processors may communicate as needed. Algorithms are assessed by the number of passes, per-item processing time, total runtime, space usage, communication cost, and so…

Non-existence of negative derivations on the higher Nash blowup local algebra
W\'agner Badilla-C\'espedes, Abel Castorena, Daniel Duarte, Luis N\'u\~nez-Betancourt
https://arxiv.org/abs/2508.14353

Non-existence of negative derivations on the higher Nash blowup local algebra
Let $f\in\mathbb{C}[x_1,\ldots,x_s]$ be a weighted homogeneous polynomial having an isolated singularity and $\mathcal{T}_n(f)$ be its higher Nash blowup local algebra. We show that $\mathcal{T}_n(f)$ does not admit negative weighted derivations for $n\geq2$. This answers affirmatively a conjecture of Hussain-Ma-Yau-Zuo.

Large-dimensional Factor Analysis with Weighted PCA
Zhongyuan Lyu, Ming Yuan
https://arxiv.org/abs/2508.15675 https://arxiv.org/pdf/2508.15675

Large-dimensional Factor Analysis with Weighted PCA
Principal component analysis (PCA) is arguably the most widely used approach for large-dimensional factor analysis. While it is effective when the factors are sufficiently strong, it can be inconsistent when the factors are weak and/or the noise has complex dependence structure. We argue that the inconsistency often stems from bias and introduce a general approach to restore consistency. Specifically, we propose a general weighting scheme for PCA and show that with a suitable choice of weightin…

Moments and the Basic Equilibrium Equations
Eduardo S. G. Leandro
https://arxiv.org/abs/2507.13865 https://arxiv.org/pdf/2507.13865…

Moments and the Basic Equilibrium Equations
We develop the classical theory of moments of configurations of weighted points with a focus on systems with an identically vanishing first moment. The latter condition provides equations for equilibrium configurations of systems of interacting particles under the sole condition that interactions are pairwise and along the line determined by each pair of particles. Complying external forces are admitted, so some dynamical equilibrium configurations, such as relative equilibria, may be treated w…

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
Deijany Rodriguez Linares, Oksana Moryakova, H{\aa}kan Johansson
https://arxiv.org/abs/2509.15069

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
This letter presents a novel approach for \mbox{efficiently} computing time-index powered weighted sums of the form $\sum_{n=0}^{N-1} n^{K} v[n]$ using cascaded accumulators. Traditional direct computation requires $K{\times}N$ general multiplications, which become prohibitive for large $N$, while alternative strategies based on lookup tables or signal reversal require storing entire data blocks. By exploiting accumulator properties, the proposed method eliminates the need for such storage and …

Proof of a Generalized Ryu-Takayanagi Conjecture
Artem Averin
https://arxiv.org/abs/2508.14877 https://arxiv.org/pdf/2508.14877

Proof of a Generalized Ryu-Takayanagi Conjecture
We derive a generalized version of the Ryu-Takayanagi formula for the entanglement entropy in arbitrary diffeomorphism invariant field theories. We use a recent framework which expresses the measurable quantities of a quantum theory as a weighted sum over paths in the theory's phase space. If this framework is applied to a field theory on a spacetime foliated by a hypersurface $Σ,$ the choice of a codimension-2 surface $B$ without boundary contained in $Σ$ specifies a submanifold in the phase…

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
Rachana Gusain, Saladi Rahul, Aditya Subramanian
https://arxiv.org/abs/2509.16008 https://

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
We revisit the maximum range sum (MaxRS) problem: given a set $P$ of $n$ weighted points in $\mathbb{R}^d$ and a range $Q$ (typically axis-aligned $d$-box or $d$-ball), the goal is to place $Q$ to maximize the total weight of points in $P\cap Q$. We study three natural variations: (1) Dynamic MaxRS: The goal is to update the placement of a $d$-ball under point insertions and deletions. We give a randomized $(\frac{1}{2}-ε)$-approximation with update time $O_ε(\log n)$. The approximation fac…

Componentwise linearity of powers of edge ideals of weighted oriented graphs
Manohar Kumar, Joydip Mondal, Ramakrishna Nanduri
https://arxiv.org/abs/2509.14637 https://

Componentwise linearity of powers of edge ideals of weighted oriented graphs
In this paper, we study the componentwise linearity of powers of edge ideal of a weighted oriented graph $D$. We give a characterization for componentwise linearity of the edge ideal $I(D)$ in terms of forbidden subgraphs of $D$. If $D$ is house-free or complete $r$-partite, then the following statements are equivalent: (1) $I(D)$ is componentwise linear; (2) $I(D)$ is vertex splittable; (3) $I(D)$ has linear quotient property; (4) both $G$ and $H(I(D)_{(2)})$ are co-chordal and $D_1,D_2,D_3,D…

XAI-Driven Spectral Analysis of Cough Sounds for Respiratory Disease Characterization
Patricia Amado-Caballero, Luis Miguel San-Jos\'e-Revuelta, Mar\'ia Dolores Aguilar-Garc\'ia, Jos\'e Ram\'on Garmendia-Leiza, Carlos Alberola-L\'opez, Pablo Casaseca-de-la-Higuera
https://arxiv.org/abs/2508.14949

XAI-Driven Spectral Analysis of Cough Sounds for Respiratory Disease Characterization
This paper proposes an eXplainable Artificial Intelligence (XAI)-driven methodology to enhance the understanding of cough sound analysis for respiratory disease management. We employ occlusion maps to highlight relevant spectral regions in cough spectrograms processed by a Convolutional Neural Network (CNN). Subsequently, spectral analysis of spectrograms weighted by these occlusion maps reveals significant differences between disease groups, particularly in patients with COPD, where cough patt…

Resource-Splitting Games with Tullock-Based Lossy Contests
Marko Maljkovic, Gustav Nilsson, Nikolas Geroliminis
https://arxiv.org/abs/2507.13853 https://…

Resource-Splitting Games with Tullock-Based Lossy Contests
This paper introduces a novel class of multi-stage resource allocation games that model real-world scenarios in which profitability depends on the balance between supply and demand, and where higher resource investment leads to greater returns. Our proposed framework, which incorporates the notion of profit loss due to insufficient player participation, gives rise to a Tullock-like functional form of the stage payoff structure when weighted fair proportional resource allocation is applied. We e…

Spectral Surgery in a Heat Bath: a finite-temperature guide to particle production for phenomenologists
Nirmalya Brahma, Saniya Heeba, Hugo Sch\'erer, Katelin Schutz
https://arxiv.org/abs/2507.14277

Spectral Surgery in a Heat Bath: a finite-temperature guide to particle production for phenomenologists
Quantifying the effects of finite temperature and density (FTD) on particle properties is essential for understanding phenomena within and beyond the Standard Model. In this work, we present a simplified framework for calculating particle production rates at FTD without resorting to a full thermal field theory calculation. We do so by relating the imaginary part of a particle's $n$-loop finite temperature self energy, which defines its in-medium damping rate, to a sum of thermally weighted tree…

SWA-PF: Semantic-Weighted Adaptive Particle Filter for Memory-Efficient 4-DoF UAV Localization in GNSS-Denied Environments
Jiayu Yuan, Ming Dai, Enhui Zheng, Chao Su, Nanxing Chen, Qiming Hu, Shibo Zhu, Yibin Cao
https://arxiv.org/abs/2509.13795

SWA-PF: Semantic-Weighted Adaptive Particle Filter for Memory-Efficient 4-DoF UAV Localization in GNSS-Denied Environments
Vision-based Unmanned Aerial Vehicle (UAV) localization systems have been extensively investigated for Global Navigation Satellite System (GNSS)-denied environments. However, existing retrieval-based approaches face limitations in dataset availability and persistent challenges including suboptimal real-time performance, environmental sensitivity, and limited generalization capability, particularly in dynamic or temporally varying environments. To overcome these limitations, we present a large-s…

On the Yau-Tian-Donaldson conjecture for weighted cscK metrics
S\'ebastien Boucksom, Mattias Jonsson
https://arxiv.org/abs/2509.15016 https://arxiv.org…

On the Yau-Tian-Donaldson conjecture for weighted cscK metrics
We establish a version, formulated in terms of non-Archimedean pluripotential theory, of the Yau-Tian-Donaldson conjecture for constant scalar curvature and, more generally, weighted extremal Kähler metrics with prescribed compact symmetry group on an arbitrary polarized projective manifold. This is accomplished by extending important previous work of Chi Li to the weighted case, and by establishing general slope formulas for the relevant weighted entropy and energy functionals. Among other th…

Graded Quantum Codes: From Weighted Algebraic Geometry to Homological Chain Complexes
Tony Shaska
https://arxiv.org/abs/2508.07542 https://arxiv.org/pdf/25…

Graded Quantum Codes: From Weighted Algebraic Geometry to Homological Chain Complexes
We introduce graded quantum codes, unifying two classes of quantum error-correcting codes. The first, quantum weighted algebraic geometry (AG) codes, derives from rational points on hypersurfaces in weighted projective spaces over finite fields. This extends classical AG codes by adding weighted degrees and singularities, enabling self-orthogonal codes via the CSS method with improved distances using algebraic structures and invariants like weighted heights.The second class arises from chain co…

Crosslisted article(s) found for econ.EM. https://arxiv.org/list/econ.EM/new
[1/1]:
- Large-dimensional Factor Analysis with Weighted PCA
Zhongyuan Lyu, Ming Yuan

Deep BSDE Solver on Bounded Domains Part I: General Loss Rate
Maximilian W\"urschmidt (Trier University)
https://arxiv.org/abs/2508.14215 https://arxi…

Deep BSDE Solver on Bounded Domains Part I: General Loss Rate
We consider a ramification of the deep BSDE loss functional designed to apply for BSDEs on bounded domains, i.e. with random (unbounded) time horizons. We derive a general convergence rate of the loss functional; precisely for a class of (randomly) weighted modifications of the functional. The rate is expressed in terms of the underlying discrete-time stepsize and a universal approximation distance.

Fractional-order controller tuning via minimization of integral of time-weighted absolute error without multiple closed-loop tests
Ansei Yonezawa, Heisei Yonezawa, Shuichi Yahagi, Itsuro Kajiwara, Shinya Kijimoto
https://arxiv.org/abs/2507.12987

Fractional-order controller tuning via minimization of integral of time-weighted absolute error without multiple closed-loop tests
This study presents a non-iterative tuning technique for a linear fractional-order (FO) controller, based on the integral of the time-weighted absolute error (ITAE) criterion. Minimizing the ITAE is a traditional approach for tuning FO controllers. This technique reduces the over/undershoot and suppresses the steady-state error. In contrast to conventional approaches of ITAE-based controller tuning, the proposed approach does not require multiple closed-loop experiments or model-based simulatio…

Addressing Data Imbalance in Transformer-Based Multi-Label Emotion Detection with Weighted Loss
Xia Cui
https://arxiv.org/abs/2507.11384 https://

Addressing Data Imbalance in Transformer-Based Multi-Label Emotion Detection with Weighted Loss
This paper explores the application of a simple weighted loss function to Transformer-based models for multi-label emotion detection in SemEval-2025 Shared Task 11. Our approach addresses data imbalance by dynamically adjusting class weights, thereby enhancing performance on minority emotion classes without the computational burden of traditional resampling methods. We evaluate BERT, RoBERTa, and BART on the BRIGHTER dataset, using evaluation metrics such as Micro F1, Macro F1, ROC-AUC, Accurac…

Enhancing OHLC Data with Timing Features: A Machine Learning Evaluation
Ruslan Tepelyan
https://arxiv.org/abs/2509.16137 https://arxiv.org/pdf/2509.16137…

Enhancing OHLC Data with Timing Features: A Machine Learning Evaluation
OHLC bar data is a widely used format for representing financial asset prices over time due to its balance of simplicity and informativeness. Bloomberg has recently introduced a new bar data product that includes additional timing information-specifically, the timestamps of the open, high, low, and close prices within each bar. In this paper, we investigate the impact of incorporating this timing data into machine learning models for predicting volume-weighted average price (VWAP). Our experime…

Just out of curiosity, I also compared {geosareal} prototype package ( https://github.com/e-kotov/r-geos-areal-weighted-interpolation-prototype ) suggested by @…

GitHub - e-kotov/r-geos-areal-weighted-interpolation-prototype
Contribute to e-kotov/r-geos-areal-weighted-interpolation-prototype development by creating an account on GitHub.

Fast Algorithms for Graph Arboricity and Related Problems
Ruoxu Cen, Henry Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi
https://arxiv.org/abs/2507.15598

Fast Algorithms for Graph Arboricity and Related Problems
We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of $\tilde{O}(nm)$ for weighted graphs and $\tilde{O}(m^{3/2}) $ for unweighted graphs (Gabow 1995) for this problem. The running time of our algorithm is dominated by a logarithmic number of calls to a directed global minimum cut subroutine -- if the running t…

new_zealand_collab: New Zealand scientific collaborations (2015)
A network of scientific collaborations among institutions in New Zealand. Nodes are institutions (universities, organizations, etc.), and two nodes i,j are connected if Scopus lists at least one publication with authors at institutions i and j, in the period 2010-2015. Edges are weighted by the number of such collaborations. Nodes are annotated with the categorical type of institution.
This network has 1511 nodes an…

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
Dominik Gei{\ss}ler, Tobias Winkler
https://arxiv.org/abs/2509.15074 https://arxiv…

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
In probabilistic programming, the inference problem asks to determine a program's posterior distribution conditioned on its "observe" instructions. Inference is challenging, especially when exact rather than approximate results are required. Inspired by recent work on probability generating functions (PGFs), we propose encoding distributions on $\mathbb{N}^k$ as weighted automata over a commutative alphabet with $k$ symbols. Based on this, we map the semantics of various imperative programming …

Domino tilings, nonintersecting lattice paths and subclasses of Koutschan-Krattenthaler-Schlosser determinants
Qipin Chen, Shane Chern, Atsuro Yoshida
https://arxiv.org/abs/2507.15665

Domino tilings, nonintersecting lattice paths and subclasses of Koutschan-Krattenthaler-Schlosser determinants
Koutschan, Krattenthaler and Schlosser recently considered a family of binomial determinants. In this work, we give combinatorial interpretations of two subclasses of these determinants in terms of domino tilings and nonintersecting lattice paths, thereby partially answering a question of theirs. Furthermore, the determinant evaluations established by Koutschan, Krattenthaler and Schlosser produce many product formulas for our weighted enumerations of domino tilings and nonintersecting lattice …

Crosslisted article(s) found for math-ph. https://arxiv.org/list/math-ph/new
[1/1]:
- Average weighted ratio of consecutive level spacings for infinite-dimensional orthogonal random m...
Wouter Buijsman

Toward Practical Fluid Antenna Systems: Co-Optimizing Hardware and Software for Port Selection and Beamforming
Sai Xu, Kai-Kit Wong, Yanan Du, Hanjiang Hong, Chan-Byoung Chae, Baiyang Liu, Kin-Fai Tong
https://arxiv.org/abs/2507.14035

Toward Practical Fluid Antenna Systems: Co-Optimizing Hardware and Software for Port Selection and Beamforming
This paper proposes a hardware-software co-design approach to efficiently optimize beamforming and port selection in fluid antenna systems (FASs). To begin with, a fluid-antenna (FA)-enabled downlink multi-cell multiple-input multiple-output (MIMO) network is modeled, and a weighted sum-rate (WSR) maximization problem is formulated. Second, a method that integrates graph neural networks (GNNs) with random port selection (RPS) is proposed to jointly optimize beamforming and port selection, while…

Subsolution theorem in weighted energy classes of $m$-subharmonic functions with given boundary value
Nguyen Van Phu
https://arxiv.org/abs/2508.11821 https://

Subsolution theorem in weighted energy classes of $m$-subharmonic functions with given boundary value
In this paper, we concern with the existence of solutions of the weighted complex $m$-Hessian equation $-χ(u)H_{m}(u)=μ$ in the class $\mathcal{E}_{m,χ}(f,Ω)$ if there exists subsolution in this class, where the given boundary value $f\in\mathcal{E}_m(Ω)\cap MSH_m(\Om).$ This is a generalization of the result in the paper \cite{PDtaiwan} where we proved that the subsolution theorem is true in the class $\mathcal{E}_{m,χ}(f,Ω)$ in the case when the given boundary value $f\in\mathcal{N}_m(…

A survey on birational Rigidity of threefold Weighted Complete Intersections
Tiago Duarte Guerreiro, Takuzo Okada
https://arxiv.org/abs/2508.13025 https://…

A survey on birational Rigidity of threefold Weighted Complete Intersections
We survey what is known about Fano threefold weighted complete intersections from the point of view of birational rigidity.

game_thrones: Game of Thrones coappearances
Network of coappearances of characters in the Game of Thrones series, by George R. R. Martin, and in particular coappearances in the book "A Storm of Swords." Nodes are unique characters, and edges are weighted by the number of times the two characters' names appeared within 15 words of each other in the text.
This network has 107 nodes and 352 edges.
Tags: Social, Fictional, Weighted

Global Synchronization in Matrix-Weighted Networks
Anna Gallo, Yu Tian, Renaud Lambiotte, Timoteo Carletti
https://arxiv.org/abs/2507.12322 https://…

Global Synchronization in Matrix-Weighted Networks
Synchronization phenomena in complex systems are fundamental to understanding collective behavior across disciplines. While classical approaches model such systems by using scalar-weighted networks and simple diffusive couplings, many real-world interactions are inherently multidimensional and transformative. To address this limitation, Matrix-Weighted Networks (MWNs) have been introduced as a versatile framework where edges are associated with matrix weights that encode both interaction streng…

Rate doubly robust estimation for weighted average treatment effects
Yiming Wang, Yi Liu, Shu Yang
https://arxiv.org/abs/2509.14502 https://arxiv.org/pdf/2…

Rate doubly robust estimation for weighted average treatment effects
The weighted average treatment effect (WATE) defines a versatile class of causal estimands for populations characterized by propensity score weights, including the average treatment effect (ATE), treatment effect on the treated (ATT), on controls (ATC), and for the overlap population (ATO). WATE has broad applicability in social and medical research, as many datasets from these fields align with its framework. However, the literature lacks a systematic investigation into the robustness and effi…

A Weighted Sampling Method for Inverse Medium Problem with Limited Aperture
Fuqun Han, Kazufumi Ito
https://arxiv.org/abs/2509.14580 https://arxiv.org/pdf/…

A Weighted Sampling Method for Inverse Medium Problem with Limited Aperture
Inverse medium scattering problems arise in many applications, but in practice, the measurement data are often restricted to a limited aperture by physical or experimental constraints. Classical sampling methods, such as MUSIC and the linear sampling method, are well understood for full-aperture data, yet their performance deteriorates severely under limited-aperture conditions, especially in the presence of noise. We propose a new sampling method tailored to the inverse medium problem with lim…

New weighted Riesz-type pointwise inequalities and applications to generalized Sobolev estimates
Diego Chamorro (LaMME), Anca-Nicoleta Marcoci, Liviu-Gabriel Marcoci
https://arxiv.org/abs/2508.12771

New weighted Riesz-type pointwise inequalities and applications to generalized Sobolev estimates
In this article we study some new pointwise inequalities between rough singular integral operators and weighted Riesz-type operators. We will thus obtain a wider class of subrepresentation formulas that will lead us to new weighted Sobolev-type inequalities.

Blow up results and lifespan estimates for nonlinear damped wave equations on weighted graphs
Tuan Anh Dao, Anh Tuan Duong
https://arxiv.org/abs/2509.14767 https://

Blow up results and lifespan estimates for nonlinear damped wave equations on weighted graphs
In this article, we are interested in studying the Cauchy problems for nonlinear damped wave equations and their systems on a weighted graph. Our main purpose is two-fold, namely, under certain conditions for volume growth of a ball and the initial data we would like to not only prove nonexistence of global (in time) weak solutions but also indicate lifespan estimates for local (in time) weak solutions when a blow-up phenomenon in finite time occurs. Throughout the present paper, we will partia…

The inverse of the (alternating) infinite sum of the reciprocal of the weighted sum for generalized Fibonacci sub-sequences
Yongkang Wan, Zhonghao Liang, Qunying Liao
https://arxiv.org/abs/2509.14569

The inverse of the (alternating) infinite sum of the reciprocal of the weighted sum for generalized Fibonacci sub-sequences
In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of $\left(\sum\limits_{k=n}^{\infty}\frac{1}{\sum\limits_{i=0}^{t}s_{i}W_{mk+l_i}}\right)^{-1}$ and $\left(\sum\limits_{k=n}^{\infty}\frac{\left(-1\right)^k}{\sum\limits_{i=0}^{t}s_{i}W_{mk+l_i}}\right)^{-1}$, respectively. In particular, for some special $a,b,p,q,m,t,s_i$ and $l_i\left(0\leq i\leq t \right)$, Theore…

Sampling tree-weighted partitions without sampling trees
Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz
https://arxiv.org/abs/2508.11130 https://arxiv.org…

Sampling tree-weighted partitions without sampling trees
This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on $k$-partitions of a graph weights $k$-partitions proportional to the product of the number of spanning trees of each partition class. Recent work on problems in computational redistricting analysis has driven special interest in the conditional distribution where all partition classes have the same size (balanced partitions). One class of Markov c…

On Multiplicative Weightings for Lie Groupoids and Lie Algebroids
Daniel Hudson
https://arxiv.org/abs/2508.10276 https://arxiv.org/pdf/2508.10276

On Multiplicative Weightings for Lie Groupoids and Lie Algebroids
We present a thorough study of the differential geometry of weightings and develop the theory of weightings for vector bundles, Lie groupoids, and Lie algebroids. We begin by extending the work of Loizides and Meinrenken on weighted manifolds. We define weighted submanifolds, weighted immersions, and weighted embeddings, and prove normal form theorems for these objects. We also study characterizations of weighted morphisms in terms of their graphs and in terms of weighted paths. We further ex…

On matrix weighted Bourgain-Morrey Triebel-Lizorkin spaces
Tengfei Bai, Pengfei Guo, Jingshi Xu
https://arxiv.org/abs/2508.11981 https://arxiv.org/pdf/2508…

On matrix weighted Bourgain-Morrey Triebel-Lizorkin spaces
We introduce the homogeneous (inhomogeneous) matrix weighted Bourgain-Morrey Triebel-Lizorkin spaces and obtain equivalent norms of these spaces. We also obtain their characterizations by Peetre type maximal functions, Lusin-area function, Littlewood-Paley $g_λ^{*}$-function, approximation, wavelet and atom. As an application, we obtain boundedness of pseudo-differential operators with symbols in the Hörmander classes and Hölder-Zygmund classes on inhomogeneous matrix weighted Bourgain-Morre…

celegansneural: C. elegans neurons (1986)
A network representing the neural connections of the Caenorhabditis elegans nematode.
This network has 297 nodes and 2359 edges.
Tags: Biological, Connectome, Weighted
https://networks.skewed.de/net/celegansneural
Rid…

On completeness of modified wave operators for defocusing NLS
Vladimir Georgiev, Tohru Ozawa
https://arxiv.org/abs/2509.15921 https://arxiv.org/pdf/2509.15…

On completeness of modified wave operators for defocusing NLS
In this manuscript, we study modified scattering for the nonlinear defocusing Schrödinger equation with a critical gauge-invariant nonlinearity of order 1+2/n. We address the following question: Given initial data in an appropriate weighted Sobolev space, what is the leading term in the asymptotic behavior of the solution as times goes to infinity? More precisely, we seek a final state in a space of type similar to the space of the initial data such that the leading term is represented by th…

Essential norm and Schatten class of Hankel operators between weighted Fock spaces
Yi Liu, Yufeng Lu
https://arxiv.org/abs/2508.11882 https://arxiv.org/pdf…

Essential norm and Schatten class of Hankel operators between weighted Fock spaces
In this paper, we characterize the essential norm of Hankel operators from a weighted Fock space $F_φ^{p}$ to a weighted Lebesgue space $L_φ^{q}$ for all $1 \leq p, q < \infty$. Additionally, we characterize the Schatten-$h$ class membership for Hankel operators acting from $F_φ^{2}$ to $L_φ^{2}$, where the class is defined by a continuous increasing convex function $h$.

sp_office: Workplace contacts (2013)
A temporal network of contacts between individuals, measured in an office building in France, from June 24 to July 3, 2013.
This network has 92 nodes and 9827 edges.
Tags: Social, Offline, Weighted, Temporal, Metadata
https://networks.skewed.de/net/sp_offi

New Algorithms for #2-SAT and #3-SAT
Junqiang Peng, Zimo Sheng, Mingyu Xiao
https://arxiv.org/abs/2507.14504 https://arxiv.org/pdf/25…

New Algorithms for #2-SAT and #3-SAT
The #2-SAT and #3-SAT problems involve counting the number of satisfying assignments (also called models) for instances of 2-SAT and 3-SAT, respectively. In 2010, Zhou et al. proposed an $\mathcal{O}^*(1.1892^m)$-time algorithm for #2-SAT and an efficient approach for #3-SAT, where $m$ denotes the number of clauses. In this paper, we show that the weighted versions of #2-SAT and #3-SAT can be solved in $\mathcal{O}^*(1.1082^m)$ and $\mathcal{O}^*(1.4423^m)$ time, respectively. These results dir…

plant_pol_kato: Kato plant-pollinator web
A bipartite network of plants and pollinators from Kyoto University Forest of Ashu, Japan, from 1984 to 1987. Edge weights represent frequency of interactions.
This network has 772 nodes and 1206 edges.
Tags: Biological, Food web, Weighted
https://networks.skewed.d…

Infinitely many solutions for $(p,q)$-Schr\"odinger-Poisson system with concave and convex nonlinearities
Yao Du, Jiahao Peng
https://arxiv.org/abs/2509.15903 https://

Infinitely many solutions for $(p,q)$-Schrödinger-Poisson system with concave and convex nonlinearities
In this paper, we obtain infinitely many solutions for a class of quasilinear Schrödinger-Poisson system which is coupled by a Schrödinger equation of $p$-Laplacian and a Poisson equation of $q$-Laplacian, involving with concave and convex nonlinearities and indefinite weighted functions.

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
Adithya Bijoy, Ankit Mondal, Ashish Chiplunkar
https://arxiv.org/abs/2507.12130 https://

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
The weighted $k$-server is a variant of the $k$-server problem, where the cost of moving a server is the server's weight times the distance through which it moves. The problem is famous for its intriguing properties and for evading standard techniques for designing and analyzing online algorithms. Even on uniform metric spaces with sufficiently many points, the deterministic competitive ratio of weighted $k$-server is known to increase doubly exponentially with respect to $k$, while the behavio…

Optimal boundary regularity for mixed local and nonlocal equations
Nicola Abatangelo, Elisa Affili, Matteo Cozzi
https://arxiv.org/abs/2507.13711 https://

Optimal boundary regularity for mixed local and nonlocal equations
We provide sharp boundary regularity estimates for solutions to elliptic equations driven by an integro-differential operator obtained as the sum of a Laplacian with a nonlocal operator generalizing a fractional Laplacian. Our approach makes use of weighted Hölder spaces as well as regularity estimates for the Laplacian in this context and a fixed-point argument. We show the optimality of the obtained estimates by means of a counterexample that we have striven to keep as explicit as possib…

wiki_article_words: Wikipedia article-words (en) (2010)
A bipartite network of English Wikipedia articles and the words they contain. The edge weight gives the number of times a word appeared in the connected article.
This network has 276739 nodes and 2941902 edges.
Tags: Informational, Language, Weighted
https://

Dunkl-Hausdorff operator on weighted Orlicz spaces
Megha Madan, Arun Pal Singh, Monika Singh
https://arxiv.org/abs/2508.12331 https://arxiv.org/pdf/2508.12…

Dunkl-Hausdorff operator on weighted Orlicz spaces
We characterize the modular and norm inequalities for the Dunkl-Hausdorff operator defined on non-negative non-increasing functions in the framework of the weighted Orlicz spaces.

cattle: Dairy cattle (1955)
Dominance interactions among a group of dairy cattle at the Iberia Livestock Experiment Station in Jenerette, Louisiana. Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 28 nodes and 217 edges.
Tags: Social, Animal, Weighted
https://ne…

On the extremal functions of second order uncertainty principles: symmetry and symmetry breaking
Xiao-Ping Chen, Chun-Lei Tang
https://arxiv.org/abs/2508.15221 https://

On the extremal functions of second order uncertainty principles: symmetry and symmetry breaking
This paper focus on the symmetry and symmetry breaking about the second order Hydrogen Uncertainty Principle. \emph{Firstly}, by choosing a suitable test function, we give a negative answer to the conjecture presented by Cazacu, Flynn and Lam in [\emph{J. Funct. Anal.} \textbf{283} (2022), Paper No. 109659, 37 pp] for $N\in\{2,3\}$, and emphasizing the symmetry breaking phenomenon. \emph{Secondly}, we obtain a family of sharp weighted second order Hydrogen Uncertainty Principle, and prove the e…

rhesus_monkey: Rhesus monkey grooming (1963)
Grooming interactions among a group of wild adult rhesus monkeys (Macaca mulatta) in Cayo Santiago, during a two month period in 1963. Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 16 nodes and 111 edges.
Tags: Social, Animal, Weighted

rhesus_monkey: Rhesus monkey grooming (1963)
Grooming interactions among a group of wild adult rhesus monkeys (Macaca mulatta) in Cayo Santiago, during a two month period in 1963. Edge weights represent the frequency of interaction. The two versions below are equivalent.
This network has 16 nodes and 111 edges.
Tags: Social, Animal, Weighted

fao_trade: FAO Multiplex Trade Network
Multiplex network representing trade relationships between countries from the Food and Agricultural Organization of the United Nations. Countries are nodes and edge types represent import/export of varying products. Data hosted by Manlio De Domenico.
This network has 214 nodes and 318346 edges.
Tags: Economic, Trade, Weighted, Multilayer

libimseti: Libimseti.cz social network (2012)
A network of ratings given between users at Libimseti.cz, a Czech online dating website. A directed edge (i,j) means that user i rate user j, and the corresponding edge weight is the given rating, on a scale of 1-10.
This network has 220970 nodes and 17359346 edges.
Tags: Social, Online, Weighted

moreno_sheep: Bighorn sheep (1984)
Dominance interactions among a group of female bighorn sheep (Ovis canadensis) from the National Bison Range in western Montana USA, over a 27 month period ending in 1984. Edge weights represent the frequency of interaction. Metadata gives the sheep ages, roughly.
This network has 28 nodes and 250 edges.
Tags: Social, Animal, Weighted, Metadata

bible_nouns: Bible noun phrases
A network of noun phrases (places and names) in the King James Version of the Bible. Each node is a noun phrase, and an edge exists if the noun phrases co-occur in a Bible verse. Edge weight denotes how often the two words co-occur.
This network has 1773 nodes and 9131 edges.
Tags: Informational, Language, Weighted

bitcoin_trust: Bitcoin OTC trust network (2017)
A network of who-trusts-whom relationships among users of the Bitcoin OTC platform. Each directed edge (i,j,w) represents the rating of user j by user i, in which i assigns j a weight w on a scale of -10 (total distrust) to 10 (total trust) in steps of 1.
This network has 5881 nodes and 35592 edges.
Tags: Social, Online, Weighted, Signed, Timestamps

twitter_higgs: Twitter, Higgs boson (2012)
Data on tweets related to the announcement of the discovery of a new fundamental particle with the features of the Higgs boson on 4th July 2012. Data covers 1-7 July 2012, and includes four types of networks: followers, retweets, replies, and mentions.
This network has 38918 nodes and 32523 edges.
Tags: Social, Online, Weighted, Multilayer

blumenau_drug: Blumenau drug interactions (2019)
A network of drug-drug interactions, extracted from 18 months of electronic health records (EHRs) from the city of Blumenau in Southern Brazil. Nodes are annotated with drug information (separate file), and edges are weighted by the severity of the interaction, along with other information.
This network has 75 nodes and 181 edges.
Tags: Biological, Drug interactions, Weighted, Metadata

celegans_2019: Complete C. elegans neurons (2019)
Networks among neurons of both the adult male and adult hermaphrodite worms C. elegans, constructed from electron microscopy series, to include directed edges (chemical) and undirected (gap junction), and spanning including nodes for muscle and non-muscle end organs.
This network has 585 nodes and 1755 edges.
Tags: Biological, Connectome, Weighted

baseball: Baseball steroid use (2008)
Two networks representing steroid use among baseball players. First, a bipartite network of players and their steroid providers (of illegal performance-enhancing substances). Second, a one-mode projection of players, which are linked if they have a common supplier.
This network has 72 nodes and 1089 edges.
Tags: Social, Offline, Weighted, Projection

eu_procurements_alt: EU national procurement networks (2008-2016)
These 234 networks represent the annual national public procurement markets of 26 European countries from 2008-2016, inclusive. Data is sourced from Tenders Electronic Daily (TED), the official procurement portal of the European Union.
This network has 2148 nodes and 2339 edges.
Tags: Economic, Commerce, Weighted, Temporal

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

residence_hall: ANU Residence Hall network
A network of friendships among students living in a residence hall at Australian National University (date unknown). Edge direction indicates that resident i named resident j as a friend, and edge weight indicates the level of friendship: 5 (best friend), 4 (close friend), 3 (friend), 2, 1.
This network has 217 nodes and 2672 edges.
Tags: Social, Offline, Weighted

fly_hemibrain: Fly hemibrain (2020)
A synaptic map of the hemibrain connectome of fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using EM reconstruction techniques. Neurons are labeled by their type. Edges are annotated by the connection strength between the neurons.
This network has 21739 nodes and 4259624 edges.
Tags: Biological, Connectome, Weighted, Metadata

fly_hemibrain: Fly hemibrain (2020)
A synaptic map of the hemibrain connectome of fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using EM reconstruction techniques. Neurons are labeled by their type. Edges are annotated by the connection strength between the neurons.
This network has 21739 nodes and 4259624 edges.
Tags: Biological, Connectome, Weighted, Metadata

new_zealand_collab: New Zealand scientific collaborations (2015)
A network of scientific collaborations among institutions in New Zealand. Nodes are institutions (universities, organizations, etc.), and two nodes i,j are connected if Scopus lists at least one publication with authors at institutions i and j, in the period 2010-2015. Edges are weighted by the number of such collaborations. Nodes are annotated with the categorical type of institution.
This network has 1511 nodes an…

college_freshmen: Dutch college freshman (1995)
A small network of friendships among freshmen at Dutch College in 1994-1995. Friendship ties were surveyed at 7 different times over the year, and each edge is timestamped. The direction of an edge indicates that person i named person j, and the edge weight represents their level of friendship, ranging from -1 (risk of conflict) to 3 (best friend).
This network has 32 nodes and 3062 edges.
Tags: Social, Offline, Weighted, Tim…

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

celegansneural: C. elegans neurons (1986)
A network representing the neural connections of the Caenorhabditis elegans nematode.
This network has 297 nodes and 2359 edges.
Tags: Biological, Connectome, Weighted
https://networks.skewed.de/net/celegansneural
Rid…

bison: Bison dominance
Dominance relations among a group of American bisons in the National Bison Range in Moiese Montana, observed in 1972.
This network has 26 nodes and 314 edges.
Tags: Social, Animal, Weighted
https://networks.skewed.de/net/bison
Ridiculogram:

spanish_highschools: Spanish high schools (2023)
Directed networks of friendships obtained through a social survey of spanish high school students.
This network has 378 nodes and 3267 edges.
Tags: Social, Offline, Weighted, Metadata
https://networks.skewed.de/net/spanish

sp_office: Workplace contacts (2013)
A temporal network of contacts between individuals, measured in an office building in France, from June 24 to July 3, 2013.
This network has 92 nodes and 9827 edges.
Tags: Social, Offline, Weighted, Temporal, Metadata
https://networks.skewed.de/net/sp_offi