Results 81 to 90 of about 38,382 (189)

TransClean: Finding False Positives in Multi-Source Entity Matching Under Real-World Conditions via Transitive Consistency

IEEE Access
We present TransClean, a method for detecting false positive predictions of entity matching algorithms under real-world conditions characterized by large-scale, noisy, and unlabeled multi-source datasets that undergo distributional shifts.
Fernando De Meer Pardo, Branka Hadji Misheva, Martin Braschler, Kurt Stockinger   +3 more
doaj   +1 more source

Nonemptiness of the Alpha‐Core

Journal of Public Economic Theory, Volume 28, Issue 1, February 2026.
ABSTRACT We prove nonemptiness of the α $\alpha $‐core for balanced games with nonordered preferences, extending and generalizing in several aspects the results of Scarf (1971), Border (1984), Florenzano (1989), Yannelis (1991b), and Kajii (1992). In particular, we answer an open question in Kajii (1992) regarding the applicability of the nonemptiness ...
V. Filipe Martins‐da‐Rocha, Nicholas C. Yannelis   +1 more
wiley   +1 more source

On Multilevel Energy‐Based Fragmentation Methods

International Journal of Quantum Chemistry, Volume 126, Issue 3, January 30, 2026.
We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker, Michael Griebel, Jan Hamaekers   +2 more
wiley   +1 more source

Cubic Edge-Transitive Graphs of Order $2p^4$

The Electronic Journal of Combinatorics
A graph $\Gamma$ is edge-transitive ($s$-arc-transitive, respectively) if its full automorphism group $\rm Aut\,(\Gamma)$ acts transitively on the set of edges (the set of $s$-arcs in $\Gamma$ for an integer $s\geq 0$, respectively). A $1$-arc-transitive graph is called an arc-transitive graph or a symmetric graph.
Xue Wang, Sejeong Bang, Jin‐Xin Zhou
openalex   +2 more sources

Formation Drivers and Evolutionary Dynamics of Industry-University-Research Collaborative Networks in China’s Clean Energy Industry

Systems
Robust industry-university-research (I-U-R) collaborative networks are essential for accelerating innovation in the clean energy industry (CEI). This study employs the exponential random graph model to investigate how the network structural, node, and ...
Qiezeng Yuan, Heng Chen, Chang Liu
doaj   +1 more source

On edge transitivity of directed graphs

Discrete Mathematics, 1995
The author calls a graph \(G\) a local comparability graph if its edges can be given an acyclic orientation such that for each arc \(uv\), the subgraph induced by the nodes that are simultaneously ancestors of \(v\) and descendants of \(u\) is transitive. He then defines a parameter called the dimension of the graph and shows that a local comparability
openaire   +2 more sources

Finite vertex-biprimitive edge-transitive tetravalent graphs

Discrete Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Cai Heng, Zhang, Hua
openaire   +2 more sources

Edge-transitive almost self-complementary graphs

Journal of Combinatorial Theory, Series B, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On edge-primitive and 2-arc-transitive graphs [PDF]

, 2018
Zaiping Lu
openalex   +1 more source

Uniform finite presentation for groups of polynomial growth

Discrete Analysis
Uniform finite presentation for groups of polynomial growth, Discrete Analysis 2025:1, 29 pp. Let $G$ be a finitely generated infinite group with generators $a_1,\dots,a_k$. The _ball of radius_ $r$ in $G$ is defined to be the set of all elements of $G$
Philip Easo, Tom Hutchcroft
doaj   +1 more source