Linyuan Lu

According to our database1, Linyuan Lu authored at least 97 papers between 1999 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Mean field information Hessian matrices on graphs.
CoRR, 2022

2021
Evaluating Performances and Importance of Venture Capitals: A Complex Network Approach.
IEEE Trans. Circuits Syst. I Regul. Pap., 2021

Exploring Impact Factors of Risk Contagion in Venture Capital Markets: A Complex Network Approach.
IEEE Trans. Circuits Syst. I Regul. Pap., 2021

The local structure of citation networks uncovers expert-selected milestone papers.
J. Informetrics, 2021

On the cover Turán number of Berge hypergraphs.
Eur. J. Comb., 2021

On Hamiltonian Berge cycles in [3]-uniform hypergraphs.
Discret. Math., 2021

Expression is enough: Improving traffic signal control with advanced traffic state representation.
CoRR, 2021

Predicting peer-to-peer and collective social contagion from individual behaviour.
CoRR, 2021

Efficient Pressure: Improving efficiency for signalized intersections.
CoRR, 2021

Hyperparameter-free and Explainable Whole Graph Embedding.
CoRR, 2021

Citations or dollars? Early signals of a firm's research success.
CoRR, 2021

Turán Density of $2$-Edge-Colored Bipartite Graphs with Application on $\{2, 3\}$-Hypergraphs.
Electron. J. Comb., 2021

The Kazhdan-Lusztig polynomials of uniform matroids.
Adv. Appl. Math., 2021

2020
Deep Collaborative Filtering for Prediction of Disease Genes.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees.
SIAM J. Discret. Math., 2020

Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data.
J. Informetrics, 2020

Recommending investors for new startups by integrating network diffusion and investors' domain preference.
Inf. Sci., 2020

On the cover Ramsey number of Berge hypergraphs.
Discret. Math., 2020

The fragility of opinion formation in a complex world.
CoRR, 2020

Network-based ranking in social systems: three challenges.
CoRR, 2020

Characterizing cycle structure in complex networks.
CoRR, 2020

Universal patterns of online news impact.
CoRR, 2020

On a hypergraph probabilistic graphical model.
Ann. Math. Artif. Intell., 2020

2019
The long-term impact of ranking algorithms in growing networks.
Inf. Sci., 2019

Totally Homogeneous Networks.
CoRR, 2019

On the Turán Density of {1, 3}-Hypergraphs.
Electron. J. Comb., 2019

Fast influencers in complex networks.
Commun. Nonlinear Sci. Numer. Simul., 2019

2018
On the Size-Ramsey Number of Tight Paths.
SIAM J. Discret. Math., 2018

Link Prediction in Bipartite Nested Networks.
Entropy, 2018

Eliminating the Effect of Rating Bias on Reputation Systems.
Complex., 2018

Prediction of potential disease-associated microRNAs using structural perturbation method.
Bioinform., 2018

2017
A general and effective diffusion-based recommendation scheme on coupled social networks.
Inf. Sci., 2017

Triangle-mapping analysis on spatial competition and cooperation of Chinese cities.
Proceedings of the IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society, Beijing, China, October 29, 2017

Inferring users' preferences through leveraging their social relationships.
Proceedings of the IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society, Beijing, China, October 29, 2017

2016
Vital nodes identification in complex networks.
CoRR, 2016

Graphon-Inspired Analysis on the Fluctuation of the Chinese Stock Market.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

An Upper Bound on the Burning Number of Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015
Set families with forbidden subposets.
J. Comb. Theory, Ser. A, 2015

Boolean algebras and Lubell functions.
J. Comb. Theory, Ser. A, 2015

Effective spreading from multiple leaders identified by percolation in social networks.
CoRR, 2015

2014
On crown-free families of subsets.
J. Comb. Theory, Ser. A, 2014

Empirical studies on the network of social groups: the case of Tencent QQ.
CoRR, 2014

Turán Problems on Non-Uniform Hypergraphs.
Electron. J. Comb., 2014

Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2013
High-Order Random Walks and Generalized Laplacians on Hypergraphs.
Internet Math., 2013

Identifying Influential Spreaders by Weighted LeaderRank.
CoRR, 2013

Spectra of Edge-Independent Random Graphs.
Electron. J. Comb., 2013

Repeated Columns and an Old Chestnut.
Electron. J. Comb., 2013

2012
A Fractional Analogue of Brooks' Theorem.
SIAM J. Discret. Math., 2012

Loose laplacian spectra of random hypergraphs.
Random Struct. Algorithms, 2012

On Meyniel's conjecture of the cop number.
J. Graph Theory, 2012

Diameter of random spanning trees in a given graph.
J. Graph Theory, 2012

Monochromatic 4-term arithmetic progressions in 2-colorings of Z<sub>n</sub>.
J. Comb. Theory, Ser. A, 2012

Diamond-free families.
J. Comb. Theory, Ser. A, 2012

The fractional chromatic number of triangle-free graphs with Δ<3.
Discret. Math., 2012

Scaling Laws in Human Language
CoRR, 2012

Potential Theory for Directed Networks
CoRR, 2012

Recommender Systems
CoRR, 2012

Recommendation of Leaders in Online Social Systems.
Proceedings of the Foundations of Intelligent Systems - 20th International Symposium, 2012

2011
Graphs with Asymptotically Invariant Degree Sequences under Restriction.
Internet Math., 2011

The Randić index and the diameter of graphs.
Discret. Math., 2011

Quantifying the influence of scientists and their publications: Distinguish prestige from popularity
CoRR, 2011

Adaptive topology evolution in information-sharing social networks
CoRR, 2011

Small world yields the most effective information spreading
CoRR, 2011

Reconstructing directed networks for better synchronization
CoRR, 2011

Link prediction in complex networks: a local naïve Bayes model
CoRR, 2011

Uncovering missing links with cold ends
CoRR, 2011

Leaders in Social Networks, the Delicious Case
CoRR, 2011

Information filtering via preferential diffusion
CoRR, 2011

High-Ordered Random Walks and Generalized Laplacians on Hypergraphs.
Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

2010
A Lower Bound on the Transposition Diameter.
SIAM J. Discret. Math., 2010

Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes.
SIAM J. Discret. Math., 2010

Efficient Topology-aware Coarse Graining for Synchronization in Directed Networks
CoRR, 2010

Link Prediction in Complex Networks: A Survey
CoRR, 2010

2009
An Exact Result for Hypergraphs and Upper Bounds for the Tur[a-acute]n Density of K<sup>r<sub>r+1</sub></sup>.
SIAM J. Discret. Math., 2009

Percolation in General Graphs.
Internet Math., 2009

On Families of Subsets With a Forbidden Subposet.
Comb. Probab. Comput., 2009

Empirical analysis of web-based user-object bipartite networks
CoRR, 2009

The Giant Component in a Random Subgraph of a Given Graph.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

Role of weak ties in link prediction of complex networks.
Proceedings of the Proceeding of the ACM First International Workshop on Complex Networks Meet Information & Knowledge Management, 2009

2008
Explicit Construction of Small Folkman Graphs.
SIAM J. Discret. Math., 2008

2007
Using Lovász Local Lemma in the Space of Random Injections.
Electron. J. Comb., 2007

Drawing Power Law Graphs Using a Local/Global Decomposition.
Algorithmica, 2007

No-Three-in-Line-in-3D.
Algorithmica, 2007

2006
The Volume of the Giant Component of a Random Graph with Given Expected Degrees.
SIAM J. Discret. Math., 2006

2005
Modeling the Small-World Phenomenon with Local Network Flow.
Internet Math., 2005

2003
Duplication Models for Biological Networks.
J. Comput. Biol., 2003

The Spectra of Random Graphs with Given Expected Degrees.
Internet Math., 2003

Coupling Online and Offline Analyses for Random Power Law Graphs.
Internet Math., 2003

The Average Distance in a Random Graph with Given Expected Degrees.
Internet Math., 2003

Guessing Secrets with Inner Product Questions.
Internet Math., 2003

2001
A Random Graph Model for Power Law Graphs.
Exp. Math., 2001

The Diameter of Sparse Random Graphs.
Adv. Appl. Math., 2001

The diameter of random massive graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Random Evolution in Massive Graphs.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
A random graph model for massive graphs.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
An Upper Bound for the Turán Number t3(n,4).
J. Comb. Theory, Ser. A, 1999


  Loading...