Results 261 to 270 of about 1,291,628 (288)
Some of the next articles are maybe not open access.
Explainable Global Wildfire Prediction Models using Graph Neural Networks
arXiv.orgWildfire prediction has become increasingly crucial due to the escalating impacts of climate change. Traditional CNN-based wildfire prediction models struggle with handling missing oceanic data and addressing the long-range dependencies across distant ...
Dayou Chen +4 more
semanticscholar +1 more source
Half-integral Erdös-Pósa property for non-null S-T paths
arXiv.orgFor a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements.
Vera Chekan +6 more
semanticscholar +1 more source
Zero-sum magic graphs and their null sets
2011For any element h of the Natural numbers, a graph G=(V,E), with vertex set V and edge set E, is said to be h-magic if there exists a labeling of the edge set E, using the integer group mod h such that the induced vertex labeling, the sum of all edges incident to a vertex, is a constant map.
openaire +1 more source
AMS/MAA Textbooks, 2018
A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End : E → M2(V ), where M2(V ) is set of all 2-element sub-multisets of V . We usually write V = V (G), E = E(G),
L. Gladkov
semanticscholar +1 more source
A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End : E → M2(V ), where M2(V ) is set of all 2-element sub-multisets of V . We usually write V = V (G), E = E(G),
L. Gladkov
semanticscholar +1 more source
Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions
2017Due to its ease of use, as well as its enormous flexibility in its degree structure, the configuration model has become the network model of choice in many disciplines. It has the wonderful property, that, conditioned on being simple, it is a uniform random graph with the prescribed degrees. This is a beautiful example of a general technique called the
openaire +2 more sources
Null bar and null zone are better than the error bar to compare group means in graphs
Journal of Clinical Epidemiology, 2004Conventional graphs often include error bars around the group means. Regardless of what these bars depict, they are uninformative as to whether a difference between the groups is statistically significant.This article suggests plotting the null bar or null zone: that is, the range or area in which the means of the two groups fall if the null hypothesis
openaire +2 more sources
Irreducible components of canonical graphs for second order spectral nulls
Proceedings of IEEE International Symposium on Information Theory, 2002Irreducible components of canonical graphs for second order spectral null constraints at a frequency f=f/sub s/k/n, where f/sub s/ is the symbol frequency, and k and n, integers with k/spl ges/0 and n>0. We show that if n is prime then a canonical graph consists of disjoint irreducible components.
openaire +1 more source
Effects of Null Model Choice on Modularity Maximization
International Workshop on Complex Networks & Their Applications, 2023Christopher Brissette +2 more
semanticscholar +1 more source
Keeping the chromophores crossed: evidence for null exciton splitting
Chemical Society Reviews, 2023Assoc Prof Mahesh Hariharan
exaly
Null models in network neuroscience
Nature Reviews Neuroscience, 2022František Váša, Bratislav Misic
exaly