Disparity filter algorithm of weighted network information
Part of a series on
Network science
Theory
Graph
Complex network
Contagion
Small-world
Scale-free
Community structure
Percolation
Evolution
Controllability
Graph drawing
Social capital
Link analysis
Optimization
Reciprocity
Closure
Homophily
Transitivity
Preferential attachment
Balance theory
Network effect
Social influence
Network types
Informational (computing)
Telecommunication
Transport
Social
Scientific collaboration
Biological
Artificial neural
Interdependent
Semantic
Spatial
Dependency
Flow
on-Chip
Graphs
Features
Clique
Component
Cut
Cycle
Data structure
Edge
Loop
Neighborhood
Path
Vertex
Adjacency list / matrix
Incidence list / matrix
Types
Bipartite
Complete
Directed
Hyper
Labeled
Multi
Random
Weighted
Metrics
Algorithms
Centrality
Degree
Motif
Clustering
Degree distribution
Assortativity
Distance
Modularity
Efficiency
Models
Topology
Random graph
Erdős–Rényi
Barabási–Albert
Bianconi–Barabási
Fitness model
Watts–Strogatz
Exponential random (ERGM)
Random geometric (RGG)
Hyperbolic (HGN)
Hierarchical
Stochastic block
Blockmodeling
Maximum entropy
Soft configuration
LFR Benchmark
Dynamics
Boolean network
agent based
Epidemic/SIR
Lists
Categories
Topics
Software
Network scientists
Category:Network theory
Category:Graph theory
v
t
e
Disparity filter[1] is a network reduction algorithm (a.k.a. graph sparsification algorithm
[2]
) to extract the backbone structure of undirected weighted network. Many real world networks such as citation networks, food web, airport networks display heavy tailed statistical distribution of nodes' weight and strength. Disparity filter can sufficiently reduce the network without destroying the multi-scale nature of the network. The algorithm is developed by M. Angeles Serrano, Marian Boguna and Alessandro Vespignani.
^
Serrano, M.Angeles; Boguna, Marian; Vespignani, Alessandro (2009), "Extracting the multiscale backbone of complex weighted networks", Proceedings of the National Academy of Sciences, 106 (16): 6483–6488, arXiv:0904.2389, Bibcode:2009PNAS..106.6483S, doi:10.1073/pnas.0808904106, PMC 2672499, PMID 19357301.
^
Coscia, Michele (2021-02-08), "The Atlas for the Aspiring Network Scientist", arXiv:2101.00863 [cs.CY]
and 8 Related for: Disparity filter algorithm of weighted network information
Disparityfilter is a network reduction algorithm (a.k.a. graph sparsification algorithm ) to extract the backbone structure of undirected weighted network...
Particle filters, or sequential Monte Carlo methods, are a set of Monte Carlo algorithms used to find approximate solutions for filtering problems for...
Backbone algorithms designed for bipartite projections (in contrast to other weightednetwork backbone algorithms such as the disparityfilter) use this...
expectation–maximization algorithm), planning (using decision networks) and perception (using dynamic Bayesian networks). Probabilistic algorithms can also be used...
Algorithmic trading is a method of executing orders using automated pre-programmed trading instructions accounting for variables such as time, price, and...
facial recognition algorithm developed by Alex Pentland at MIT. Following the 1993 FERET face-recognition vendor test, the Department of Motor Vehicles (DMV)...
Representation), where the elected politicians' influence would be weighted with regard to the number of votes each had received. A few decades later, around 1967...
Global Information