🕸️On Graph Theory: On Neural Networks (2020-2029)

"GNNs are capable of generating representations of nodes that depend on the structure of the graph as well as on any feature information we have. These features could be nodes’ properties, relationship types, and relationship properties. That’s why GNNs could drive the final tasks to better results. These embeddings represent the input for tasks such as node classification, link prediction, and graph classification." (Alessandro Negro, "Graph-Powered Machine Learning", 2021)

"Graphs, with multiple node types and different types of relationships, are far from being a Euclidean space. This task is where graph neural networks (GNNs) comes in. GNNs are deep learning-based methods that operate on a graph domain to perform complex tasks such as node classification (the bot example), link prediction (the disease example), and so on. Due to its convincing performance, GNN has become a widely applied graph analysis method." (Alessandro Negro, "Graph-Powered Machine Learning", 2021)

"A critical aspect of neural networks is their ability to learn from data. This learning occurs during the training phase, where the network is exposed to vast datasets, allowing it to adjust its internal parameters - the weights and biases associated with each neuron. The goal of this adjustment is to minimize the difference between the network's predictions and the actual outcomes, a process known as optimization. Through techniques such as gradient descent and backpropagation, neural networks iteratively refine their parameters, enhancing their ability to make accurate predictions or decisions based on new input."(Hayden Van Der Post, "Neural Network: Mastering the Art of Algorithmic Trading", 2024)

"Attention is a mechanism used in deep learning models (not just Transformers) that assigns different weights to different parts of the input, allowing the model to prioritize and emphasize the most important information while performing tasks like translation or summarization. Essentially, attention allows a model to 'focus' on different parts of the input dynamically, leading to improved performance and more accurate results. Before the popularization of attention, most neural networks processed all inputs equally and the models relied on a fixed representation of the input to make predictions. Modern LLMs that rely on attention can dynamically focus on different parts of input sequences, allowing them to weigh the importance of each part in making predictions." (Sinan Ozdemir, "Quick Start Guide to Large Language Models: Strategies and Best Practices for Using ChatGPT and Other LLMs", 2024)

"The beauty of neural networks lies in their ability to learn and improve. Through a process known as 'training', a neural network is fed large amounts of data along with feedback on its performance. This feedback guides the network in adjusting its internal parameters, known as weights, to minimize errors in its predictions. This iterative process of learning from mistakes closely mirrors the cognitive and learning processes of the human brain, making neural networks particularly adept at tasks that involve pattern recognition, such as image and speech recognition [...]" (Hayden Van Der Post, "Neural Network: Mastering the Art of Algorithmic Trading", 2024)

"The power of neural networks lies in their flexibility and adaptability. They are not confined to a single type of problem or dataset but can be tailored to a wide range of applications, from voice recognition and image classification to forecasting financial market movements. This versatility stems from the network's ability to capture and model complex, non-linear relationships within the data it is trained on, making it a potent tool in the arsenal of data scientists and algorithmic traders alike." (Hayden Van Der Post, "Neural Network: Mastering the Art of Algorithmic Trading", 2024)

"Generative AI for coding and language tools is based on the LLM concept. A large language model is a type of neural network that processes and generates text in a humanlike way. It does this by being trained on a massive dataset of text, which allows it to learn human language patterns, as described previously. It lets LLMs translate, write, and answer questions with text. LLMs can contain natural language, source code, and  more." (Jeremy C Morgan, "Coding with AI: Examples in Python", 2025)

🕸️On Graph Theory: On Semantic Networks (1990-)

"[…] semantic nets fail to be distinctive in the way they (1) represent propositions, (2) cluster information for access, (3) handle property inheritance, and (4) handle general inference; in other words, they lack distinctive representational properties (i.e., 1) and distinctive computational properties (i.e., 2-4). Certain propagation mechanisms, notably 'spreading activation', 'intersection search', or 'inference propagation' have sometimes been regarded as earmarks of semantic nets, but since most extant semantic nets lack such mechanisms, they cannot be considered criterial in current usage." (Lenhart K Schubert, "Semantic Nets are in the Eye of the Beholder", 1990)

"[…] the representational and computational strategies employed in semantic net systems are abstractly equivalent to those employed in virtually all state-of-the-art systems incorporating a substantial propositional knowledge base, whether they are described as logic-based, frame-based, rule-based, or some-thing else." (Lenhart K Schubert, "Semantic Nets are in the Eye of the Beholder", 1990)

"A semantic network or net represents knowledge as a net-like graph. An idea, event, situation or object almost always has a composite structure; this is represented in a semantic network by a corresponding structure of nodes (drawn as circles or boxes) representing conceptual units, and directed links (drawn as arrows between the nodes) representing the relations between the units. […] An abstract (graph-theoretic) network can be diagrammed, defined mathematically, programmed in a computer, or hard-wired electronically. It becomes semantic when you assign a meaning to each node and link. Unlike specialized networks and diagrams, semantic networks aim to represent any kind of knowledge which can be described in natural language. A semantic network system includes not only the explicitly stored net structure but also methods for automatically deriving from that a much larger structure or body of implied knowledge." (Fritz Lehman, "Semantic Networks",  Computers & Mathematics with Applications Vol. 23 (2-5), 1992)

"The essential idea of semantic networks is that the graph-theoretic structure of relations and. abstractions can be used for inference as well as understanding. […] A semantic network is a discrete structure as is any linguistic description. Representation of the continuous 'outside world' with such a structure is necessarily incomplete, and requires decisions as to which information is kept and which is lost." (Fritz Lehman, "Semantic Networks",  Computers & Mathematics with Applications Vol. 23 (2-5), 1992)

"The great organizing principle of thought is abstraction. By assigning particular things to abstract categories we are able to dispense with irrelevant detail and yet instantly draw copious conclusions about a thing due to its membership in various categories. Semantic networks specify the structure of interrelated abstract categories and use this structure to draw conclusions." (Fritz Lehman, "Semantic Networks",  Computers & Mathematics with Applications Vol. 23 (2-5), 1992)

"Conceptual graphs are system of logic based on the existential graphs of Charles Sanders Peirce and the semantic networks of artificial intelligence. The purpose of the system is to express meaning in a form that is logically precise, humanly readable, and computationally tractable. With their direct mapping to language, conceptual graphs can serve as an intermediate language for translating computer-oriented formalisms to and from natural languages. With their graphic representation, they can serve as a readable, but design and specification language." (John F Sowa, "Conceptual graphs for knowledge representation", 1993) 

"A knowledge modeling approach based on semantic networks and first-order logic, first introduced by Sowa, whereby knowledge is represented by concepts and relations linked together in a bipartite graph." (Harry S Delugach, "Formal Analysis of Workflows in Software Development", 2009

"Conceptual graphs consist of a formal language to access knowledge and meaning. A conceptual graph is a graph or network of two kinds of nodes, concepts and relations. They have the full power of first-order logic and can represent model and higher-order logic. Conceptual graphs have a direct translation into natural language." (Ivan Launders, "Socio-Technical Systems and Knowledge Representation", 2009)

"Conceptual graphs (CGs) and fuzzy logic are two logical formalisms that emphasize the target of natural language, each of which is focused on one of the two mentioned desired features of a logic for handling natural language. Conceptual graphs, based on semantic networks and Peirce's existential graphs, combine the visual advantage of graphical languages and the expressive power of logic." (Tru H Cao, "Conceptual Graphs and Fuzzy Logic: A Fusion for Representing and Reasoning with Linguistic Information", 2010) 

🕸️On Graph Theory: On Neural Networks (2010-2019)

"Rule-based expert systems require that you preprogram all the rules that represent the knowledge in the domain. To create a realistic and complete solution. the knowledge engineer must be well versed in the domain and have a clear sense of what the decision procedures are. This understanding must take place beforehand, before the system is created: misunderstandings about the domain can be very costly later on because rule-based expert systems can be extremely difficult to modify and extend into other areas. Even when this is possible. the new rules must be created manually - the expert system does not learn how to tine-tune the rules on its own. Case-based reasoning and neural networks are two Al approaches that are more suitable when you want to create a system that 'learns' how to solve problems on its own." (Robbie T Nakatsu, "Diagrammatic Reasoning in AI", 2010)

"Neural networks can model very complex patterns and decision boundaries in the data and, as such, are very powerful. In fact, they are so powerful that they can even model the noise in the training data, which is something that definitely should be avoided. One way to avoid this overfitting is by using a validation set in a similar way as with decision trees.[...] Another scheme to prevent a neural network from overfitting is weight regularization, whereby the idea is to keep the weights small in absolute sense because otherwise they may be fitting the noise in the data. This is then implemented by adding a weight size term (e.g., Euclidean norm) to the objective function of the neural network." (Bart Baesens, "Analytics in a Big Data World: The Essential Guide to Data Science and Its Applications", 2014)

"Deep learning is an area of machine learning that emerged from the intersection of neural networks, artificial intelligence, graphical modeling, optimization, pattern recognition and signal processing." (N D Lewis, "Deep Learning Made Easy with R: A Gentle Introduction for Data Science", 2016)

"An important property of neural networks is that their weights are set randomly before learning is started, and this random initialization affects the model that is learned. That means that even when using exactly the same parameters, we can obtain very different models when using different random seeds. If the networks are large, and their complexity is chosen properly, this should not affect accuracy too much, but it is worth keeping in mind (particularly for smaller networks)." (Andreas C Müller & Sarah Guido, "Introduction to Machine Learning with Python: A Guide for Data Scientists", 2017)

"Neural networks - particularly the large and powerful ones - often take a long time to train. They also require careful preprocessing of the data, as we saw here. Similarly to SVMs, they work best with 'homogeneous' data, where all the features have similar meanings. For data that has very different kinds of features, tree-based models might work better. Tuning neural network parameters is also an art unto itself. In our experiments, we barely scratched the surface of possible ways to adjust neural network models and how to train them."  (Andreas C Müller & Sarah Guido, "Introduction to Machine Learning with Python: A Guide for Data Scientists", 2017)

"A neural network consists of a set of neurons that are connected together. A neuron takes a set of numeric values as input and maps them to a single output value. At its core, a neuron is simply a multi-input linear-regression function. The only significant difference between the two is that in a neuron the output of the multi-input linear-regression function is passed through another function that is called the activation function." (John D Kelleher & Brendan Tierney, "Data Science", 2018)

"Just as they did thirty years ago, machine learning programs (including those with deep neural networks) operate almost entirely in an associational mode. They are driven by a stream of observations to which they attempt to fit a function, in much the same way that a statistician tries to fit a line to a collection of points. Deep neural networks have added many more layers to the complexity of the fitted function, but raw data still drives the fitting process. They continue to improve in accuracy as more data are fitted, but they do not benefit from the 'super-evolutionary speedup'."  (Judea Pearl & Dana Mackenzie, "The Book of Why: The new science of cause and effect", 2018)

"A neural-network algorithm is simply a statistical procedure for classifying inputs (such as numbers, words, pixels, or sound waves) so that these data can mapped into outputs. The process of training a neural-network model is advertised as machine learning, suggesting that neural networks function like the human mind, but neural networks estimate coefficients like other data-mining algorithms, by finding the values for which the model’s predictions are closest to the observed values, with no consideration of what is being modeled or whether the coefficients are sensible." (Gary Smith & Jay Cordes, "The 9 Pitfalls of Data Science", 2019)

"Deep neural networks have an input layer and an output layer. In between, are “hidden layers” that process the input data by adjusting various weights in order to make the output correspond closely to what is being predicted. [...] The mysterious part is not the fancy words, but that no one truly understands how the pattern recognition inside those hidden layers works. That’s why they’re called 'hidden'. They are an inscrutable black box - which is okay if you believe that computers are smarter than humans, but troubling otherwise." (Gary Smith & Jay Cordes, "The 9 Pitfalls of Data Science", 2019)

"Neural-network algorithms do not know what they are manipulating, do not understand their results, and have no way of knowing whether the patterns they uncover are meaningful or coincidental. Nor do the programmers who write the code know exactly how they work and whether the results should be trusted. Deep neural networks are also fragile, meaning that they are sensitive to small changes and can be fooled easily." (Gary Smith & Jay Cordes, "The 9 Pitfalls of Data Science", 2019)

"The label neural networks suggests that these algorithms replicate the neural networks in human brains that connect electrically excitable cells called neurons. They don’t. We have barely scratched the surface in trying to figure out how neurons receive, store, and process information, so we cannot conceivably mimic them with computers." (Gary Smith & Jay Cordes, "The 9 Pitfalls of Data Science", 2019)

🕸️On Graph Theory: On Clusters (2020-2029)

"[...] scatterplots had advantages over earlier graphic forms: the ability to see clusters, patterns, trends, and relations in a cloud of points. Perhaps most importantly, it allowed the addition of visual annotations (point symbols, lines, curves, enclosing contours, etc.) to make those relationships more coherent and tell more nuanced stories." (Michael Friendly & Howard Wainer, "A History of Data Visualization and Graphic Communication", 2021)

"A small-world network is characterized by a high clustering coefficient and a short average path length, meaning that most nodes can be reached from any other node through a small number of intermediate connections. This structure often mirrors real-world social networks, where individuals are typically connected through a few mutual acquaintances, allowing for rapid information dissemination." (Aldo Marzullo et al, "Graph Machine Learning" 2nd Ed., 2025)

"A tree-like structure or a tree diagram, one showing taxonomic (classification-related) relationships, is created. It is known as a dendrogram. It has branches pointing toward categories or classes. It is a pattern formed by a series of splits or segments of a given quantity of data over a set of compartments and the flow components. From this pattern, a description can be made of the profile of data allocation over the set of functional or structural compartments. The merger of clusters is terminated after every data point lies in one single cluster at the top of the tree." (Vinod K Khanna, "Introduction to Machine Learning Algorithms:  Basic Principles and Mathematics", 2026)

"Hierarchical clustering is summarised by a dendrogram, which sequentially shows points being joined to form a cluster, with the corresponding distances. Breaking the data into clusters is done by cutting the dendrogram at the long edges. [...] Plotting the dendrogram in the data space can help you understand how the hierarchical clustering has collected the points together into clusters. You can learn if the algorithm has been confused by nuisance patterns in the data, and how different choices of linkage method affect the result." (Dianne Cook & Ursula Laa, "Interactively Exploring High-Dimensional Data and Models in R", 2026)

"Viewing the dendrograms in high dimensions provides insight into how the algorithm has joined points to clusters. For example, single linkage often has edges leading to a single focal point, which might not yield a useful clustering but might help to identify outliers. If the edges point to multiple focal points, with long edges bridging gaps in the data, the result is more likely yielding a useful clustering." (Dianne Cook & Ursula Laa,  "Interactively Exploring High-Dimensional Data and Models in R", 2026)

"ML is a useful - and under-utilized - framework for studying LLMs. For one thing, LLMs are literally composed of simple ML algorithms (linear weighted averages and nonlinear transformations). Furthermore, using ML techniques like regression, classification, and clustering, can help reveal how concepts like grammar rules are represented inside LLMs. And finally, many people find LLMs to be intimidatingly complicated while finding ML to be much more approachable. Thus, using ML to study LLMs involves using simple tools to understand complicated tools." (Mike X Cohen,"50 ML Projects To Understand LLMs", 2026)

🕸️On Graph Theory: On Clusters (2010-2019)

"Where many known, measurable factors are involved, statisticians can use mathematical techniques to account for all the variables and try to find which are the truly important predictors. The terms for this include multiple regression, multivariate analysis, and discriminant analysis, and factor, cluster, path, and two-stage least-squares analyses." (Victor Cohn & Lewis Cope, "News & Numbers: A writer’s guide to statistics" 3rd Ed, 2012)

"Hierarchical clustering creates a hierarchy of clusters which can be represented in a treelike diagram, called a dendrogram. In the dendrogram, units in the same cluster are joined by a horizontal line, with the scale on the y-axis of the dendrogram reflecting a measure of the distances of the units within the cluster. The leaves at the bottom of the dendrogram represent the individual units; leaves are combined to form small branches, small branches are combined into larger branches, until one reaches the trunk or root of the tree that represents a single cluster containing all units. Dendrograms are quite useful as they give us a visual representation of the clusters." (Johannes Ledolter, "Data mining and business analytics with R", 2013)

"Different joining/linkage rules change how the final hierarchical clustering is presented. [...] Since the barrier for merging observations and clusters is lowest with the single linkage approach, the clustering dendrogram may contain chains of clusters as well as clusters that are spread out. The barrier to joining clusters is highest with complete linkage; however, it is possible that an observation is closer to observations in other clusters than the cluster to which it has been assigned. The average linkage approach moderates the tendencies of the single or complete linkage approaches." (Glenn J Myatt & Wayne P Johnson, "Making sense of data I: a practical guide to exploratory data analysis and data mining" 2nd. Ed., 2014)

"Linking is a powerful dynamic interactive graphics technique that can help us better understand high-dimensional data. This technique works in the following way: When several plots are linked, selecting an observation's point in a plot will do more than highlight the observation in the plot we are interacting with - it will also highlight points in other plots with which it is linked, giving us a more complete idea of its value across all the variables. Selecting is done interactively with a pointing device. The point selected, and corresponding points in the other linked plots, are highlighted simultaneously. Thus, we can select a cluster of points in one plot and see if it corresponds to a cluster in any other plot, enabling us to investigate the high-dimensional shape and density of the cluster of points, and permitting us to investigate the structure of the disease space." (Forrest W Young et al, "Visual Statistics: Seeing data with dynamic interactive graphics", 2016)

"Agglomerative clustering produces what is known as a hierarchical clustering. The clustering proceeds iteratively, and every point makes a journey from being a single point cluster to belonging to some final cluster. Each intermediate step provides a clustering of the data (with a different number of clusters). It is sometimes helpful to look at all possible clusterings jointly. [...] While this visualization provides a very detailed view of the hierarchical clustering, it relies on the two-dimensional nature of the data and therefore cannot be used on datasets that have more than two features. There is, however, another tool to visualize hierarchical clustering, called a dendrogram, that can handle multidimensional datasets." (Andreas C Müller & Sarah Guido, "Introduction to Machine Learning with Python: A Guide for Data Scientists", 2017)

"Cluster analysis refers to the grouping of observations so that the objects within each cluster share similar properties, and properties of all clusters are independent of each other. Cluster algorithms usually optimize by maximizing the distance among clusters and minimizing the distance between objects in a cluster. Cluster analysis does not complete in a single iteration but goes through several iterations until the model converges. Model convergence means that the cluster memberships of all objects converge and don’t change with every new iteration." (Danish Haroon, "Python Machine Learning Case Studies", 2017)

"Hierarchical clustering is comprised of a general family of clustering algorithms that construct nested clusters by successive merging or splitting of data. The hierarchy of clusters is represented as a tree. The tree is usually called a dendrogram. The root of the dendrogram is the single cluster that contains all the samples; the leaves are the clusters containing only one sample each. This is a nice tool, since it can be straightforwardly interpreted: it 'explains' how clusters are formed and visualizes clusters at different scales. The tree that results from the technique shows the similarity between the samples. Partitioning is computed by selecting a cut on the tree at a certain level." (Laura Igual & Santi Seguí, "Introduction to Data Science: A Python Approach to Concepts, Techniques and Applications", 2017)

"Unsupervised learning or clustering is a way of discovering hidden structures in unlabeled data. Clustering algorithms aim to discover latent patterns in unlabeled data using features to organize instances into meaningfully dissimilar groups." (Benjamin Bengfort et al, "Applied Text Analysis with Python: Enabling Language-Aware Data Products with Machine Learning", 2018)

"Community formation is common in all types of networks, and identifying them is essential for evaluating group behavior and emergent phenomena. The general prin‐ ciple in finding communities is that its members will have more relationships within the group than with nodes outside their group. Identifying these related sets reveals clusters of nodes, isolated groups, and network structure. This information helps infer similar behavior or preferences of peer groups, estimate resiliency, find nested relationships, and prepare data for other analyses. Community detection algorithms are also commonly used to produce network visualization for general inspection." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"When using community detection algorithms, be conscious of the density of the relationships. If the graph is very dense, you may end up with all nodes congregating in one or just a few clusters. You can counteract this by filtering by degree, relationship weights, or similarity metrics. On the other hand, if the graph is too sparse with few connected nodes, you may end up with each node in its own cluster. In this case, try to incorporate additional relationship types that carry more relevant information." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

🕸️On Graph Theory: On Clusters (2000-2009)

"At an anatomical level - the level of pure, abstract connectivity - we seem to have stumbled upon a universal pattern of complexity. Disparate networks show the same three tendencies: short chains, high clustering, and scale-free link distributions. The coincidences are eerie, and baffling to interpret." (Steven Strogatz, "Sync: The Emerging Science of Spontaneous Order", 2003)

"[…] finding at least one cluster of events in time or in space has a greater probability than finding no clusters at all (equally spaced events)." (Phillip I Good & James W Hardin, "Common Errors in Statistics (and How to Avoid Them)", 2003)

"At an anatomical level - the level of pure, abstract connectivity - we seem to have stumbled upon a universal pattern of complexity. Disparate networks show the same three tendencies: short chains, high clustering, and scale-free link distributions. The coincidences are eerie, and baffling to interpret." (Steven Strogatz, "Sync: The Emerging Science of Spontaneous Order", 2003)

"Average path length reflects the global structure; it depends on the way the entire network is connected, and cannot be inferred from any local measurement. Clustering reflects the local structure; it depends only on the interconnectedness of a typical neighborhood, the inbreeding among nodes tied to a common center. Roughly speaking, path length measures how big the network is. Clustering measures how incestuous it is." (Steven Strogatz, "Sync: The Emerging Science of Spontaneous Order", 2003)

"Randomness is a difficult notion for people to accept. When events come in clusters and streaks, people look for explanations and patterns. They refuse to believe that such patterns - which frequently occur in random data - could equally well be derived from tossing a coin. So it is in the stock market as well." (Didier Sornette, "Why Stock Markets Crash: Critical events in complex financial systems", 2003)

"[…] real networks not only are connected but are well beyond the threshold of one. Random network theory tells us that as the average number of links per node increases beyond the critical one, the number of nodes left out of the giant cluster decreases exponentially. That is, the more links we add, the harder it is to find a node that remains isolated. Nature does not take risks by staying close to the threshold. It well surpasses it."  (Albert-László Barabási, "Linked: How Everything Is Connected to Everything Else and What It Means for Business, Science, and Everyday Life", 2002)

"Like regular networks, random ones are seductive idealizations. Theorists find them beguiling, not because of their verisimilitude, but because they're the easiest ones to analyze. [...] Random networks are small and poorly clustered; regular ones are big and highly clustered." (Steven Strogatz, "Sync: The Emerging Science of Spontaneous Order", 2003)

"Because the cluster solutions grow tree-like (starting with the branches and ending with the trunk) results are often displayed in a graphic called the dendrogram. Horizontal lines indicate linking of two samples or clusters, and thus the vertical axis presents the associated height or similarity as a measure of distance. The samples are arranged in such a way that the branches of the tree do not overlap. Linking of two groups at a large height indicates strong dissimilarity (and vice versa). Therefore, a clear cluster structure would be indicated if observations are linked at a very low height, and the distinct clusters are linked at a greater height (long branches of the tree). Cutting the dendrogram at such a greater height permits assigning the samples to the resulting distinct clusters. Visual inspection of a dendrogram is often helpful in obtaining an initial estimate of the number of clusters for partitioning methods." (Clemens Reimann et al, "Statistical Data Analysis Explained: Applied Environmental Statistics with R", 2008)

"A single soap bubble quickly finds the least-surface-area way to enclose the fixed volume of air trapped inside - the round sphere. Similarly, bubble clusters seek the least-area way to enclose and separate several regions of prescribed volumes." (Frank Morgan, "Geometric Measure Theory:A Beginner’s Guide" 4th. Ed., 2009)

"Granular computing is a general computation theory for using granules such as subsets, classes, objects, clusters, and elements of a universe to build an efficient computational model for complex applications with huge amounts of data, information, and knowledge. Granulation of an object a leads to a collection of granules, with a granule being a clump of points (objects) drawn together by indiscernibility, similarity, proximity, or functionality. In human reasoning and concept formulation, the granules and the values of their attributes are fuzzy rather than crisp. In this perspective, fuzzy information granulation may be viewed as a mode of generalization, which can be applied to any concept, method, or theory." (Salvatore Greco et al, "Granular Computing and Data Mining for Ordered Data: The Dominance-Based Rough Set Approach", 2009)

"With the ever increasing amount of empirical information that scientists from all disciplines are dealing with, there exists a great need for robust, scalable and easy to use clustering techniques for data abstraction, dimensionality reduction or visualization to cope with and manage this avalanche of data." (Jörg Reichardt, "Structure in Complex Networks", 2009)

🕸️On Graph Theory: On Clusters (-1999)

"To the untrained eye, randomness appears as regularity or tendency to cluster." (William Feller, "An Introduction to Probability Theory and its Applications", 1950) 

"An average is sometimes called a 'measure of central tendency' because individual values of the variable usually cluster around it. Averages are useful, however, for certain  types of data in which there is little or no central tendency." (William A Spirr & Charles P Bonini, "Statistical Analysis for Business Decisions" 3rd Ed., 1967)

"In comparison with Predicate Calculus encoding s of factual knowledge, semantic nets seem more natural and understandable. This is due to the one-to-one correspondence between nodes and the concepts they denote, to the clustering about a particular node of propositions about a particular thing, and to the visual immediacy of 'interrelationships' between concepts, i.e., their connections via sequences of propositional links." (Lenhart K Schubert, "Extending the Expressive Power of Semantic Networks", Artificial Intelligence 7, 1976)

"Unlike the theory, models are restricted by technical considerations to a few components at a time, even in systems which are complex. Thus a satisfactory theory is usually a cluster of models. These models are related to each other in several ways : as coordinate alternative models for the same set of phenomena, they jointly produce robust theorems; as complementary models they can cope with different aspects of the same problem and give complementary as well as overlapping results; as hierarchically arranged 'nested' models, each provides an interpretation of the sufficient parameters of the next higher level where they are taken as given." (Richard Levins, "The Strategy of Model Building in Population Biology", American Scientist 54(4), 1966)

"Randomness is a difficult notion for people to accept. When events come in clusters and streaks, people look for explanations and patterns. They refuse to believe that such patterns - which frequently occur in random data - could equally well be derived from tossing a coin. So it is in the stock market as well." (Burton G Malkiel, "A Random Walk Down Wall Street", 1989)

"In physics, there are numerous phenomena that are said to be 'true on all scales', such as the Heisenberg uncertainty relation, to which no exception has been found over vast ranges of the variables involved (such as energy versus time, or momentum versus position). But even when the size ranges are limited, as in galaxy clusters (by the size of the universe) or the magnetic domains in a piece of iron near the transition point to ferromagnetism (by the size of the magnet), the concept true on all scales is an important postulate in analyzing otherwise often obscure observations." (Manfred Schroeder, "Fractals, Chaos, Power Laws Minutes from an Infinite Paradise", 1990)

"[…] semantic nets fail to be distinctive in the way they (1) represent propositions, (2) cluster information for access, (3) handle property inheritance, and (4) handle general inference; in other words, they lack distinctive representational properties (i.e., 1) and distinctive computational properties (i.e., 2-4). Certain propagation mechanisms, notably 'spreading activation', 'intersection search', or 'inference propagation' have sometimes been regarded as earmarks of semantic nets, but since most extant semantic nets lack such mechanisms, they cannot be considered criterial in current usage." (Lenhart K Schubert, "Semantic Nets are in the Eye of the Beholder", 1990)

"Black-noise phenomena govern natural and unnatural catastrophes like floods, droughts, bear markets, and various outrageous outages, such as those of electrical power. Because of their black spectra, such disasters often come in clusters." (Manfred R Schroeder, "Fractals, Chaos, Power Laws", 1991)

"Many of the basic functions performed by neural networks are mirrored by human abilities. These include making distinctions between items (classification), dividing similar things into groups (clustering), associating two or more things (associative memory), learning to predict outcomes based on examples (modeling), being able to predict into the future (time-series forecasting), and finally juggling multiple goals and coming up with a good- enough solution (constraint satisfaction)." (Joseph P Bigus,"Data Mining with Neural Networks: Solving business problems from application development to decision support", 1996)

"Regression to the mean occurs when the process produces results that are statistically independent or negatively correlated. With strong negative serial correlation, extremes are likely to be reversed each time (which would reinforce the instructors' error). In contrast, with strong positive dependence, extreme results are quite likely to be clustered together." (Dan Trietsch, "Statistical Quality Control : A loss minimization approach", 1998)

𒇫On Topology: On Compressing

"Topology, which used to be called geometry of situation or analysis situs ('topos' means position, situation in Greek), considers that all pots with two handles are of the same form because, if both are infinitely flexible and compressible, they can be molded into any other continuously, without tearing any new opening or closing up any old one. It also teaches that all single island coastlines are of the same form, because they are topologically identical to a circle." (Benoît B Mandelbrot, "The Fractal Geometry of Nature" 3rd Ed., 1983)

"Topology deals with those properties of curves, surfaces, and more general aggregates of points that are not changed by continuous stretching, squeezing, or bending. To a topologist, a circle and a square are the same, because either one can easily be bent into the shape of the other. In three dimensions, a circle and a closed curve with an overhand knot in it are topologically different, because no amount of bending, squeezing, or stretching will remove the knot." (Edward N Lorenz, "The Essence of Chaos", 1993)

"[…] topology is the study of those properties of geometric objects which remain unchanged under bi-uniform and bi-continuous transformations. Such transformations can be thought of as bending, stretching, twisting or compressing or any combination of these." (Lokenath Debnath, "The Legacy of Leonhard Euler - A Tricentennial Tribute", 2010)

"As the mechanical wave source moves through the medium, it pushes on a nearby segment of the material, and that segment moves away from the source and is compressed (that is, the same amount of mass is squeezed into a smaller volume, so the density of the segment increases). That segment of increased density exerts pressure on adjacent segments, and in this way a pulse (if the source gives a single push) or a harmonic wave (if the source oscillates back and forth) is generated by the source and propagates through the material." (Daniel Fleisch & Laura Kinnaman, "A Student’s Guide to Waves", 2015)

"At first, topology can seem like an unusually imprecise branch of mathematics. It’s the study of squishy play-dough shapes capable of bending, stretching and compressing without limit. But topologists do have some restrictions: They cannot create or destroy holes within shapes. […] While this might seem like a far cry from the rigors of algebra, a powerful idea called homology helps mathematicians connect these two worlds. […] homology infers an object’s holes from its boundaries, a more precise mathematical concept. To study the holes in an object, mathematicians only need information about its boundaries." (Kelsey Houston-Edwards, "How Mathematicians Use Homology to Make Sense of Topology", Quanta Magazine, 2021)

🪷On Mind: On Communities

"Scientists work from models acquired through education and through subsequent exposure to the literature often without quite knowing or needing to know what characteristics have given these models the status of community paradigms." (Thomas Kuhn, The Structure of Scientific Revolutions, 1962)

"The use of metaphor is one of many devices available to the scientific community to accomplish the task of accommodation of language to the causal structure of the world." (Richard Boyd, "Metaphor and theory change: what is ‘metaphor’ a metaphor for?", 1979)

"Concept maps have long provided visual languages widely used in many different disciplines and application domains. Abstractly, they are sorted graphs visually represented as nodes having a type, name and content, some of which are linked by arcs. Concretely, they are structured diagrams having discipline- and domain-specific interpretations for their user communities, and, sometimes, formally defining computer data structures. Concept maps have been used for a wide range of purposes and it would be useful to make such usage available over the World Wide Web." (Brian R Gaines, "WebMap: Concept Mapping on the Web", 2001)"

 "Our mental model governs what we see, how we think about things and how we act, but is this just an individual phenomenon, or can whole communities and professions share a common mental model, a shared view of reality? […] What is beyond doubt is that all professions have their own vocabularies, lexicons, tools and techniques. These models, techniques and ways of analysing things are not value-free; they represent a way of seeing the world. When we select and use them we are subconsciously buying into that way of thinking and, inevitably, we are also reinforcing our own mental model of cause and effect. We tend to expend significant effort in understanding the inner workings of a new tool or practice, but we give scant attention to the thought paradigm that underpins it." (Robina Chatham & Brian Sutton, "Changing the IT Leader’s Mindset", 2010)

"The mental model is the arena where imagination takes place. It enables us to experiment with different scenarios by making local alterations to the model. […] To speak of causality, we must have a mental model of the real world. […] Our shared mental models bind us together into communities." (Judea Pearl & Dana Mackenzie, "The Book of Why: The new science of cause and effect", 2018)

🪸On Systems Thinking: On Communities

"That land is a community is the basic concept of ecology, but that land is to be loved and respected is an extension of ethics." (Aldo Leopold, "A Sand County Almanac", 1949)

"Biological communities are systems of interacting components and thus display characteristic properties of systems, such as mutual interdependence, self-regulation, adaptation to disturbances, approach to states of equilibrium, etc." (Ludwig von Bertalanffy, "Problems of Life", 1952)

"A diverse community is a resilient community, capable of adapting to changing situations. However, diversity is a strategic advantage only if there is a truly vibrant community, sustained by a web of relationships. If the community is fragmented into isolated groups and individuals, diversity can easily become a source of prejudice and friction. But if the community is aware of the interdependence of all its members, diversity will enrich all the relationships and thus enrich the community as a whole, as well as each individual member. In such a community information and ideas flow freely through the entire network, and the diversity of interpretations and learning styles-even the diversity of mistakes-will enrich the entire community." (Humberto Maturana & Francisco J Varela, "The Tree of Knowledge", 1987)

"Understanding ecological interdependence means understanding relationships. It requires the shifts of perception that are characteristic of systems thinking - from the parts to the whole, from objects to relationships, from contents to patterns. […] Nourishing the community means nourishing those relationships." (Fritjof Capra, "The Web of Life: A New Scientific Understanding of Living Systems", 1996)

"It [collective intelligence] is a form of universally distributed intelligence, constantly enhanced, coordinated in real time, and resulting in the effective mobilization of skills. I'll add the following indispensable characteristic to this definition: The basis and goal of collective intelligence is mutual recognition and enrichment of individuals rather than the cult of fetishized or hypostatized communities." (Pierre Levy, "Collective Intelligence", 1999)

"What is sustained in a sustainable community is not economic growth, development, market share, or competitive advantage, but the entire web of life on which our long-term survival depends. In other words, a sustainable community is designed in such a way that its ways of life, businesses, economy, physical structures, and technologies do not interfere with nature’s inherent ability to sustain life." (Fritjof Capra, "Ecoliteracy: The Challenge for Education in the Next Century", 1999)

"For any given population of susceptibles, there is some critical combination of contact frequency, infectivity, and disease duration just great enough for the positive loop to dominate the negative loops. That threshold is known as the tipping point. Below the tipping point, the system is stable: if the disease is introduced into the community, there may be a few new cases, but on average, people will recover faster than new cases are generated. Negative feedback dominates and the population is resistant to an epidemic. Past the tipping point, the positive loop dominates .The system is unstable and once a disease arrives, it can spread like wildfire that is, by positive feedback-limited only by the depletion of the susceptible population." (John D Sterman, "Business Dynamics: Systems thinking and modeling for a complex world", 2000)

"If the contact rate, infectivity, and duration of infection are small enough, the system is below the tipping point and stable. Such a situation is known as herd immunity because the arrival of an infected individual does not produce an epidemic (though a few unlucky individuals may come in contact with any infectious arrivals and contract the disease, the group as a community is protected). However, changes in the contact rate, infectivity, or duration of illness can push a system past the tipping point." (John D Sterman, "Business Dynamics: Systems thinking and modeling for a complex world", 2000)

"The living world can be viewed as a biological hierarchy that starts with subcellular particles, and continues up through cells, tissues and organs. Ecology deals with the next three levels: the individual organism, the population (consisting of individuals of the same species) and the community (consisting of a greater or lesser number of species populations). At the level of the organism, ecology deals with how individuals are affected by" (and how they affect) their environment. At the level of the population, ecology is concerned with the presence or absence of particular species, their abundance or rarity, and with the trends and fluctuations in their numbers. Community ecology then deals with the composition and organization of ecological communities." (Michael Begon et al, "Ecology: From individuals to ecosystems", 2006)

"The butterfly effect demonstrates that complex dynamical systems are highly responsive and interconnected webs of feedback loops. It reminds us that we live in a highly interconnected world. Thus our actions within an organization can lead to a range of unpredicted responses and unexpected outcomes. This seriously calls into doubt the wisdom of believing that a major organizational change intervention will necessarily achieve its pre-planned and highly desired outcomes. Small changes in the social, technological, political, ecological or economic conditions can have major implications over time for organizations, communities, societies and even nations." (Elizabeth McMillan, "Complexity, Management and the Dynamics of Change: Challenges for practice", 2008)

"As it turns out, complex networks are everywhere. Or, to be more precise, it turns out that if we model real-world situations in terms of networks, we often discover new things. What is striking, is that many real-world net- works look alike: the structure of the Internet resembles the organization of our brain, but also the organization of online social communities. Where these similarities come from is still a mystery, just as it is often very difficult to understand how certain networks were actually structured." (Maarten van Steen, "Graph Theory and Complex Networks: An Introduction", 2010)

"Political structures are excessively paternalistic, and to maintain them requires a high level of energy. The massive amounts of energy they consume are unsustainable and invite political meltdowns, bailouts, and fallout. On the other hand, proponents of complexity theory take the paradigm–shattering view that less is more. They understand that, paradoxically enough, the complexity of simplicity is the key to the emergence of systems, repeatable patterns and the social glue that holds community together and creates order. Anyone can make simplicity complicated; it takes a true genius to make the complicated simple." (Lawrence K Samuels, "Defense of Chaos", 2013)

"These nature-inspired algorithms gradually became more and more attractive and popular among the evolutionary computation research community, and together they were named swarm intelligence, which became the little brother of the major four evolutionary computation algorithms." (Yuhui Shi, "Emerging Research on Swarm Intelligence and Algorithm Optimization", Information Science Reference, 2014)

"The concept of temporal graphs is useful in all the real-world problems that can be represented as a graph, where the nodes and edges of the graph may change over time. For example, temporal graphs are extensively applied in modeling social networks. By capturing the evolving relationships between individuals, temporal graphs enable a more accurate representation of social dynamics. This is particularly useful for predicting changes in friendships, community structures, and the information diffusion over time." (Aldo Marzullo et al, "Graph Machine Learning" 2nd Ed., 2025)

📓On Literature: On Communities (From Fiction to Science-Fiction)

"In such a universe as this what significance could there be in our fortuitous, our frail, our evanescent community?" (Olaf Stapledon, "Star Maker", 1937)

"A man is morally responsible to his community. That’s a good idea. But his community is also morally responsible to him." (Philip K Dick, "The Man Who Japed", 1956)

"Science fiction is the branch of literature that deals with the effects of change on people in the real world as it can be projected into the past, the future, or to distant places. It often concerns itself with scientific or technological change, and it usually involves matters whose importance is greater than the individual or the community; often civilization or the race itself is in danger." (James Gunn, "Road to Science Fiction" Vol. 2, 1979)

"I think that most of us, anyway, read these stories that we know are not 'true' because we're hungry for another kind of truth: the mythic truth about human nature in general, the particular truth about those life-communities that define our own identity, and the most specific truth of all: our own self-story. Fiction, because it is not about someone who lived in the real world, always has the possibility of being about oneself." (Orson Scott Card, "Ender’s Game", [introduction] 1985)

"Universities are meant to pass the torch of civilization, not just download data into student skulls, and the values of the academic community are strongly at odds with those of all would-be information empires. Teachers at all levels, from kindergarten up, have proven to be shameless and persistent software and data pirates. Universities do not merely ‘leak information' but vigorously broadcast free thought." (Bruce Sterling, "The Hacker Crackdown", 1992)

"Here is the truth. What human life is, what it’s for, what we do, is create communities." (Orson Scott Card, "Pastwatch: The Redemption of Christopher Columbus", 1996)

"We need to bridge our sense of loneliness and disconnection with a sense of community and continuity even if we must manufacture it from our time on the Web and our use of calling cards to connect long distance. We must log on somewhere, and if it is only in cyberspace, that is still far better than nowhere at all." (Julia Cameron, "God is No Laughing Matter", 2001)

"Human evolution is driven by community needs […]. How is that possible, since genetic information is passed only by and to individuals?" (Orson Scott Card, "First Meetings in Ender's Universe", 2002)

"Most human communities demand anti-survival behavior from large numbers of their members." (Orson Scott Card, "First Meetings in Ender's Universe", 2002)

"That would be true […] and indeed is true in the main, except that there are only a few types of human communities that actually survive long enough to improve the chances of individual survival." (Orson Scott Card, "First Meetings in Ender's Universe", 2002)

"The real training ground for leadership is in the game." (Orson Scott Card, "First Meetings in Ender's Universe", 2002)

"There are community traits that promote survival of the individual, and individual traits that promote the survival of the community." (Orson Scott Card, "First Meetings in Ender's Universe", 2002)

On Scientific Communities

"A theoretical science unaware that those of its constructs considered relevant and momentous are destined eventually to be framed in concepts and words that have a grip on the educated community and become part and parcel of the general world picture - a theoretical science, I say, where this is forgotten, and where the initiated continue musing to each other in terms that are, at best, understood by a small group of close fellow travelers, will necessarily be cut off from the rest of cultural mankind; in the long run it is bound to atrophy and ossify however virulently esoteric chat may continue within its joyfully isolated groups of experts." (Erwin Schrödinger, "Are There Quantum Jumps?", The British Journal for the Philosophy of Science Vol. 3, 1952)

"A theoretical science unaware that those of its constructs considered relevant and momentous are destined eventually to be framed in concepts and words that have a grip on the educated community and become part and parcel of the general world picture - a theoretical science [...]" (Erwin Schrödinger, "Are There Quantum Jumps?", The British Journal for the Philosophy of Science Vol. 3, 1952)

"The subject matter of the scientist is a crowd of natural events at all times; he presupposes that this crowd is not real but apparent, and seeks to discover the true place of events in the system of nature. The subject matter of the poet is a crowd of historical occasions of feeling recollected from the past; he presupposes that this crowd is real but should not be, and seeks to transform it into a community. Both science and art are primarily spiritual activities, whatever practical applications may be derived from their results. Disorder, lack of meaning, are spiritual not physical discomforts, order and sense spiritual not physical satisfactions." (Wystan H Auden, "The Dyer’s Hand and Other Essays", 1965)

"Scientific knowledge is not created solely by the piecemeal mining of discrete facts by uniformly accurate and reliable individual scientific investigations. The process of criticism and evaluation, of analysis and synthesis, are essential to the whole system. It is impossible for each one of us to be continually aware of all that is going on around us, so that we can immediately decide the significance of every new paper that is published. The job of making such judgments must therefore be delegated to the best and wisest among us, who speak, not with their own personal voices, but on behalf of the whole community of Science. […] It is impossible for the consensus - public knowledge - to be voiced at all, unless it is channeled through the minds of selected persons, and restated in their words for all to hear." (John M Ziman, "Public Knowledge: An Essay Concerning the Social Dimension of Science", 1968)

"A scientist should not cheat or falsify data or quote out of context or do any other thing that is intellectually dishonest. Of course, as always, some individuals fail; but science as a whole disapproves of such action. Indeed, when transgressors are detected, they are usually expelled from the community." (Michael Ruse, "Response to the Commentary: Pro Judice", Science, Technology and Human Values Vol. 7" (41), 1982)

"A theory is only ‘true’ for as long as the majority of the scientific community maintain the view that the theory is the one best able to explain the observations." (Jim Baggott, "The Meaning of Quantum Theory", 1992)

"It is in the nature of theoretical science that there can be no such thing as certainty. A theory is only ‘true’ for as long as the majority of the scientific community maintain the view that the theory is the one best able to explain the observations." (Jim Baggott,"The Meaning of Quantum Theory", 1992)

"There are many possible definitions of chaos. In fact, there is no general agreement within the scientific community as to what constitutes a chaotic dynamical system." (Robert L Devaney, "A First Course in Chaotic Dynamical Systems: Theory and Experiment", 1992)

"In the new systems thinking, the metaphor of knowledge as a building is being replaced by that of the network. As we perceive reality as a network of relationships, our descriptions, too, form an interconnected network of concepts and models in which there are no foundations. For most scientists such a view of knowledge as a network with no firm foundations is extremely unsettling, and today it is by no means generally accepted. But as the network approach expands throughout the scientific community, the idea of knowledge as a network will undoubtedly find increasing acceptance." (Fritjof Capra," The Web of Life: a new scientific understanding of living systems", 1996)

🪸On Systems Thinking: On Communities

"Unlike its predecessor, the new cybernetics concerns itself with the interaction of autonomous political actors and subgroups, and the practical and reflexive consciousness of the subjects who produce and reproduce the structure of a political community. A dominant consideration is that of recursiveness, or self-reference of political action both with regards to the expression of political consciousness and with the ways in which systems build upon themselves." (Peter Harries-Jones, "The Self-Organizing Policy: An Epistemological Analysis of Political Life by Laurent Dobuzinskis, Canadian Journal of Political Science 21 (2), 1988)

"In the new systems thinking, the metaphor of knowledge as a building is being replaced by that of the network. As we perceive reality as a network of relationships, our descriptions, too, form an interconnected network of concepts and models in which there are no foundations. For most scientists such a view of knowledge as a network with no firm foundations is extremely unsettling, and today it is by no means generally accepted. But as the network approach expands throughout the scientific community, the idea of knowledge as a network will undoubtedly find increasing acceptance." (Fritjof Capra, "The Web of Life: a new scientific understanding of living systems", 1996)

"Understanding ecological interdependence means understanding relationships. It requires the shifts of perception that are characteristic of systems thinking - from the parts to the whole, from objects to relationships, from contents to patterns. [...]  Nourishing the community means nourishing those relationships." (Fritjof Capra, "The Web of Life: A New Scientific Understanding of Living Systems", 1996)

"What is sustained in a sustainable community is not economic growth, development, market share, or competitive advantage, but the entire web of life on which our long-term survival depends. In other words, a sustainable community is designed in such a way that its ways of life, businesses, economy, physical structures, and technologies do not interfere with nature’s inherent ability to sustain life." (Fritjof Capra, "Ecoliteracy: The Challenge for Education in the Next Century", 1999)

"The living world can be viewed as a biological hierarchy that starts with subcellular particles, and continues up through cells, tissues and organs. Ecology deals with the next three levels: the individual organism, the population (consisting of individuals of the same species) and the community (consisting of a greater or lesser number of species populations). At the level of the organism, ecology deals with how individuals are affected by" (and how they affect) their environment. At the level of the population, ecology is concerned with the presence or absence of particular species, their abundance or rarity, and with the trends and fluctuations in their numbers. Community ecology then deals with the composition and organization of ecological communities." (Michael Begon et al, "Ecology: From individuals to ecosystems", 2006)

"The butterfly effect demonstrates that complex dynamical systems are highly responsive and interconnected webs of feedback loops. It reminds us that we live in a highly interconnected world. Thus our actions within an organization can lead to a range of unpredicted responses and unexpected outcomes. This seriously calls into doubt the wisdom of believing that a major organizational change intervention will necessarily achieve its pre-planned and highly desired outcomes. Small changes in the social, technological, political, ecological or economic conditions can have major implications over time for organizations, communities, societies and even nations." (Elizabeth McMillan, "Complexity, Management and the Dynamics of Change: Challenges for practice", 2008)

"Community formation is common in all types of networks, and identifying them is essential for evaluating group behavior and emergent phenomena. The general principle in finding communities is that its members will have more relationships within the group than with nodes outside their group. Identifying these related sets reveals clusters of nodes, isolated groups, and network structure. This information helps infer similar behavior or preferences of peer groups, estimate resiliency, find nested relationships, and prepare data for other analyses. Community detection algorithms are also commonly used to produce network visualization for general inspection." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"When using community detection algorithms, be conscious of the density of the relationships. If the graph is very dense, you may end up with all nodes congregating in one or just a few clusters. You can counteract this by filtering by degree, relationship weights, or similarity metrics. On the other hand, if the graph is too sparse with few connected nodes, you may end up with each node in its own cluster. In this case, try to incorporate additional relationship types that carry more relevant information." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

🥀On Style in Science

"I think that science may be styled the knowledge of universals, or abstract wisdom; and art is science reduced to practice - or science is reason, and art the mechanism of it - and may be called practical science. Science, in fine, is the theorem, and art the problem." (Richard Griffith, 1779) [attributed to Laurence Sterne] 

"Both science and art form in the course of the centuries a human language by which we can speak about the more remote parts of reality, and the coherent sets of concepts as well as the different styles of art are different words or groups of words in this language." (Werner K Heisenberg, "Physics and Philosophy", 1958)

"When terms [...] evolve and change definition with time; and when the social reality which terms are intended to organize and render intelligible is also seen to be in flux, capturing the truth in a net of words becomes a matter of intuition and style more than of any scientific method that can be replicated by others and made to achieve the same result every time someone asks the same question, or undertakes the same operations." (William H McNeill, "Discrepancies among the Social Sciences", 1981)

"The body of mathematics to which the calculus gives rise embodies a certain swashbuckling style of thinking, at once bold and dramatic, given over to large intellectual gestures and indifferent, in large measure, to any very detailed description of the world. It is a style that has shaped the physical but not the biological sciences, and its success in Newtonian mechanics, general relativity and quantum mechanics is among the miracles of mankind. But the era in thought that the calculus made possible is coming to an end. Everyone feels this is so and everyone is right." (David Berlinski, "A Tour of the Calculus", 1995)

"Modeling involves a style of scientific thinking in which the argument is structured by the model, but in which the application is achieved via a narrative prompted by an external fact, an imagined event or question to be answered." (Uskali Mäki, "Fact and Fiction in Economics: Models, Realism and Social Construction", 2002)

"[...] the scientific models of concrete things are symbolic rather than iconic: they are systems of propositions, not pictures. Besides, such models are seldom if ever completely accurate, if only because they involve more or less brutal simplifications, such as pretending that a metallic surface is smooth, a crystal has no impurities, a biopopulation has a single predator, or a market is in equilibrium. These are all fictions. However, they are stylizations rather than wild fantasies. Hence, introducing and using them to account for real existents does not commit us to fictionism, just as defending the role of experience need not make us empiricists, nor is admitting the role of intuition enough to qualify as intuitionist." (Mario Bunge, "Chasing Reality: Strife over Realism", 2006)

"Scientists reach their conclusions for the damnedest of reasons: intuition, guesses, redirections after wild-goose chases, all combing with a dollop of rigorous observation and logical reasoning to be sure […] This messy and personal side of science should not be disparaged, or covered up, by scientists for two major reasons. First, scientists should proudly show this human face to display their kinship with all other modes of creative human thought […] Second, while biases and references often impede understanding, these mental idiosyncrasies may also serve as powerful, if quirky and personal, guides to solutions." (Stephen J Gould,"Dinosaur in a Haystack: Reflections in natural history", 1995)

🥀On Style in Mathematics

"The figures which excite in us the ideas of beauty seem to be those in which there is uniformity amidst variety. […] What we call beautiful in objects, to speak in the mathematical style, seems to be in compound ratio of uniformity and variety: so that where the uniformity of bodies is equal, the beauty is as the variety; and where the variety is equal, the beauty is as the uniformity." (Francis Hutcheson,"An Inquiry Concerning Beauty, Order, Harmony, Design", 1973)

"Numeracy has two facets-reading and writing, or extracting numerical information and presenting it. The skills of data presentation may at first seem ad hoc and judgemental, a matter of style rather than of technology, but certain aspects can be formalized into explicit rules, the equivalent of elementary syntax." (Andrew Ehrenberg,"Rudiments of Numeracy", Journal of Royal Statistical Society, 1977)

"Moreover, ‘fact’ doesn’t mean ‘absolute certainty’; there ain’t no such animal in an exciting and complex world. The final proofs of logic and mathematics flow deductively from stated premises and achieve certainty only because they are NOT about the empirical world. Evolutionists make no claim for perpetual truth, though creationists often do" (and then attack us falsely for a style of argument that they themselves favor)." (Stephen J Gould, "Evolution as Fact and Theory", Discover, 1981)

"[...] probability is a style of thinking." (Richard W Hamming, "The Art of Probability for Scientists and Engineers", 1991)

"Mathematics is not just a collection of results, often called theorems; it is a style of thinking. Computing is also basically a style of thinking. Similarly, probability is a style of thinking." (Richard W Hamming, "The Art of Probability for Scientists and Engineers", 1991)

"The sequence for the understanding of mathematics may be: intuition, trial, error, speculation, conjecture, proof. The mixture and the sequence of these events differ widely in different domains, but there is general agreement that the end product is rigorous proof – which we know and can recognize, without the formal advice of the logicians. […] Intuition is glorious, but the heaven of mathematics requires much more. Physics has provided mathematics with many fine suggestions and new initiatives, but mathematics does not need to copy the style of experimental physics. Mathematics rests on proof - and proof is eternal." (Saunders Mac Lane,"Reponses to …", Bulletin of the American Mathematical Society Vol. 30" (2), 1994)

"Allowing more than two players into the game and/or postulating payoff structures in which one player's gain does not necessarily equal the other player's loss brings us much closer to the type of games played in real life. Unfortunately, it's generally the case that the closer you get to the messiness of the real world, the farther you move from the stylized and structured world of mathematics. Game theory is no exception." (John L Casti, "Five Golden Rules", 1995)

"The body of mathematics to which the calculus gives rise embodies a certain swashbuckling style of thinking, at once bold and dramatic, given over to large intellectual gestures and indifferent, in large measure, to any very detailed description of the world. It is a style that has shaped the physical but not the biological sciences, and its success in Newtonian mechanics, general relativity and quantum mechanics is among the miracles of mankind. But the era in thought that the calculus made possible is coming to an end. Everyone feels this is so and everyone is right." (David Berlinski, "A Tour of the Calculus", 1995)

"I see some parallels between the shifts of fashion in mathematics and in music. In music, the popular new styles of jazz and rock became fashionable a little earlier than the new mathematical styles of chaos and complexity theory. Jazz and rock were long despised by classical musicians, but have emerged as art-forms more accessible than classical music to a wide section of the public. Jazz and rock are no longer to be despised as passing fads. Neither are chaos and complexity theory. But still, classical music and classical mathematics are not dead. Mozart lives, and so does Euler. When the wheel of fashion turns once more, quantum mechanics and hard analysis will once again be in style." (Freeman J Dyson, "Book Review of ‘Nature’s Numbers’", The American Mathematical Monthly, Vol. 103 (7), 1996)

"Physicists have been drawn to elegant mathematical relationships that bind the subject together with economy and style, melding disparate qualities in subtle and harmonious ways. But this is to import a new factor into the argument - questions of aesthetics and taste. We are then on shaky ground indeed. It may be that M theory looks beautiful to its creators, but ugly to N theorists, who think that their theory is the most elegant. But then the O theorists disagree with both groups [...]" (Paul C W Davies, "Cosmic Jackpot: Why Our Universe Is Just Right for Life", 2007) 

💠On Problem Solving: On Elegance

"It is true that not every geometric construction is elegant, for each particular problem has its own refinements. It is also true that [that construction] is preferred to any other that makes clear not the structure of a work from an equation but the equation from the structure; thus the structure demonstrates itself. So a skillful geometer, although thoroughly versed in analysis, conceals the fact and, while thinking about the accomplishment of his work, sheds light on and explains his problem Then, as an aid to the arithmeticians, he sets out and demonstrates his theorem with the equation or proportion he sees in it." (François Viète, "On the Meaning and Components of Analysis and on Matters Useful to Zetetics", 1591)

"The problem of distinguishing prime numbers from composite numbers, and of resolving the latter into their prime factors, is known to be one of the most important and useful in arithmetic. It has engaged the industry and wisdom of ancient and modern geometers to such an extent that it would be superfluous to discuss the problem at length. Nevertheless we must confess that all methods that have been proposed thus far are either restricted to very special cases or are so laborious and difficult that even for numbers that do not exceed the limits of tables constructed by estimable men, they try the patience of even the practiced calculator. And these methods do not apply at all to larger numbers. […] Further, the dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated." (Carl F Gauss, "Disquisitiones Arithmeticae” [“Arithmetical Researches”], 1801)

"To appreciate the living spirit rather than the dry bones of mathematics, it is necessary to inspect the work of a master at first hand.Textbooks and treatises are an unavoidable evil [...] The very crudities of the first attack on a significant problem by a master are more illuminating than all the pretty elegance of the standard texts which has been won at the cost of perhaps centuries of finicky polishing." (Eric T Bell, "Mathematics: Queen and Servant of Science", 1951)

"Mathematical problems, or puzzles, are important to real mathematics (like solving real-life problems), just as fables, stories, and anecdotes are important to the young in understanding real life. Mathematical problems are ‘sanitized’ mathematics, where an elegant solution has already been found (by someone else, of course), the question is stripped of all superfluousness and posed in an interesting and (hopefully) thought-provoking way. If mathematics is likened to prospecting for gold, solving a good mathematical problem is akin to a ‘hide-and-seek’ course in gold-prospecting: you are given a nugget to find, and you know what it looks like, that it is out there somewhere, that it is not too hard to reach, that it is unearthing within your capabilities, and you have conveniently been given the right equipment (i.e. data) to get it. It may be hidden in a cunning place, but it will require ingenuity rather than digging to reach it." (Terence Tao, "Solving Mathematical Problems: A Personal Perspective", 2006)

"This is what it means to do mathematics. To make a discovery (by whatever means, including playing around with physical models like paper, string, and rubber bands), and then to explain it in the simplest and most elegant way possible. This is the art of it, and this is why it is so challenging and fun." (Paul Lockhart, "Measurement", 2012)

"What makes a great mathematical problem great? Intellectual depth, combined with simplicity and elegance. Plus: it has to be hard. Anyone can climb a hillock; Everest is another matter entirely. A great problem is usually simple to state, although the terms required may be elementary or highly technical." (Ian Stewart, "Symmetry: A Very Short Introduction", 2013)

🦋On Chaos Theory: On Paths

"The term chaos is used in a specific sense where it is an inherently random pattern of behaviour generated by fixed inputs into deterministic" (that is fixed) rules" (relationships). The rules take the form of non-linear feedback loops. Although the specific path followed by the behaviour so generated is random and hence unpredictable in the long-term, it always has an underlying pattern to it, a 'hidden' pattern, a global pattern or rhythm. That pattern is self-similarity, that is a constant degree of variation, consistent variability, regular irregularity, or more precisely, a constant fractal dimension. Chaos is therefore order" (a pattern) within disorder" (random behaviour)." (Ralph D Stacey, "The Chaos Frontier: Creative Strategic Control for Business", 1991)

"One reason nature pleases us is its endless use of a few simple principles: the cube-square law; fractals; spirals; the way that waves, wheels, trig functions, and harmonic oscillators are alike; the importance of ratios between small primes; bilateral symmetry; Fibonacci series, golden sections, quantization, strange attractors, path-dependency, all the things that show up in places where you don’t expect them [...] these rules work with and against each other ceaselessly at all levels, so that out of their intrinsic simplicity comes the rich complexity of the world around us. That tension - between the simple rules that describe the world and the complex world we see - is itself both simple in execution and immensely complex in effect. Thus exactly the levels, mixtures, and relations of complexity that seem to be hardwired into the pleasure centers of the human brain - or are they, perhaps, intrinsic to intelligence and perception, pleasant to anything that can see, think, create? - are the ones found in the world around us." (John Barnes, "Mother of Storms", 1994)

"Complexity is the characteristic property of complicated systems we don’t understand immediately. It is the amount of difficulties we face while trying to understand it. In this sense, complexity resides largely in the eye of the beholder - someone who is familiar with s.th. often sees less complexity than someone who is less familiar with it. [...] A complex system is created by evolutionary processes. There are multiple pathways by which a system can evolve. Many complex systems are similar, but each instance of a system is unique." (Jochen Fromm, The Emergence of Complexity, 2004)

"Chaos can leave statistical footprints that look like noise. This can arise from simple systems that are deterministic and not random. [...] The surprising mathematical fact is that most systems are chaotic. Change the starting value ever so slightly and soon the system wanders off on a new chaotic path no matter how close the starting point of the new path was to the starting point of the old path. Mathematicians call this sensitivity to initial conditions but many scientists just call it the butterfly effect. And what holds in math seems to hold in the real world - more and more systems appear to be chaotic." (Bart Kosko, "Noise", 2006)

"'Chaos' refers to systems that are very sensitive to small changes in their inputs. A minuscule change in a chaotic communication system can flip a 0 to a 1 or vice versa. This is the so-called butterfly effect: Small changes in the input of a chaotic system can produce large changes in the output. Suppose a butterfly flaps its wings in a slightly different way. can change its flight path. The change in flight path can in time change how a swarm of butterflies migrates." (Bart Kosko, "Noise", 2006)

⚛️On Physics: On Paths

"The state of a system at a given moment depends on two things - its initial state, and the law according to which that state varies. If we know both this law and this initial state, we have a simple mathematical problem to solve, and we fall back upon our first degree of ignorance. Then it often happens that we know the law and do not know the initial state. It may be asked, for instance, what is the present distribution of the minor planets? We know that from all time they have obeyed the laws of Kepler, but we do not know what was their initial distribution. In the kinetic theory of gases we assume that the gaseous molecules follow rectilinear paths and obey the laws of impact and elastic bodies; yet as we know nothing of their initial velocities, we know nothing of their present velocities. The calculus of probabilities alone enables us to predict the mean phenomena which will result from a combination of these velocities. This is the second degree of ignorance. Finally it is possible, that not only the initial conditions but the laws themselves are unknown. We then reach the third degree of ignorance, and in general we can no longer affirm anything at all as to the probability of a phenomenon. It often happens that instead of trying to discover an event by means of a more or less imperfect knowledge of the law, the events may be known, and we want to find the law; or that, instead of deducing effects from causes, we wish to deduce the causes." (Henri Poincaré, "Science and Hypothesis", 1902)

"We frequently find that nature acts in such a way as to minimize certain magnitudes. The soap film will take the shape of a surface of smallest area. Light always follows the shortest path, that is, the straight line, and, even when reflected or broken, follows a path which takes a minimum of time. In mechanical systems we find that the movements actually take place in a form which requires less effort in a certain sense than any other possible movement would use. There was a period, about 150 years ago, when physicists believed that the whole of physics might be deduced from certain minimizing principles, subject to calculus of variations, and these principles were interpreted as tendencies - so to say, economical tendencies of nature. Nature seems to follow the tendency of economizing certain magnitudes, of obtaining maximum effects with given means, or to spend minimal means for given effects." (Karl Menger, "What Is Calculus of Variations and What Are Its Applications?" [James R Newman, "The World of Mathematics" Vol. II], 1956)

"Experimental physicists [...] walk a narrow path with pitfalls on either side. If we spend all our time developing equipment, we risk the appellation of 'plumber', and if we merely use the tools developed by others, we risk the censure of our peers for being parasitic." (Luis W Alvarez, "Recent Developments in Particle Physics", [Nobel] 1968)

"Although we expect to find eddies in turbulent flow, we do not know when any specific eddy will come into being or die away . We cannot yet predict how eddies interact. Similarly, we know as a general rule that any particle within a turbulent flow gets knocked about in an aimless fashion by the swirls, so that it describes an erratic meandering path, but at any given moment we cannot predict the precise location or velocity of the particle." (Peter B Stevens, "Patterns in Nature", 1974)

"The Feynman method has the virtue that it provides us with a vivid picture of nature’s quantum trickery at work. The idea is that the path of a particle through space is not generally well defined in quantum mechanics. […] So when an electron arrives at a point in space - say a target screen - many different histories must be integrated together to create this one event. Feynman’s so-called path-integral, or sum-over-histories approach to quantum mechanics, set this remarkable concept out as a mathematical procedure. It remained more or less a curiosity for many years, but as physicists pushed quantum mechanics to its limits - applying it to gravitation and even cosmology - so the Feynman approach turned out to offer the best calculational tool for describing a quantum universe. History may well judge that, among his many outstanding contributions to physics, the path-integral formulation of quantum mechanics is the most significant." (Paul Davies , [Introduction to Richard P Feynman's "Six Easy Pieces"] 1994)

"What was clearly useful was the use of diagrams to prove certain results either in algebraic topology, homological algebra or algebraic geometry. It is clear that doing category theory, or simply applying category theory, implies manipulating diagrams: constructing the relevant diagrams, chasing arrows by going via various paths in diagrams and showing they are equal, etc. This practice suggests that diagram manipulation, or more generally diagrams, constitutes the natural syntax of category theory and the category-theoretic way of thinking. Thus, if one could develop a formal language based on diagrams and diagrams manipulation, one would have a natural syntactical framework for category theory. However, moving from the informal language of categories which includes diagrams and diagrammatic manipulations to a formal language based on diagrams and diagrammatic manipulations is not entirely obvious." (Jean-Pierre Marquis, "From a Geometrical Point of View: A Study of the History and Philosophy of Category Theory", 2009)

🕸️On Graph Theory: On Paths

"Euler's proof that in Königsberg there is no path crossing all seven bridges only once was based on a simple observation. Nodes with an odd number of links must be either the starting or the end point of the journey. A continuous path that goes through all the bridges can have only one starting and one end point. Thus, such a path cannot exist on a graph that has more than two nodes with an odd number of links. As the Königsberg graph had four such nodes, one could not find the desired path." (Albert-László Barabási, "Linked: How Everything Is Connected to Everything Else and What It Means for Business, Science, and Everyday Life", 2002)

"Average path length reflects the global structure; it depends on the way the entire network is connected, and cannot be inferred from any local measurement. Clustering reflects the local structure; it depends only on the interconnectedness of a typical neighborhood, the inbreeding among nodes tied to a common center. Roughly speaking, path length measures how big the network is. Clustering measures how incestuous it is." (Steven Strogatz, "Sync: The Emerging Science of Spontaneous Order", 2003)

"The concept of path-connectedness, in which it is required that it be possible to reach any point in the space from any other point along a continuous path is necessary for the notion of fundamental group. This approach is especially useful in studying connectivity properties from an algebraic point of view, e.g., via homotopy theory." (D Chatterjee, "Topology: General & Algebraic", 2003)

"If a network is solely composed of neighborhood connections, information must traverse a large number of connections to get from place to place. In a small-world network, however, information can be transmitted between any two nodes using, typically, only a small number of connections. In fact, just a small percentage of random, long-distance connections is required to induce such connectivity. This type of network behavior allows the generation of 'six degrees of separation' type results, whereby any agent can connect to any other agent in the system via a path consisting of only a few intermediate nodes." (John H Miller & Scott E Page, "Complex Adaptive Systems", 2007)

"A graph enables us to visualize a relation over a set, which makes the characteristics of relations such as transitivity and symmetry easier to understand. […] Notions such as paths and cycles are key to understanding the more complex and powerful concepts of graph theory. There are many degrees of connectedness that apply to a graph; understanding these types of connectedness enables the engineer to understand the basic properties that can be defined for the graph representing some aspect of his or her system. The concepts of adjacency and reachability are the first steps to understanding the ability of an allocated architecture of a system to execute properly." (Dennis M Buede, "The Engineering Design of Systems: Models and methods", 2009)

"A random walk, in general, is sometimes described as being similar to how a drunk person traverses a city. They know what direction or end point they want to reach but may take a very circuitous route to get there. The algorithm starts at one node and somewhat randomly follows one of the relationships forward or backward to a neighbor node. It then does the same from that node and so on, until it reaches the set path length. ('We say somewhat randomly because the number of relationships a node has, and its neighbors have, influences the probability a node will be walked through.)'" (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Betweenness Centrality makes the assumption that all communication between nodes happens along the shortest path and with the same frequency, which isn’t always the case in real life. Therefore, it doesn’t give us a perfect view of the most influential nodes in a graph, but rather a good representation." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"A widely adopted technique for solving the data sparsity issue and the cold-start problem is based on graph representation, navigation, and processing. Graph navigation methods (like the pathfinding example [...]) and graph algorithms (such as PageRank) are applied to fill some gaps and create a denser representation of [a] dataset." (Alessandro Negro, "Graph-Powered Machine Learning", 2021)

Mark Needham - Collected Quotes

 "A random walk, in general, is sometimes described as being similar to how a drunk person traverses a city. They know what direction or end point they want to reach but may take a very circuitous route to get there. The algorithm starts at one node and somewhat randomly follows one of the relationships forward or backward to a neighbor node. It then does the same from that node and so on, until it reaches the set path length. 'We say somewhat randomly because the number of relationships a node has, and its neighbors have, influences the probability a node will be walked through.)'" (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Adding graph features and context improves predictions, especially in situations where connections matter. [...] Unfortunately, many machine learning approaches today miss a lot of rich contextual information. This stems from ML’s reliance on input data built from tuples, leaving out a lot of predictive relationships and network data. Furthermore, contextual information is not always readily available or is too difficult to access and process. Even finding connections that are four or more hops away can be a challenge at scale for traditional methods. Using graphs, we can more easily reach and incorporate connected data." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"At the most abstract level, graph analytics is applied to forecast behavior and prescribe action for dynamic groups. Doing this requires understanding the relationships and structure within the group. Graph algorithms accomplish this by examining the overall nature of networks through their connections. With this approach, you can understand the topology of connected systems and model their processes." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Betweenness Centrality makes the assumption that all communication between nodes happens along the shortest path and with the same frequency, which isn’t always the case in real life. Therefore, it doesn’t give us a perfect view of the most influential nodes in a graph, but rather a good representation." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Centrality algorithms are used to understand the roles of particular nodes in a graph and their impact on that network. They’re useful because they identify the most important nodes and help us understand group dynamics such as credibility, accessibility, the speed at which things spread, and bridges between groups." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Community formation is common in all types of networks, and identifying them is essential for evaluating group behavior and emergent phenomena. The general principle in finding communities is that its members will have more relationships within the group than with nodes outside their group. Identifying these related sets reveals clusters of nodes, isolated groups, and network structure. This information helps infer similar behavior or preferences of peer groups, estimate resiliency, find nested relationships, and prepare data for other analyses. Community detection algorithms are also commonly used to produce network visualization for general inspection." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Feature extraction is a way to distill large volumes of data and attributes down to a set of representative descriptive attributes. The process derives numerical values (features) for distinctive characteristics or patterns in input data so that we can differentiate categories in other data. It’s used when data is difficult for a model to analyze directly - perhaps because of size, format, or the need for incidental comparisons. Feature selection is the process of determining the subset of extracted features that are most important or influential to a target goal. It’s used to surface predictive importance as well as for efficiency." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Graph algorithms provide one of the most potent approaches to analyzing connected data because their mathematical calculations are specifically built to operate on relationships. They describe steps to be taken to process a graph to discover its general qualities or specific quantities. Based on the mathematics of graph theory, graph algorithms use the relationships between nodes to infer the organization and dynamics of complex systems. Network scientists use these algorithms to uncover hidden infomation, test hypotheses, and make predictions about behavior." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Graph embedding is the representation of the nodes and relationships in a graph asfeature vectors. [...] Graph embedding uses graph data slightly differently than in connected feature extraction. It enables us to represent entire graphs, or subsets of graph data, in a numerical format ready for machine learning tasks. This is especially useful for unsupervised learning, where the data is not categorized because it pulls in more contextual information through relationships. Graph embedding is also useful for data exploration, computing similarity between entities, and reducing dimensionality to aid in statistical analysis." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"In classic graph theory, an acyclic graph that is undirected is called a tree. In computer science, trees can also be directed. A more inclusive definition would be a graph where any two nodes are connected by only one path. Trees are significant for understanding graph structures and many algorithms. They play a key role in designing networks, data structures, and search optimizations to improve categorization or organizational hierarchies." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Keep in mind that centrality measures represent the importance of a node in comparison to other nodes. Centrality is a ranking of the potential impact of nodes, not a measure of actual impact. For example, you might identify the two people with the highest centrality in a network, but perhaps policies or cultural norms are in play that actually shift influence to others. Quantifying actual impact is an active research area to develop additional influence metrics." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Machine learning is not artificial intelligence (AI), but a method for achieving AI. ML uses algorithms to train software through specific examples and progressive improvements based on expected outcome - without explicit programming of how to accomplish these better results. Training involves providing a lot of data to a model and enabling it to learn how to process and incorporate that information." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Make it a habit to run Connected Components to test whether a graph is connected as a preparatory step for general graph analysis. Performing this quick test can avoid accidentally running algorithms on only one disconnected component of a graph and getting incorrect results." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Sometimes the most important cog in the system is not the one with the most overt power or the highest status. Sometimes it’s the middlemen that connect groups or the brokers who the most control over resources or the flow of information. Betweenness Centrality is a way of detecting the amount of influence a node has over the flow of information or resources in a graph. It is typically used to find nodes that serve as a bridge from one part of a graph to another." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Putting together the right mix of features can increase accuracy because it fundamentally influences how our models learn. Because even modest improvements can make a significant difference [...]. Connected features are features extracted from the structure of the data. These features can be derived from graph-local queries based on parts of the graph surrounding a node, or graph-global queries that use graph algorithms to identify predictive elements within data based on relationships for connected feature extraction." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Use Degree Centrality if you’re attempting to analyze influence by looking at the number of incoming and outgoing relationships, or find the 'popularity' of individual nodes. It works well when you’re concerned with immediate connectedness or near-term probabilities. However, Degree Centrality is also applied to global analysis when you want to evaluate the minimum degree, maximum degree, mean degree, and standard deviation across the entire graph." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Using graphs for connected feature extraction can significantly improve our predictions. The ideal graph features and algorithms vary depending on the attributes of the data, including the network domain and graph shape. We suggest first considering the predictive elements within your data and testing hypotheses with different types of connected features before fine-tuning." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"When using community detection algorithms, be conscious of the density of the relationships. If the graph is very dense, you may end up with all nodes congregating in one or just a few clusters. You can counteract this by filtering by degree, relationship weights, or similarity metrics. On the other hand, if the graph is too sparse with few connected nodes, you may end up with each node in its own cluster. In this case, try to incorporate additional relationship types that carry more relevant information." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)

"Without peripheral and related information, solutions that attempt to predict behavior or make recommendations for varying circumstances require more exhaustive training and prescriptive rules. This is partly why AI is good at specific, well-defined tasks, but struggles with ambiguity. Graph-enhanced ML can help fill in that missing contextual information that is so important for better decisions." (Mark Needham & Amy E Hodler, "Graph Algorithms: Practical Examples in Apache Spark and Neo4j", 2019)