Results 51 to 60 of about 8,255 (178)
Journal of Graph Theory, Volume 110, Issue 4, Page 448-456, December 2025.ABSTRACT A dominating K t‐model in a graph G is a sequence ( T 1 , … , T t ) of pairwise disjoint non‐empty connected subgraphs of G, such that for 1 ⩽ i < j ⩽ t every vertex in T j has a neighbour in T i. Replacing ‘every vertex in T j’ by ‘some vertex in T j’ retrieves the standard definition of K t‐model, which is equivalent to K t being a minor of ...
Freddie Illingworth, David R. Wood
wiley +1 more source
Physical Review ResearchWe simulate quench dynamics of the Su-Schrieffer-Heeger (SSH) chain on IBM quantum computers, calculating the Rényi entanglement entropy, the twist order parameter, and the Berry phase.
Huai-Chun Chang +2 more
doaj +1 more source
Out-of-time ordered correlators, complexity, and entropy in bipartite systems
Physical Review Research, 2019 There is a remarkable interest in the study of out-of-time ordered correlators (OTOCs) that goes from many-body theory and high-energy physics to quantum chaos.
Pablo D. Bergamasco +2 more
doaj +1 more source
Statistical Complexity of Quantum Learning
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.The statistical performance of quantum learning is investigated as a function of the number of training data N$N$, and of the number of copies available for each quantum state in the training and testing data sets, respectively S$S$ and V$V$. Indeed, the biggest difference in quantum learning comes from the destructive nature of quantum measurements ...
Leonardo Banchi +3 more
wiley +1 more source
Simulation of a Channel with Another Channel
, 2016 In this paper, we study the problem of simulating a DMC channel from another DMC channel under an average-case and an exact model. We present several achievability and infeasibility results, with tight characterizations in special cases.
Aref, Mohammad Reza +4 more
core +1 more source
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Remarks on the Time Asymptotics of Schmidt Entropies
DynamicsSchmidt entropy is used as a common denotation for all Hilbert space entropies that can be defined via the Schmidt decomposition theorem; they include quantum entanglement entropies and classical separability entropies. Exact results about the asymptotic
Italo Guarneri
doaj +1 more source
, 2014 The q-composite key predistribution scheme [1] is used prevalently for secure communications in large-scale wireless sensor networks (WSNs). Prior work [2]-[4] explores topological properties of WSNs employing the q-composite scheme for q = 1 with ...
Gligor, Virgil, Yağan, Osman, Zhao, Jun
core +1 more source
On Constrained Matchings, Stable Under Random Preferences
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT Colloquially, there are two groups, n$$ n $$ men and n$$ n $$ women, each man (woman) ranking women (men) as potential marriage partners. A complete matching is called stable if no unmatched pair prefer each other to their partners in the matching.
Boris Pittel
wiley +1 more source
Information Theoretic Structure Learning with Confidence
, 2016 Information theoretic measures (e.g. the Kullback Liebler divergence and Shannon mutual information) have been used for exploring possibly nonlinear multivariate dependencies in high dimension.
Hero III, Alfred O. +3 more
core +1 more source