搜索结果: 1-15 共查到“数学 directed”相关记录21条 . 查询时间(0.056 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Some Exact Formulas of the KPZ Fixed Point and Directed Landscape
KPZ不动点 定向景观 精确公式
2023/4/18
In the past twenty years, there have been huge developments in the study of the Kardar-Parisi-Zhang (KPZ) universality class, which is a broad class of physical and probabilistic models including one-...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markov chain Markov equivalence class
2016/1/20
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
Chip-Firing and Rotor-Routing on Directed Graphs
Chip-Firing Rotor-Routing Directed Graphs
2015/8/14
We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing op...
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS SPANNING TREES DIRECTED LINE GRAPHS
2015/8/14
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markovchain Markov equivalence class.
2012/11/23
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
Fitting directed acyclic graphs with latent nodes as finite mixtures models, with application to education transmission
Extendedlatentclassmodels mixturemodels structuralequations causal inference
2012/11/22
This paper describes an efficient EM algorithm for maximum likelihood estimation of a system of nonlinear structural equations corresponding to a directed acyclic graph model that can contain an arbit...
Directed random walk on an oriented percolation cluster
Random walk, dynamical random environment, oriented percolation, supercritical cluster, central limit theorem in random environment
2012/4/16
We consider directed random walk on the infinite percolation cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the `ancestral lineage' of an individu...
Continuous-time distributed convex optimization on directed graphs
Continuous-time convex optimization directed graphs Optimization and Control
2012/4/17
This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works ...
Normalized graph Laplacians for directed graphs
Normalized graph Laplacians directed graphs Combinatorics
2011/9/20
Abstract: We consider the normalized Laplacian for directed graphs with positive and negative edge weights. We derive basic spectral properties of the normalized Laplacian and identify extremal eigenv...
Reconstructing directed networks for better synchronization
synchronization Reconstructing directed networks strategies
2011/7/7
In this paper, we studied the strategies to enhance synchronization on directed networks by manipulating a fixed number of links. We proposed a centrality-based reconstructing (CBR) method, where the ...
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
sufficient condition existence anti-directed 2-factor
2011/1/18
Let D be a directed graph with vertex set V and order n. An anti-directed (hamiltonian) cycle H in D is a (hamiltonian) cycle in the graph underlying D such that no pair of consecutive arcs in H form ...
Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure.
Improved Approximation for the Directed Spanner Problem
Approximation Directed Spanner Problem
2011/3/3
We prove that the size of the sparsest directed k-spanner of a graph can be approximated in polynomial time to within a factor of ˜O(√n), for all k ≥ 3. This improves the ˜O(n2/3)-
approxim...
Extension of the Blahut-Arimoto algorithm for maximizing directed information
Extension of the Blahut-Arimoto algorithm directed information
2011/2/25
We extend the Blahut-Arimoto algorithm for maximizing Massey’s directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a de...
Imbalances in directed multigraphs
digraph imbalance outdegree indegree directed multigraph
2011/2/28
In a directed multigraph, the imbalance of a vertex vi is defined as bvi = d+ vi − d− vi .