Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)

Page title matches

  • ...hubs in consensus modules, WGCNA also gives rise to network based [[meta analysis]] techniques.<ref name="Langfelder2013"/> ...dependency network]] or correlation network. Weighted correlation network analysis can be attractive for the following reasons: ...
    28 KB (3,893 words) - 08:44, 7 February 2025
  • ...graph|graphing]] and estimating parameters modeling the self-similarity of network data. === R/S analysis === ...
    11 KB (1,820 words) - 00:43, 8 August 2021

Page text matches

  • ...ine whether or not it can be constructed as a lossless rational [[two-port network]]. ...dance]] ''Z''(''p'') is a [[rational function]] of ''p'') implies that the network consists solely of discrete elements ([[inductor]]s and [[capacitor]]s only ...
    2 KB (317 words) - 19:42, 16 September 2019
  • {{Short description|Network science algorithm}} ...etworks, such as transportation networks, power grid, router networks, the network of highways, etc. ...
    4 KB (700 words) - 13:22, 30 July 2024
  • {{Short description|Mathematical circuit analysis technique}} ...e [[Schur complement]] identity applied to the [[Kirchhoff matrix]] of the network. ...
    3 KB (339 words) - 22:10, 25 February 2025
  • ...hical closeness efficiently predicts disease genes in a directed signaling network, Computational biology and chemistry.</ref> as follows: ...>. It can also represent the hierarchical position of a node in a directed network. It notes that if <math>N_R(i) = 0</math>, then <math>C_{hc}(i) = 0</math> ...
    3 KB (500 words) - 20:56, 12 October 2024
  • ...robustness]] and the [[attack tolerance]] of networks. Understanding how a network changes in response to node deletion is critical in many empirical networks ...ork, so it affects each empirical network differently.<ref>Barabási, A.-L. NETWORK SCIENCE, Cambridge University Press 2015</ref> ...
    5 KB (788 words) - 13:14, 6 November 2023
  • ...some examples of social networks, such as the [[Citation analysis|citation network]] of scientific publications.<ref name=pachon2017>Pachon, Angelica; Sacerdo ...lled a ''window'', which represents the ''w'' last nodes inserted into the network. A new node may link itself either with a node from the window subset, with ...
    5 KB (850 words) - 14:27, 3 March 2024
  • ...al credal set over <math>X_i</math>, then the strong extension of a credal network is defined as follows: Inference on a credal network is intended as the computation of the bounds of an expectation with respect ...
    3 KB (460 words) - 11:02, 24 August 2024
  • *<math>m</math> is number of machine words in a packet sent over the network. ...ncy]], or time at which a processor takes to initiate a communication on a network. ...
    2 KB (359 words) - 01:19, 15 September 2024
  • ...hole state space must be enumerated. [[Buzen's algorithm]] or [[mean value analysis]] can be used to calculate the normalizing constant more efficiently.<ref>{ ==Definition of a Gordon–Newell network== ...
    4 KB (603 words) - 06:05, 14 June 2024
  • ...ized blockmodeling|generalized]] [[blockmodeling]], analysing the [[binary network]](s).<ref name="ReferenceA">{{cite journal |last1=Žiberna |first1=Aleš |dat As most [[Social network analysis|network analyses]] deal with binary networks, this approach is also considered as t ...
    2 KB (267 words) - 02:44, 6 January 2024
  • ...als the net value added to each user’s transactions conducted through that network, summed over all users." ...s]</ref> This new model values the network by looking from the edge of the network at all of the transactions conducted and the value added to each. ...
    6 KB (935 words) - 16:33, 5 July 2024
  • {{Network science}} ...h imposes a degree cut-off in the [[degree distribution]] of a finite size network due to structural limitations (such as the [[simple graph]] property). Net ...
    6 KB (915 words) - 07:52, 10 May 2024
  • {{Short description|Electrical network that exhibits anti-symmetrical electrical properties.}} ...ies to general electrical [[network analysis (electrical circuits)|network analysis]]. Antimetric is the diametrical opposite of symmetric; it does not merely ...
    7 KB (968 words) - 17:32, 2 August 2022
  • ...id=18282872 |last1=Specht |first1=D. F. |title=A general regression neural network |s2cid=6266210 }}</ref> GRNN can be used for [[Regression analysis|regression]], [[prediction]], and [[Statistical classification|classificati ...
    3 KB (481 words) - 15:35, 18 May 2023
  • ...works.<ref name=":0">{{cite book|last1=Barabási|first1=Albert-László|title=Network Science|date=2015|publisher=Cambridge University Press|url=http://barabasi. ...rse. There is, however, a formal sense of sparsity in the case of infinite network models, determined by the behavior of the number of edges (M) and/or the av ...
    7 KB (1,091 words) - 18:04, 4 January 2024
  • ...NETWORK_ANALYSIS presentation: Linear Electrical Circuits:Symbolic Network Analysis], 1977</ref> Symbolic circuit analysis is concerned with obtaining those relationships in symbolic form, i.e., in ...
    8 KB (1,191 words) - 23:20, 30 August 2020
  • ...pone.0012948.s001.ogv|thumb|Progression of the flu (contagion) on a social network]] ...t variables). By modeling these attribute patterns, ALAAMs help reveal how network ties affect personal characteristics across various types of networks. ...
    7 KB (960 words) - 21:30, 28 February 2025
  • ...PRF property of an impedance function determines whether or not a passive network can be realised having that impedance. Richards' theorem led to a new meth ...[zero (complex analysis)|zeroes]] of this function are the [[pole (complex analysis)|poles]] of <math>W(s)</math>. Since a PRF can have no zeroes in the right ...
    7 KB (1,157 words) - 15:25, 25 August 2023
  • {{redirect|Network hub|the Ethernet technology|Ethernet hub}} ....09.012">{{cite journal | vauthors = van den Heuvel MP, Sporns O | title = Network hubs in the human brain | journal = Trends in Cognitive Sciences | volume = ...
    11 KB (1,678 words) - 17:04, 5 January 2025
  • ...s of the network. The network becomes more homogeneous, closer to a random network, decreasing the size and frequency of the hubs. ...st1=Ying|first1=D.|title=Scientific collaboration and endorsement: Network analysis of coauthorship and citation networks|journal=Journal of Informetrics|date= ...
    7 KB (1,022 words) - 20:56, 12 October 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)