Results 71 to 80 of about 1,245,282 (208)

Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment

Journal of Modern Power Systems and Clean Energy, 2021
Contingency analysis is an important building block in the stability and reliability analysis of power grid operations. However, due to the large number of transmission lines, in practice only a limited number of contingencies could be evaluated.
Lu Nan, Yikui Liu, Lei Wu, Tianqi Liu, Chuan He   +4 more
doaj   +1 more source

Extending the planar theory of anyons to quantum wire networks

SciPost Physics
The braiding of the worldlines of particles restricted to move on a network (graph) is governed by the graph braid group, which can be strikingly different from the standard braid group known from two-dimensional physics.
Tomasz Maciazek, Mia Conlon, Gert Vercleyen, J. K. Slingerland
doaj   +1 more source

The topological structure of urban roads and its relation with human activities at the street-based community level

Frontiers in Earth Science, 2022
The topological structure of the underlying streets can help us better understand urban space and human activities therein. As human urban movements are inherently heterogenous in space and statistics, whether or not the network of streets holds a ...
Yan Zhang, Yebin Chen, Wei Zhu, Wenwen Wang, Qian Zhang   +4 more
doaj   +1 more source

Twisted k-graph algebras associated to Bratteli diagrams [PDF]

, 2014
Given a system of coverings of k-graphs, we show that the cohomology of the resulting (k+1)-graph is isomorphic to that of any one of the k-graphs in the system. We then consider Bratteli diagrams of 2-graphs whose twisted C*-algebras are matrix algebras
A. An Huef, A. Kumjian, A. Kumjian, A. Kumjian, A. Kumjian, A. Sims, A.S. Toms, A.S. Toms, Adam Sierakowski, Aidan Sims, B. Blackadar, B. Blackadar, D. Drinen, D. Pask, D. Pask, David Pask, E. Kirchberg, E.G. Effros, G.A. Elliott, G.A. Elliott, G.A. Elliott, G.A. Elliott, I. Raeburn, I. Raeburn, J. Tyler, M. Pimsner, M. Tomforde, N.C. Phillips, O. Bratteli, P. Lewin, R. Hazlewood, T. Bates, W. Szymański   +32 more
core   +4 more sources

Visualisation and graph-theoretic analysis of a large-scale protein structural interactome

BMC Bioinformatics, 2003
Background Large-scale protein interaction maps provide a new, global perspective with which to analyse protein function. PSIMAP, the Protein Structural Interactome Map, is a database of all the structurally observed interactions between superfamilies of
Harrington Richard, Dafas Panos, Bolser Dan, Park Jong, Schroeder Michael   +4 more
doaj   +1 more source

Graph-Theoretic Approach for Self-Testing in Bell Scenarios

PRX Quantum, 2022
Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set B_{Q} of quantum correlations for a Bell experiment are achieved, up to isometries ...
Kishor Bharti, Maharshi Ray, Zhen-Peng Xu, Masahito Hayashi, Leong-Chuan Kwek, Adán Cabello   +5 more
doaj   +1 more source

Graph theory for analyzing pair-wise data: application to geophysical model parameters estimated from interferometric synthetic aperture radar data at Okmok volcano, Alaska

Journal of Geodesy, 2016
Graph theory is useful for analyzing time-dependent model parameters estimated from interferometric synthetic aperture radar (InSAR) data in the temporal domain.
Elena C. Reinisch, M. Cardiff, K. Feigl
semanticscholar   +1 more source

Applying novel connectivity networks to wood turtle populations to provide comprehensive conservation management strategies for species at risk.

PLoS ONE, 2022
Genetic diversity within and among populations is frequently used in prioritization processes to rank populations based on their vulnerability or distinctiveness, however, connectivity and gene flow are rarely considered within these frameworks.
Cindy Bouchard, Étienne Lord, Nathalie Tessier, François-Joseph Lapointe   +3 more
doaj   +1 more source

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes [PDF]

Symposium on the Theory of Computing
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent.
Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk   +2 more
semanticscholar   +1 more source

When Does an Ensemble of Matrices with Randomly Scaled Rows Lose Rank?

, 2015
We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient.
Avestimehr, A. Salman, Gamal, Aly El, Naderializadeh, Navid   +2 more
core   +1 more source