Results 41 to 50 of about 1,291,628 (288)
Random Graphs with Prescribed K-Core Sequences: A New Null Model for Network Analysis [PDF]
The Web Conference, 2021 In the analysis of large-scale network data, a fundamental operation is the comparison of observed phenomena to the predictions provided by null models: when we find an interesting structure in a family of real networks, it is important to ask whether ...
K. V. Koevering +2 more
semanticscholar +1 more source
Psychological methods, 2022 Next Eigenvalue Sufficiency Test (NEST; Achim, 2017) is a recently proposed method to determine the number of factors in exploratory factor analysis (EFA).
Nils Brandenburg, Martin Papenberg
semanticscholar +1 more source
Indices, Graphs and Null Models: Analyzing Bipartite Ecological Networks [PDF]
The Open Ecology Journal, 2009 Many analyses of ecological networks in recent years have introduced new indices to describe network properties. As a consequence, tens of indices are available to address similar questions, differing in specific detail, sensitivity in detecting the property in question, and robustness with respect to network size and sampling intensity.
Dormann, Carsten F. +3 more
openaire +3 more sources
On local antimagic vertex coloring of corona products related to friendship and fan graph
Indonesian Journal of Combinatorics, 2021 Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u)
Zein Rasyid Himami, Denny Riama Silaban
doaj +1 more source
Properties of metabolic graphs: biological organization or representation artifacts?
BMC Bioinformatics, 2011 Background Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation that properties of metabolic networks, such as hierarchical and small-world ...
Nakhleh Luay, Zhou Wanding
doaj +1 more source
BarekengAssume that be an undirected simple graph with vertex set and edge set . The edge irregular reflexive -labeling of graph is a labeling selects positive integers from 1 to as edge labels and non negative even numbers from 0 to as vertex ...
Diari Indriati +2 more
doaj +1 more source
Graphlet correlation distance to compare small graphs
PLoS ONE, 2023 Graph models are standard for representing mutual relationships between sets of entities. Often, graphs deal with a large number of entities with a small number of connections (e.g. social media relationships, infectious disease spread). The distances or
Jérôme Roux +4 more
doaj +2 more sources
A hidden Markov tree model for testing multiple hypotheses corresponding to Gene Ontology gene sets
BMC Bioinformatics, 2018 Background Testing predefined gene categories has become a common practice for scientists analyzing high throughput transcriptome data. A systematic way of testing gene categories leads to testing hundreds of null hypotheses that correspond to nodes in a
Kun Liang +3 more
doaj +1 more source
HERMES: PERSISTENT SPECTRAL GRAPH SOFTWARE. [PDF]
Foundations of Data Science, 2020 Persistent homology (PH) is one of the most popular tools in topological data analysis (TDA), while graph theory has had a significant impact on data science.
Rui Wang +5 more
semanticscholar +1 more source
60/102 Null Boundary Cellular Automata based expander graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et al. introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor Cellular Automata(CA). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null Boundary CA(NBCA) which ...
Cho, Sung-Jin +4 more
openaire +1 more source