Related papers: How to cool a graph
Modeling generative process of growing graphs has wide applications in social networks and recommendation systems, where cold start problem leads to new nodes isolated from existing graph. Despite the emerging literature in learning graph…
Heat diffusion describes the process by which heat flows from areas with higher temperatures to ones with lower temperatures. This concept was previously adapted to graph structures, whereby heat flows between nodes of a graph depending on…
A method is described for cooling conductive channels to below ambient temperature. The thermodynamic induction principle dictates that the electrically biased channel will cool if the electrical conductance decreases with temperature. The…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
The Burning Number Conjecture, that a graph on $n$ vertices can be burned in at most $\lceil \sqrt{n} \ \rceil$ rounds, has been of central interest for the past several years. Much of the literature toward its resolution focuses on two…
As the scale of networked control systems increases and interactions between different subsystems become more sophisticated, questions of the resilience of such networks increase in importance. The need to redefine classical system and…
Network (or graph) sparsification compresses a graph by removing inessential edges. By reducing the data volume, it accelerates or even facilitates many downstream analyses. Still, the accuracy of many sparsification methods, with…
We present a computational approach for estimating emotion contagion on social media networks. Built on a foundation of psychology literature, our approach estimates the degree to which the perceivers' emotional states (positive or…
One of the demanding frontiers in ultracold quantum science is identifying laser cooling schemes for complex atoms and molecules out of their vast spectra of internal states. Motivated by the prospect of expanding the set of available…
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…
Complex networks are the representative graphs of interactions in many complex systems. Usually, these interactions are abstractions of the communication/diffusion channels between the units of the system. Real complex networks, e.g.…
Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato, Janssen, and Roshanbin [Burning a Graph as a Model of Social Contagion, Lecture Notes in Computer Science 8882 (2014) 13-22]…
Online social network services provide a platform for human social interactions. Nowadays, many kinds of online interactions generate large-scale social network data. Network analysis helps to mine knowledge and pattern from the…
We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave which emanates from a set of \emph{known} nodes at an initial time, to all other \emph{unknown}…
Given a social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern…
Given a graph $G$, the optimization version of the graph burning problem seeks for a sequence of vertices, $(u_1,u_2,...,u_p) \in V(G)^p$, with minimum $p$ and such that every $v \in V(G)$ has distance at most $p-i$ to some vertex $u_i$.…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as a burning source, while fire simultaneously spreads from…
The cooling of hot electrons in graphene is the critical process underlying the operation of exciting new graphene-based optoelectronic and plasmonic devices, but the nature of this cooling is controversial. We extract the hot electron…