### Results for "Linyuan Lu"

total 9852took 0.10s
Spectra of edge-independent random graphsApr 27 2012Let $G$ be a random graph on the vertex set $\{1,2,..., n\}$ such that edges in $G$ are determined by independent random indicator variables, while the probability $p_{ij}$ for $\{i,j\}$ being an edge in $G$ is not assumed to be equal. Spectra of the ... More
Turan Problems on Non-uniform HypergraphsJan 09 2013A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set of edge types. ... More
Loose Laplacian spectra of random hypergraphsSep 15 2011Dec 05 2011Let $H=(V,E)$ be an $r$-uniform hypergraph with the vertex set $V$ and the edge set $E$. For $1\leq s \leq r/2$, we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s}$ as follows. Every pair of $s$-sets $I$ and $J$ is associated with a ... More
The maximum $p$-Spectral Radius of Hypergraphs with $m$ EdgesMar 23 2018For $r\geq 2$ and $p\geq 1$, the $p$-spectral radius of an $r$-uniform hypergraph $H=(V,E)$ on $n$ vertices is defined to be \rho_p(H)=\max_{{\bf x}\in \mathbb{R}^n: \|{\bf x}\|_p=1}r \cdot \!\!\!\! \sum_{\{i_1,i_2,\ldots, i_r\}\in E(H)} x_{i_1}x_{i_2}\cdots ... More
On crown-free families of subsetsJun 27 2012The crown $\Oh_{2t}$ is a height-2 poset whose Hasse diagram is a cycle of length $2t$. A family $\F$ of subsets of $[n]:=\{1,2..., n\}$ is {\em $\Oh_{2t}$-free} if $\Oh_{2t}$ is not a weak subposet of $(\F,\subseteq)$. Let $\La(n,\Oh_{2t})$ be the largest ... More
On Hypergraph Lagrangians and Frankl-Füredi's ConjectureJun 29 2018Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian, denoted by $\lambda_r(m)$, among all $r$-uniform hypergraphs of fixed size $m$ is achieved by the minimum hypergraph $C_{r,m}$ under the colexicographic order. We say $m$ in {\em principal ... More
Minimum co-degree threshold for Berge Hamiltonian cycles in hypergraphsJan 18 2019Mar 28 2019We show that for every finite set $R$ of positive integers, there is an integer $n_0=n_0(R)$ such that every $R$-uniform hypergraph $\mathcal{H}$ on $n$ ($n\geq n_0$) vertices with minimum co-degree $\delta_2(\mathcal{H})\geq 1$ contains a Berge cycle ... More
An Upper Bound on Burning Number of GraphsJun 24 2016The burning number $b(G)$ of a graph $G$ was introduced by Bonato, Janssen, and Roshanbin [Lecture Notes in Computer Science 8882 (2014)] for measuring the speed of the spread of contagion in a graph. They proved for any connected graph $G$ of order $n$, ... More
A Bound on the Spectral Radius of Hypergraphs with $e$ EdgesMay 03 2017For $r\geq 3$, let $f_r\colon [0,\infty)\to [1,\infty)$ be the unique analytic function such that $f_r({k\choose r})={k-1\choose r-1}$ for any $k\geq r-1$. We prove that the spectral radius of an $r$-uniform hypergraph $H$ with $e$ edges is at most $f_r(e)$. ... More
Strong Jumps and Lagrangians of Non-Uniform HypergraphsMar 05 2014The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems over non-uniform ... More
High-order Phase Transition in Random HypergrpahsSep 03 2014In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph on the vertex set $[n]$, where each $r$-set is an edge ... More
Minimum co-degree threshold for Berge Hamiltonian cycles in hypergraphsJan 18 2019We show that for every finite set $R$ of positive integers, there is an integer $n_0=n_0(R)$ such that every $R$-uniform hypergraph $\mathcal{H}$ on $n$ ($n\geq n_0$) vertices with minimum co-degree $\delta_2(\mathcal{H})\geq 1$ contains a Berge cycle ... More
Connected Hypergraphs with Small Spectral RadiusFeb 21 2014Mar 07 2014In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to $r$-uniform hypergraphs. ... More
On the cover Turán number of Berge hypergraphsMar 28 2019For a fixed set of positive integers $R$, we say $\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. For a graph $G=(V,E)$, a hypergraph $\mathcal{H}$ is called a Berge-$G$, denoted by $BG$, if there ... More
Diameters of Graphs with Spectral Radius at most $3/2\sqrt{2}$Dec 21 2011The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix. Woo and Neumaier discovered that a connected graph $G$ with $\rho(G)\leq 3/2{\sqrt{2}}$ is either a dagger, an open quipu, or a closed quipu. The reverse statement ... More
Link Prediction in Complex Networks: A SurveyOct 04 2010Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, ... More
Color-disjoint rainbow spanning trees of edge-colored graphsFeb 24 2018For any $t\geq 1$ and an edge-colored multigraph $G$, we show that $G$ has $t$ color-disjoint rainbow spanning trees if and only if for any partition $P$ of $V(G)$, there are at least $t(|P|-1)$ distinct colors occurring in the crossing edges of $P$. ... More
Link Prediction Based on Local Random WalkJan 14 2010The problem of missing link prediction in complex networks has attracted much attention recently. Two difficulties in link prediction are the sparsity and huge size of the target networks. Therefore, the design of an efficient and effective method is ... More
On the size-Ramsey number of tight pathsDec 08 2017For any $r\geq 2$ and $k\geq 3$, the $r$-color size-Ramsey number $\hat R(\mathcal{G},r)$ of a $k$-uniform hypergraph $\mathcal{G}$ is the smallest integer $m$ such that there exists a $k$-uniform hypergraph $\mathcal{H}$ on $m$ edges such that any coloring ... More
High-ordered Random Walks and Generalized Laplacians on HypergraphsFeb 22 2011Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated ... More
On the cover Ramsey number of Berge hypergraphsJan 25 2019For a fixed set of positive integers $R$, we say $\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. An $R$-graph $\mathcal{H}$ is \emph{covering} if every vertex pair of $\mathcal{H}$ is contained ... More
The $(p,q)$-spectral radii of $(r,s)$-directed hypergraphsApr 24 2018An $(r,s)$-directed hypergraph is a directed hypergraph with $r$ vertices in tail and $s$ vertices in head of each arc. Let $G$ be an $(r,s)$-directed hypergraph. For any real numbers $p$, $q\geq 1$, we define the $(p,q)$-spectral radius $\lambda_{p,q}(G)$ ... More
Information filtering via preferential diffusionFeb 27 2011Recommender systems have shown great potential to address information overload problem, namely to help users in finding interesting and relevant objects within a huge information space. Some physical dynamics, including heat conduction process and mass ... More
On the Turán density of $\{1, 3\}$-HypergraphsFeb 16 2018In this paper, we consider the Tur\'an problems on $\{1,3\}$-hypergraphs. We prove that a $\{1, 3\}$-hypergraph is degenerate if and only if it's $H^{\{1, 3\}}_5$-colorable, where $H^{\{1, 3\}}_5$ is a hypergraph with vertex set $V=[5]$ and edge set $E=\{\{2\}, ... More High-order Phase Transition in Random HypergrpahsSep 03 2014Aug 02 2018In this paper, we study the high-order phase transition in random$r$-uniform hypergraphs. For a positive integer$n$and a real$p\in [0,1]$, let$H:=H^r(n,p)$be the random$r$-uniform hypergraph with vertex set$[n]$, where each$r$-set is selected ... More Spectral Radius of$\{0, 1\}$-Tensor with Prescribed Number of OnesJan 09 2018For any$r$-order$\{0, 1\}$-tensor$A$with$e$ones, we prove that the spectral radius of$A$is at most$e^{\frac{r-1}{r}}$with the equality holds if and only if$e={k^r}$for some integer$k$and all ones forms a principal sub-tensor${\bf 1}_{k\times ... More
Role of Weak Ties in Link Prediction of Complex NetworksJul 10 2009Aug 14 2009Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In this paper, we use local similarity indices to estimate the likelihood of ... More
Coarse Graining for Synchronization in Directed NetworksDec 01 2010Mar 23 2011Coarse graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve the same statistical properties as well as the dynamic behaviors as the initial networks. Some methods have been ... More
The Fractional Chromatic Number of Triangle-free Graphs with $Δ\leq 3$Nov 10 2010Jul 25 2012Let $G$ be any triangle-free graph with maximum degree $\Delta\leq 3$. Staton proved that the independence number of $G$ is at least 5/14n. Heckman and Thomas conjectured that Staton's result can be strengthened into a bound on the fractional chromatic ... More
Hypergraphs with Spectral Radius at most $(r-1)!\sqrt[r]{2+\sqrt{5}}$Dec 03 2014In our previous paper, we classified all $r$-uniform hypergraphs with spectral radius at most $(r-1)!\sqrt[r]{4}$, which directly generalizes Smith's theorem for the graph case $r=2$. It is nature to ask the structures of the hypergraphs with spectral ... More
The Randic index and the diameter of graphsApr 03 2011The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is connected. Aouchiche-Hansen-Zheng ... More
Monochromatic 4-term arithmetic progressions in 2-colorings of $\mathbb Z_n$Jul 14 2011This paper is motivated by a recent result of Wolf \cite{wolf} on the minimum number of monochromatic 4-term arithmetic progressions(4-APs, for short) in $\Z_p$, where $p$ is a prime number. Wolf proved that there is a 2-coloring of $\Z_p$ with 0.000386% ... More
A note on 1-guardable graphs in the cops and robber gameApr 09 2018Apr 10 2018In the cops and robber games played on a simple graph $G$, Aigner and Fromme's lemma states that one cop can guard a shortest path in the sense that the robber cannot enter this path without getting caught after finitely many steps. In this paper, we ... More
The $α$-normal labeling method for computing the $p$-spectral radii of uniform hypergraphsMar 16 2018Let $G$ be an $r$-uniform hypergraph of order $n$. For each $p\geq 1$, the $p$-spectral radius $\lambda^{(p)}(G)$ is defined as $\lambda^{(p)}(G):=\max_{|x_1|^p+\cdots+|x_n|^p=1} r\sum_{\{i_1,\ldots,i_r\}\in E(G)}x_{i_1}\cdots x_{i_r}.$ The $p$-spectral ... More
Unavoidable Multicoloured Families of ConfigurationsSep 15 2014Sep 29 2014Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any $k$ there is a constant $f(k)$ such that any set system with at least $f(k)$ sets reduces to a $k$-star, an $k$-costar or an $k$-chain. They proved $f(k)<(2k)^{2^k}$. Here we improve ... More
Repeated columns and an old chestnutMay 03 2013Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of ${\cal F}$ ... More
Set families with forbidden subposetsAug 04 2014Let $F$ be a family of subsets of $\{1,\ldots,n\}$. We say that $F$ is $P$-free if the inclusion order on $F$ does not contain $P$ as an induced subposet. The \emph{Tur\'an function} of $P$, denoted $\pi^*(n,P)$, is the maximum size of a $P$-free family ... More
On families of subsets with a forbidden subposetJul 23 2008Let $\F\subset 2^{[n]}$ be a family of subsets of $\{1,2,..., n\}$. For any poset $H$, we say $\F$ is $H$-free if $\F$ does not contain any subposet isomorphic to $H$. Katona and others have investigated the behavior of $\La(n,H)$, which denotes the maximum ... More
A new asymptotic enumeration technique: the Lovasz Local LemmaMay 25 2009Feb 23 2014Our previous paper applied a lopsided version of the Lov\'asz Local Lemma that allows negative dependency graphs to the space of random injections from an $m$-element set to an $n$-element set. Equivalently, the same story can be told about the space ... More
Predicting Missing Links via Local InformationJan 05 2009Jun 01 2009Missing link prediction of networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known ... More
Boolean algebras and Lubell functionsJul 12 2013Let $2^{[n]}$ denote the power set of $[n]:=\{1,2,..., n\}$. A collection $\B\subset 2^{[n]}$ forms a $d$-dimensional {\em Boolean algebra} if there exist pairwise disjoint sets $X_0, X_1,..., X_d \subseteq [n]$, all non-empty with perhaps the exception ... More
Ricci-flat graphs with girth at least fiveJan 01 2013A graph is called Ricci-flat if its Ricci-curvatures vanish on all edges. Here we use the definition of Ricci-cruvature on graphs given in [Lin-Lu-Yau, Tohoku Math., 2011], which is a variation of [Ollivier, J. Funct. Math., 2009]. In this paper, we classified ... More
Graphs with Diameter $n-e$ Minimizing the Spectral RadiusOct 11 2011The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices with diameter ... More
A Fractional Analogue of Brooks' TheoremMar 17 2011Nov 13 2011Let $\Delta(G)$ be the maximum degree of a graph $G$. Brooks' theorem states that the only connected graphs with chromatic number $\chi(G)=\Delta(G)+1$ are complete graphs and odd cycles. We prove a fractional analogue of Brooks' theorem in this paper. ... More
A combinatorial identity on Galton-Watson processJun 28 2015Let $f(m,c)=\sum_{k=0}^{\infty} (km+1)^{k-1} c^k e^{-c(km+1)/m} / (m^kk!)$. For any positive integer $m$ and positive real $c$, the identity $f(m,c)=f(1,c)^{1/m}$ arises in the random graph theory. In this paper, we present two elementary proofs of this ... More
On Lagrangians of $3$-uniform hypergraphsJun 28 2018Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realized by the minimum hypergraph $C_{r,m}$ under the colexicographic order. In this paper, we prove a weaker version of the Frankl ... More
Unrolling residues to avoid progressionsSep 12 2012We consider the problem of coloring $[n]={1,2,...,n}$ with $r$ colors to minimize the number of monochromatic $k$ term arithmetic progressions (or $k$-APs for short). We show how to extend colorings of $\mathbb{Z}_m$ which avoid nontrivial $k$-APs to ... More
Scaling Laws in Human LanguageFeb 14 2012Zipf's law on word frequency is observed in English, French, Spanish, Italian, and so on, yet it does not hold for Chinese, Japanese or Korean characters. A model for writing process is proposed to explain the above difference, which takes into account ... More
Zipf's Law Leads to Heaps' Law: Analyzing Their Relation in Finite-Size SystemsFeb 20 2010May 11 2010Background: Zipf's law and Heaps' law are observed in disparate complex systems. Of particular interests, these two laws often appear together. Many theoretical models and analyses are performed to understand their co-occurrence in real systems, but it ... More
Computing Diffusion State Distance using Green's Function and Heat Kernel on GraphsOct 13 2014The diffusion state distance (DSD) was introduced by Cao-Zhang-Park-Daniels-Crovella-Cowen-Hescott [{\em PLoS ONE, 2013}] to capture functional similarity in protein-protein interaction networks. They proved the convergence of DSD for non-bipartite graphs. ... More
Effective spreading from multiple leaders identified by percolation in social networksAug 18 2015Social networks constitute a new platform for information propagation, but its success is crucially dependent on the choice of spreaders who initiate the spreading of information. In this paper, we remove edges in a network at random and the network segments ... More
Empirical analysis of web-based user-object bipartite networksSep 27 2009Dec 24 2011Understanding the structure and evolution of web-based user-object networks is a significant task since they play a crucial role in e-commerce nowadays. This Letter reports the empirical analysis on two large-scale web sites, audioscrobbler.com and del.icio.us, ... More
Duplication Models for Biological NetworksAug 31 2002Are biological networks different from other large complex networks? Both large biological and non-biological networks exhibit power-law graphs (number of nodes with degree k, N(k) ~ k-b) yet the exponents, b, fall into different ranges. This may be because ... More
The extremal $p$-spectral radius of Berge-hypergraphsDec 14 2018Dec 18 2018Let $G$ be a graph. We say that a hypergraph $H$ is a Berge-$G$ if there is a bijection $\phi: E(G)\to E(H)$ such that $e\subseteq \phi(e)$ for all $e\in E(G)$. For any $r$-uniform hypergraph $H$ and a real number $p\geq 1$, the $p$-spectral radius $\lambda^{(p)}(H)$ ... More
Perron-Frobenius Theorem for Rectangular Tensors and Directed HypergraphsApr 23 2018May 25 2018For any positive integers $r$, $s$, $m$, $n$, an $(r,s)$-order $(n,m)$-dimensional rectangular tensor ${\cal A}=(a_{i_1\cdots i_r}^{j_1\cdots j_s}) \in ({\mathbb R}^n)^r\times ({\mathbb R}^m)^s$ is called partially symmetric if it is invariant under any ... More
Similarity-Based Classification in Partially Labeled NetworksMar 03 2010We propose a similarity-based method, using the similarity between nodes, to address the problem of classification in partially labeled networks. The basic assumption is that two nodes are more likely to be categorized into the same class if they are ... More
On a hypergraph probabilistic graphical modelNov 20 2018We propose a directed acyclic hypergraph framework for a probabilistic graphical model that we call Bayesian hypergraphs. The space of directed acyclic hypergraphs is much larger than the space of chain graphs. Hence Bayesian hypergraphs can model much ... More
Kazhdan-Lusztig polynomials of fan matroids, wheel matroids and whirl matroidsFeb 11 2018The Kazhdan-Lusztig polynomial of a matroid was introduced by Elias, Proudfoot and Wakefield, whose properties need to be further explored. In this paper we prove that the Kazhdan-Lusztig polynomials of fan matroids coincide with Motzkin polynomials, ... More
Diamond-free FamiliesOct 26 2010Sep 06 2011Given a finite poset P, we consider the largest size La(n,P) of a family of subsets of $[n]:=\{1,...,n\}$ that contains no subposet P. This problem has been studied intensively in recent years, and it is conjectured that $\pi(P):= \lim_{n\rightarrow\infty} ... More Multivalued matrices and forbidden configurationsOct 01 2017An$r$-matrix is a matrix with symbols in$\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let${\cal F}$be a finite set of$r$-matrices. Let$\hbox{forb}(m,r,{\cal F})$denote the maximum number of columns possible in a simple ... More Leaders in Social Networks, the Delicious CaseMar 27 2011Finding pertinent information is not limited to search engines. Online communities can amplify the influence of a small number of power users for the benefit of all other users. Users' information foraging in depth and breadth can be greatly enhanced ... More Erratum for Ricci-flat graphs with girth at least fiveFeb 08 2018May 08 2019This erratum will correct the classification of Theorem 1 in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the Triplex graph. Enhancing topology adaptation in information-sharing social networksJul 22 2011Apr 13 2012The advent of Internet and World Wide Web has led to unprecedent growth of the information available. People usually face the information overload by following a limited number of sources which best fit their interests. It has thus become important to ... More Erratum for Ricci-flat graphs with girth at least fiveFeb 08 2018This erratum will correct the classification of Theorem 1 in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the Triplex graph. Ricci-flat cubic graphs with girth fiveFeb 08 2018We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. We use the definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Anal., 2009. A graph ... More Cohomologie des fibrés en droite sur SL3 /B en caractéristique positive : deux filtrations et conséquencesMar 20 2019Mar 22 2019In this thesis, I will prove the existence of two filtrations of the cohomology of line bundles on SL_3/B. The first one is a two-step filtration that exists for$H^1(\mu)$and$H^2(\mu)$if$\mu$is in the Griffith region. The second one exists for all ... More Cohomologie des fibrés en droite sur SL3 /B en caractéristique positive : deux filtrations et conséquencesMar 20 2019In the paper, I will prove the existence of two filtrations of the cohomology of line bundles on SL_3/B. The first one is a two-step filtration that exists for$H^1(\mu)$and$H^2(\mu)$if$\mu$is in the Griffith region. The second one exists for all ... More Cohomologie des fibrés en droites sur SL3 /B en caractéristique positive : deux filtrations et conséquencesMar 20 2019Apr 29 2019In this thesis, I will prove the existence of two filtrations of the cohomology of line bundles on SL_3/B. The first one is a two-step filtration that exists for$H^1(\mu)$and$H^2(\mu)$if$\mu$is in the Griffith region. The second one exists for all ... More The Kazhdan-Lusztig polynomials of uniform matroidsJun 28 2018The Kazhdan-Lusztig polynomial of a matroid was introduced by Elias, Proudfoot, and Wakefield [{\it Adv. Math. 2016}]. Let$U_{m,d}$denote the uniform matroid of rank$d$on a set of$m+d$elements. Gedeon, Proudfoot, and Young [{\it J. Combin. Theory ... More Efficient Image Reconstruction and Practical Decomposition for Dual-energy Computed TomographyJul 06 2016Jul 29 2016Dual-energy computed tomography (DECT) has shown great potential and promising applications in advanced imaging fields for its capabilities of material decomposition. However, image reconstructions and decompositions under sparse views dataset suffers ... More A visual encoding model based on deep neural networks and transfer learningFeb 23 2019Background: Building visual encoding models to accurately predict visual responses is a central challenge for current vision-based brain-machine interface techniques. To achieve high prediction accuracy on neural signals, visual encoding models should ... More What Does a TextCNN Learn?Jan 19 2018TextCNN, the convolutional neural network for text, is a useful deep learning algorithm for sentence classification tasks such as sentiment analysis and question classification. However, neural networks have long been known as black boxes because interpreting ... More Vital nodes identification in complex networksJul 05 2016Real networks exhibit heterogeneous nature with nodes playing far different roles in structure and function. To identify vital nodes is thus very significant, allowing us to control the outbreak of epidemics, to conduct advertisements for e-commercial ... More Category decoding of visual stimuli from human brain activity using a bidirectional recurrent neural network to simulate bidirectional information flows in human visual corticesMar 19 2019Recently, visual encoding and decoding based on functional magnetic resonance imaging (fMRI) have realized many achievements with the rapid development of deep network computation. Despite the hierarchically similar representations of deep network and ... More Adaptive beamforming method based on recursive maximum correntropy in impulsive noise with alpha-stable processDec 12 2016Feb 23 2017As a well-established adaptation criterion, the maximum correntropy criterion (MCC) has been receiving increasing attention due to its robust against outliers. In this paper, a new complex recursive maximum correntropy (CRMC) algorithm without any priori ... More A Class of Diffusion Algorithms with Logarithmic Cost over Adaptive Sparse Volterra NetworkJun 28 2016May 02 2017In this Letter, we present a novel class of diffusion algorithms that can be used to estimate the coefficients of sparse Volterra network (SVN). The development of the algorithms is based on the logarithmic cost and l0-norm constraint. Simulations for ... More An exact algorithm with the time complexity of$O^*(1.299^m)$for the weighed mutually exclusive set cover problemFeb 23 2013In this paper, we will introduce an exact algorithm with a time complexity of$O^*(1.299^m)$for the {\sc weighted mutually exclusive set cover} problem, where$m$is the number of subsets in the problem. This problem has important applications in recognizing ... More Diffusion leaky LMS algorithm: analysis and implementationFeb 13 2016Aug 08 2017The diffusion least-mean square (dLMS) algorithms have attracted much attention owing to its robustness for distributed estimation problems. However, the performance of such filters may change when they are implemented for suppressing noises from speech ... More Subband adaptive filter trained by differential evolution for channel estimationJan 29 2017Mar 17 2017The normalized subband adaptive filter (NSAF) is widely accepted as a preeminent adaptive filtering algorithm because of its efficiency under the colored excitation. However, the convergence rate of NSAF is slow. To address this drawback, in this paper, ... More A Class of Diffusion Algorithms with Logarithmic Cost over Adaptive Sparse Volterra NetworkJun 28 2016Jun 29 2016In this Letter, we present a novel class of diffusion algorithms that can be used to estimate the coefficients of sparse Volterra network. The development of the algorithms is based on the logarithmic cost and l0-norm constraint. To further overcome the ... More Diffusion leaky LMS algorithm: analysis and implementationFeb 13 2016Jul 30 2016The diffusion least-mean square (dLMS) algorithms have attracted much attention owing to its robustness for distributed estimation problems. However, the performance of such filters may change when they are implemented for suppressing noises from speech ... More An exact algorithm for the weighed mutually exclusive maximum set cover problemJan 24 2014In this paper, we introduce an exact algorithm with a time complexity of$O^*(1.325^m)$for the {\sc weighted mutually exclusive maximum set cover} problem, where$m$is the number of subsets in the problem. This is an NP-hard motivated and abstracted ... More Sequential Convex Programming Methods for A Class of Structured Nonlinear ProgrammingOct 10 2012In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in ... More Reducts of the Generalized Random Bipartite GraphJul 20 2011Let \Gamma be the generalized random bipartite graph that has two sides Rl and Rr with edges for every pair of vertices between R1 and Rr but no edges within each side, where all the edges are randomly colored by three colors P1; P2; P3. In this paper, ... More Unsupervised Learning on Neural Network Outputs: with Application in Zero-shot LearningJun 02 2015May 23 2016The outputs of a trained neural network contain much richer information than just an one-hot classifier. For example, a neural network might give an image of a dog the probability of one in a million of being a cat but it is still much larger than the ... More Geometry of Two-dimensional Self-shrinkersMay 01 2015We prove a local graphical theorem for two-dimensional self-shrinkers away from the origin. As applications, we study the asymptotic behavior of noncompact self-shrinkers with finite genus. Also, we show uniform boundedness on the second fundamental form ... More Small Amplitude Periodic Solutions of Klein-Gordon EquationsSep 19 2013Oct 14 2014We consider a class of nonlinear Klein-Gordon equations$u_{tt}=u_{xx}-u+f(u)$and obtain a family of small amplitude periodic solutions, where the temporal and spatial period have different scales. Covariate adjustment in randomization-based causal inference for 2K factorial designsJun 17 2016Jul 12 2016We develop finite-population asymptotic theory for covariate adjustment in randomization-based causal inference for 2K factorial designs. In particular, we confirm that both the unadjusted and covariate-adjusted estimators of the factorial effects are ... More On Randomization-based and Regression-based Inferences for 2^K Factorial DesignsFeb 12 2016We extend the randomization-based causal inference framework in Dasgupta et al. (2015) for general 2^K factorial designs, and demonstrate the equivalence between regression-based and randomization-based inferences. Consequently, we justify the use of ... More Discrete Polymatroids satisfying a stronger symmetric exchange propertyDec 15 2014Sep 22 2015In this paper we introduce discrete polymatroids satisfying the one-sided strong exchange property and show that they are sortable (as a consequence their base rings are Koszul) and that they satisfy White's conjecture. Since any pruned lattice path polymatroid ... More On the Erasure Robustness Property of Random MatricesFeb 03 2017The study of the restricted isometry property (RIP) for corrupted random matrices is particularly important in the field of compressed sensing (CS) with corruptions. If a matrix still satisfy RIP after a certain portion of rows are erased, then we say ... More Singularity categories of representations of quivers over local ringsFeb 05 2017Feb 20 2018Let$\Lambda$be a finite-dimensional algebra with finite global dimension,$R_k=K[X]/(X^k)$be the$\mathbb{Z}$-graded local ring with$k\geq1$, and$\Lambda_k=\Lambda\otimes_K R_k$. We consider the singularity category$D_{sg}(\mod^{\mathbb{Z}}(\Lambda_k))\$ ... More
Carleman Estimate for Stochastic Parabolic Equations and Inverse Stochastic Parabolic ProblemsJul 28 2011May 03 2013In this paper, we establish a global Carleman estimate for stochastic parabolic equations. Based on this estimate, we solve two inverse problems for stochastic parabolic equations. One is concerned with a determination problem of the history of a stochastic ... More
The Level Weighted Structural Similarity Loss: A Step Away from the MSEApr 30 2019The Mean Square Error (MSE) has shown its strength when applied in deep generative models such as Auto-Encoders to model reconstruction loss. However, in image domain especially, the limitation of MSE is obvious: it assumes pixel independence and ignores ... More
On the exact variance of Tsallis entropy in a random pure stateJul 06 2018Tsallis entropy is a useful one-parameter generalization of the standard von Neumann entropy in information theory. We study the variance of Tsallis entropy of bipartite quantum systems in a random pure state. The main result is an exact variance formula ... More
Observational Effects of Strange StarsJul 06 1998In this talk, after briefly reviewing some historical remarks concerning strange stars, the achievements in physics and dynamical behavior of strange stars are discussed. Especially, various observational effects in distinguishing strange stars from neutron ... More
New Approaches to Identify Gene-by-Gene Interactions in Genome Wide Association StudiesMay 07 2016Genetic variants identified to date by genome-wide association studies only explain a small fraction of total heritability. Gene-by-gene interaction is one important potential source of unexplained heritability. In the first part of this dissertation, ... More
GPS Information and Rate Tolerance - Clarifying Relationship between Rate Distortion and Complexity DistortionApr 17 2012I proposed rate tolerance and discussed its relation to rate distortion in my book "A Generalized Information Theory" published in 1993. Recently, I examined the structure function and the complexity distortion based on Kolmogorov's complexity theory. ... More
Practical Tera-scale Walsh-Hadamard TransformJun 28 2016Dec 24 2016In the mid-second decade of new millennium, the development of IT has reached unprecedented new heights. As one derivative of Moore's law, the operating system evolves from the initial 16 bits, 32 bits, to the ultimate 64 bits. Most modern computing platforms ... More
Effects of Data Resolution and Human Behavior on Large Scale Evacuation SimulationsDec 30 2014Traffic Analysis Zones (TAZ) based macroscopic simulation studies are mostly applied in evacuation planning and operation areas. The large size in TAZ and aggregated information of macroscopic simulation underestimate the real evacuation performance. ... More