Search results for " graph"
showing 10 items of 1277 documents
Temporal aggregation in chain graph models
2005
The dependence structure of an observed process induced by temporal aggregation of a time evolving hidden spatial phenomenon is addressed. Data are described by means of chain graph models and an algorithm to compute the chain graph resulting from the temporal aggregation of a directed acyclic graph is provided. This chain graph is the best graph which covers the independencies of the resulting process within the chain graph class. A sufficient condition that produces a memory loss of the observed process with respect to its hidden origin is analyzed. Some examples are used for illustrating algorithms and results.
Extending graphical models for applications: on covariates, missingness and normality
2021
The authors of the paper “Bayesian Graphical Models for Modern Biological Applications” have put forward an important framework for making graphical models more useful in applied settings. In this discussion paper, we give a number of suggestions for making this framework even more suitable for practical scenarios. Firstly, we show that an alternative and simplified definition of covariate might make the framework more manageable in high-dimensional settings. Secondly, we point out that the inclusion of missing variables is important for practical data analysis. Finally, we comment on the effect that the Gaussianity assumption has in identifying the underlying conditional independence graph…
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
Dynamic-Interactive Graphics for Statistics (26 years later)
2014
This paper briefly reviews the history of dynamic-interactive graphicsfor statistics, introduces an example of such graphics, and provides a fewglimpses as to the current state of things and the future trends we envision.The general conclusion is that dynamic-interactive graphics for statistics arethriving more than ever as they shift from the desktop to the internet. Thus,dynamic-interactive graphics are becoming increasingly important as they: 1) provide non-experts in statistics with the means to carry out analyses on their own; and 2) teach the basic concepts of statistics to students and practitioners with low to moderate mathematics skills. Their increasingpopularity makes the lesson…
The History of ViSta: The Visual Statistics System
2012
ViSta is a project that focuses on dynamic and interactive graphics for statistics and was initiated by the late Forrest W. Young at the beginning of the 1990s. For over approximately 20 years, Forrest and other collaborators, including the authors of this article, have used ViSta for experimenting with these kinds of graphics in different settings, applying them to different scenarios of data and statistical analysis, searching to develop the right combination of features most appropriate in each case. In this time, ViSta evolved quite considerably, going through what we reckon were three different stages, namely: the initial one setting forth the foundations of ViSta; the second period wh…
Visualizing the flow of evidence in network meta-analysis and characterizing mixed treatment comparisons
2013
Network meta-analysis techniques allow for pooling evidence from different studies with only partially overlapping designs for getting a broader basis for decision support. The results are network-based effect estimates that take indirect evidence into account for all pairs of treatments. The results critically depend on homogeneity and consistency assumptions, which are sometimes difficult to investigate. To support such evaluation, we propose a display of the flow of evidence and introduce new measures that characterize the structure of a mixed treatment comparison. Specifically, a linear fixed effects model for network meta-analysis is considered, where the network estimates for two trea…
Stochastic Learning for SAT- Encoded Graph Coloring Problems
2010
The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets.
Searching for a strong double tracing in a graph
1998
Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.
Mean-field games and dynamic demand management in power grids
2013
This paper applies mean-field game theory to dynamic demand management. For a large population of electrical heating or cooling appliances (called agents), we provide a mean-field game that guarantees desynchronization of the agents thus improving the power network resilience. Second, for the game at hand, we exhibit a mean-field equilibrium, where each agent adopts a bang-bang switching control with threshold placed at a nominal temperature. At equilibrium, through an opportune design of the terminal penalty, the switching control regulates the mean temperature (computed over the population) and the mains frequency around the nominal value. To overcome Zeno phenomena we also adjust the ban…