利用动态贝叶斯网构建基因调控网络的研究进展

构建基因调控网络是21世纪人类科学所面临的重要挑战之一。基因调控网络是一个基因组内基因相互作用而形成的关系网络,它从全基因组水平上以系统和全局的角度来研究复杂的生命现象及其本质。本文阐述了近几年来此领域的研究进展,着重介绍利用动态贝叶斯网络重构基因调控网络的若干模型,包括加权核l1模型,正则化模型、高斯混合贝叶斯网模型和自回归时间变化模型。     

Representations of Graph States with Neural Networks

Acta Mathematica Sinica, English Series - Quantum many-body problem (QMBP) has become a hot topic in high energy physics and condensed matter physics. With the exponential increasing of the...     

A Random Graph Model of Mobile Wireless Networks

We propose a time-invariable, integrated model of wireless networks working in hostile environment with obstructions and other factors causing interference. We present a new probabilistic model well suit for analysis of distributed algorithms requiring synchronous communication. The model is based on a random graph with a specific edge probability distribution, which is related to the radio wave propagation characteristics.     

图论在网络出版传播中的应用

利用图论理论研究了网络连通度与广播时间的关系问题 ,获得了网络单信息广播时间的一个界和最少时间广播网的几个充分条件 ,并建立了一个有效的广播方案 .     

Conservation Laws for Single-Server Fluid Networks

We consider single-server fluid networks with feedback and arbitrary input processes. The server has to be scheduled in order to minimize a linear holding cost. This model is the fluid analogue of the so-called Klimov problem. Using the achievable-region approach, we show that the Gittins index rule is optimal in a strong sense: it minimizes the linear holding cost for arbitrary input processes and for all time points t0.     

Embedding of Biological Regulatory Networks and Property Preservation

In the course of understanding biological regulatory networks (BRN), scientists usually start by studying small BRNs that they believe to be of particular importance to represent a biological function, and then, embed them in a larger network. Such a reduction can lead to neglect relevant regulations and to study a network whose properties can be very different from the properties of this network viewed as a part of the whole. In this paper we study, from a logical point of view, on which conditions concerning both networks, properties can be inherited by BRNs from sub-BRNs. We give some conditions on the nature of the network embeddings ensuring that dynamic properties on the embedded sub-BRNs are preserved at the level of the whole BRN.     

图论在传送网工程设计中的应用探讨

利用运用图论理论这一数学工具,对传送网环网工程设计中光缆路由和业务承载问题进行了分析,通过数学建模,提出了相应的解决方法.在理论总结的基础上,结合工程实例提供了定量分析.     

Role Analysis in Networks Using Mixtures of Exponential Random Graph Models

This article introduces a novel and flexible framework for investigating the roles of actors within a network. Particular interest is in roles as defined by local network connectivity patterns, identified using the ego-networks extracted from the network. A mixture of exponential-family random graph models (ERGM) is developed for these ego-networks to cluster the nodes into roles. We refer to this model as the ego-ERGM. An expectation-maximization algorithm is developed to infer the unobserved cluster assignments and to estimate the mixture model parameters using a maximum pseudo-likelihood approximation. We demonstrate the flexibility and utility of the method using examples of simulated and real networks.     

一类具有离散时滞的基因网络的Hopf分支

研究一类具有两个时滞的二维单基因网络模型.首先得到了Hopf分支的存在性,其次利用规范型理论及中心流形定理确定了Hopf分支的方向和分支周期解的稳定性.最后,给出数值模拟.     

Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks

We consider routing in symmetrical three stage Clos networks. Especially we search for the routing of an additional connection that requires the least rearrangements, i.e. the minimal number of changes of already routed connections. We describe polynomial methods, based on matchings and edge colorings. The basic idea is to swap colors along alternating paths. The paths need to be maximal, and the shortest of these maximal paths is chosen, since it minimizes the rerouting that needs to be done. Computational tests confirm the efficiency of the approach.     

Asymptotics of Subexponential Max Plus Networks: the Stochastic Event Graph Case

We calculate the exact tail asymptotics of stationary response times for open stochastic event graphs, in the irreducible and reducible cases. These networks admit a representation as (max,?plus)-linear systems in a random medium. We study the case of renewal input and i.i.d. service times with subexponential distributions. We show that the stationary response times have tail asymptotics of the same order as the integrated tail of service times. The mutiplicative constants only involve the intensity of the arrival process and the (max,?plus)-Lyapunov exponents of the sequence of (max,?plus)-matrices.     

方格网络上用户均衡行为效率损失研究

针对用户出行时追求费用最短的路径,而不考虑其它用户如何选择路径,在一般网络中导致系统费用较高的问题,从实际出发,本文重点讨论特殊网络-方格网络上纳什均衡流与系统最优流之间的关系,研究了用户均衡行为的效率损失.研究结果表明,在方格网络上,当路阻函数是系数非负的线性函数和二次函数时,用户均衡行为的效率损失分别是0和0.35,而一般网络中用户均衡行为的效率损失分别是1/3和0.626,说明方格网络具有较好传送流量的功能.该研究为道路建设部门进行道路改造和增加新道路设计提供理论依据.     

Markov切换时滞基因调控网络的均方同步和随机无源同步北大核心CSCD

基因调控网络(GRNs)及其动力学模型的研究在后基因组时代是一个重要的研究领域.定性分析基因调控网络及其动力学对系统地认识生物体具有重要意义.该文提出了一类具有时变时滞和Markov切换的随机基因调控网络模型,研究了其均方同步和随机无源同步问题.通过设计合适的Lyapunov-Krasovskii泛函(LKF),并利用Lyapunov稳定性理论、线性矩阵不等式方法和随机分析技巧,得到了均方同步和随机无源同步的充分条件.此外,通过与其他文献进行比较,显示了该文结果的理论价值.数值模拟验证了所得充分条件的有效性.     

泛权网场结合的逻辑守恒性及其在人工神经网络中的应用

给出了泛权网场复合的几个定义,证明了泛权网场复合的一组有关逻辑守恒性的定理。结合均场模型,探讨了泛权网场在人工神经网络中的应用前景。     

准模糊图拟阵基图

在准模糊图拟阵的基础上,提出准模糊图拟阵的基图,并讨论准模糊图拟阵基图的性质和特征。     

准模糊图拟阵基图的性质

模糊拟阵的基图是模糊拟阵的基本概念.在准模糊图拟阵的基础上,讨论了准模糊图拟阵基图的一些基本性质,得到了相关的几个结论,这些结论有利于进一步研究模糊拟阵的其它性质.     

Every Graph Is an Integral Distance Graph in the Plane

We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.     

Treewidth of the Line Graph of a Complete Graph

In recent articles by Grohe and Marx, the treewidth of the line graph of a complete graph is a critical example—in a certain sense, every graph with large treewidth “contains” . However, the treewidth of was not determined exactly. We determine the exact treewidth of the line graph of a complete graph.     

K3-free图的线图的哈密顿性

设G是一个简单图，Gi G，G1在G中的度定义为d（Gt）=∑v∈v（c）d（v），其中d（v）为v在G中的度数。本文的主要结果是：设G是n≥2阶几乎无桥的简单连通K3-free图，且G≌k1,n-1、Q1和Q2，若对G中任何同构于四个顶点路的导出子图I有d（I）≥n＋2，则G有一个D-闭迹，从而G的线图L（G）是哈密顿图。