Linyuan Lu

CoRR, 2024

Higher-Order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Assessing and improving the structural robustness of global liner shipping system: A motif-based network science approach.

[BibT_eX]

[DOI]

Reliab. Eng. Syst. Saf., December, 2023

Hyper-Null Models and Their Applications.

[BibT_eX]

[DOI]

Entropy, October, 2023

Multivalued matrices and forbidden configurations.

[BibT_eX]

[DOI]

Discret. Math., September, 2023

Cost effective approach to identify multiple influential spreaders based on the cycle structure in networks.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., September, 2023

Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs.

[BibT_eX]

[DOI]

Andrew Meier

SIAM J. Discret. Math., June, 2023

Predicting the Popularity of Information on Social Platforms without Underlying Network Structure.

[BibT_eX]

[DOI]

Entropy, June, 2023

Cooperative Network Learning for Large-Scale and Decentralized Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes.

[BibT_eX]

[DOI]

CoRR, 2023

Influential Simplices Mining via Simplicial Convolutional Network.

[BibT_eX]

[DOI]

CoRR, 2023

Higher-order link prediction via local information.

[BibT_eX]

[DOI]

Bo Liu

Rongmei Yang

CoRR, 2023

Identifying vital nodes through augmented random walks on higher-order networks.

[BibT_eX]

[DOI]

CoRR, 2023

TransformerLight: A Novel Sequence Modeling Based Traffic Signaling Mechanism via Gated Transformer.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022

The simple regularities in the dynamics of online news impact.

[BibT_eX]

[DOI]

J. Comput. Soc. Sci., May, 2022

Poset Ramsey Numbers for Boolean Lattices.

[BibT_eX]

[DOI]

Joshua C. Thompson

Order, 2022

Maximum spectral radius of outerplanar 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Mark N. Ellingham

J. Graph Theory, 2022

Kazhdan-Lusztig polynomials of fan matroids, wheel matroids, and whirl matroids.

[BibT_eX]

[DOI]

Matthew H. Y. Xie

Arthur L. B. Yang

J. Comb. Theory, Ser. A, 2022

Toward Detecting Previously Undiscovered Interaction Types in Networked Systems.

[BibT_eX]

[DOI]

Wenjie Jia

Yueyue Dai

Tao Jiang

IEEE Internet Things J., 2022

DynamicLight: Dynamically Tuning Traffic Signal Duration with DRL.

[BibT_eX]

[DOI]

CoRR, 2022

Local dominance unveils clusters in networks.

[BibT_eX]

[DOI]

CoRR, 2022

Forecasting countries' gross domestic product from patent data.

[BibT_eX]

[DOI]

Yucheng Ye

CoRR, 2022

Mean field information Hessian matrices on graphs.

[BibT_eX]

[DOI]

Wuchen Li

CoRR, 2022

Expression might be enough: representing pressure and demand for reinforcement learning based traffic signal control.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Evaluating Performances and Importance of Venture Capitals: A Complex Network Approach.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2021

Exploring Impact Factors of Risk Contagion in Venture Capital Markets: A Complex Network Approach.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2021

The local structure of citation networks uncovers expert-selected milestone papers.

[BibT_eX]

[DOI]

Jingjing Wang

J. Informetrics, 2021

On the cover Turán number of Berge hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

On Hamiltonian Berge cycles in [3]-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Fang Zhou

Jianguo Liu

CoRR, 2021

Efficient Pressure: Improving efficiency for signalized intersections.

[BibT_eX]

[DOI]

CoRR, 2021

Hyperparameter-free and Explainable Whole Graph Embedding.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Shuliang Bai

Electron. J. Comb., 2021

The Kazhdan-Lusztig polynomials of uniform matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

Deep Collaborative Filtering for Prediction of Disease Genes.

[BibT_eX]

[DOI]

Alfonso Rodríguez-Patón

IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data.

[BibT_eX]

[DOI]

J. Informetrics, 2020

Recommending investors for new startups by integrating network diffusion and investors' domain preference.

[BibT_eX]

[DOI]

Qian-Ming Zhang

Inf. Sci., 2020

On the cover Ramsey number of Berge hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

The fragility of opinion formation in a complex world.

[BibT_eX]

[DOI]

CoRR, 2020

Network-based ranking in social systems: three challenges.

[BibT_eX]

[DOI]

CoRR, 2020

Characterizing cycle structure in complex networks.

[BibT_eX]

[DOI]

CoRR, 2020

Universal patterns of online news impact.

[BibT_eX]

[DOI]

CoRR, 2020

On a hypergraph probabilistic graphical model.

[BibT_eX]

[DOI]

Mohammad Ali Javidian

Marco Valtorta

Ann. Math. Artif. Intell., 2020

2019

The long-term impact of ranking algorithms in growing networks.

[BibT_eX]

[DOI]

Shilun Zhang

Inf. Sci., 2019

Totally Homogeneous Networks.

[BibT_eX]

[DOI]

Dinghua Shi

Guanrong Chen

CoRR, 2019

On the Turán Density of {1, 3}-Hypergraphs.

[BibT_eX]

[DOI]

Shuliang Bai

Electron. J. Comb., 2019

Fast influencers in complex networks.

[BibT_eX]

[DOI]

Fang Zhou

Commun. Nonlinear Sci. Numer. Simul., 2019

2018

On the Size-Ramsey Number of Tight Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Link Prediction in Bipartite Nested Networks.

[BibT_eX]

[DOI]

Entropy, 2018

Eliminating the Effect of Rating Bias on Reputation Systems.

[BibT_eX]

[DOI]

Complex., 2018

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

[BibT_eX]

[DOI]

Bioinform., 2018

2017

A general and effective diffusion-based recommendation scheme on coupled social networks.

[BibT_eX]

[DOI]

Inf. Sci., 2017

Triangle-mapping analysis on spatial competition and cooperation of Chinese cities.

[BibT_eX]

[DOI]

Pan Liu

Xiao-Pu Han

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2016

Graphon-Inspired Analysis on the Fluctuation of the Chinese Stock Market.

[BibT_eX]

[DOI]

Arthur L. B. Yang

James J. Y. Zhao

Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

An Upper Bound on the Burning Number of Graphs.

[BibT_eX]

[DOI]

Max R. Land

Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015

Set families with forbidden subposets.

[BibT_eX]

[DOI]

Kevin G. Milans

J. Comb. Theory, Ser. A, 2015

Boolean algebras and Lubell functions.

[BibT_eX]

[DOI]

J. Travis Johnston

Kevin G. Milans

J. Comb. Theory, Ser. A, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

2014

On crown-free families of subsets.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Turán Problems on Non-Uniform Hypergraphs.

[BibT_eX]

[DOI]

J. Travis Johnston

Electron. J. Comb., 2014

Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2013

High-Order Random Walks and Generalized Laplacians on Hypergraphs.

[BibT_eX]

[DOI]

Internet Math., 2013

Identifying Influential Spreaders by Weighted LeaderRank.

[BibT_eX]

[DOI]

CoRR, 2013

Spectra of Edge-Independent Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Repeated Columns and an Old Chestnut.

[BibT_eX]

[DOI]

Richard P. Anstee

Electron. J. Comb., 2013

2012

A Fractional Analogue of Brooks' Theorem.

[BibT_eX]

[DOI]

Andrew D. King

SIAM J. Discret. Math., 2012

Loose laplacian spectra of random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

On Meyniel's conjecture of the cop number.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Diameter of random spanning trees in a given graph.

[BibT_eX]

[DOI]

Paul Horn

J. Graph Theory, 2012

Monochromatic 4-term arithmetic progressions in 2-colorings of Zn.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

Diamond-free families.

[BibT_eX]

[DOI]

Jerrold R. Griggs

Wei-Tian Li

J. Comb. Theory, Ser. A, 2012

The fractional chromatic number of triangle-free graphs with Δ<3.

[BibT_eX]

[DOI]

Discret. Math., 2012

Scaling Laws in Human Language

[BibT_eX]

[DOI]

Zi-Ke Zhang

CoRR, 2012

Potential Theory for Directed Networks

[BibT_eX]

[DOI]

CoRR, 2012

Recommender Systems

[BibT_eX]

[DOI]

CoRR, 2012

Recommendation of Leaders in Online Social Systems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems - 20th International Symposium, 2012

2011

Graphs with Asymptotically Invariant Degree Sequences under Restriction.

[BibT_eX]

[DOI]

Joshua N. Cooper

Internet Math., 2011

The Randić index and the diameter of graphs.

[BibT_eX]

[DOI]

Yiting Yang

Discret. Math., 2011

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

[BibT_eX]

[DOI]

Yan-Bo Zhou

Menghui Li

CoRR, 2011

Adaptive topology evolution in information-sharing social networks

[BibT_eX]

[DOI]

CoRR, 2011

Small world yields the most effective information spreading

[BibT_eX]

[DOI]

Duanbing Chen

CoRR, 2011

Reconstructing directed networks for better synchronization

[BibT_eX]

[DOI]

An Zeng

CoRR, 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Uncovering missing links with cold ends

[BibT_eX]

[DOI]

CoRR, 2011

Leaders in Social Networks, the Delicious Case

[BibT_eX]

[DOI]

CoRR, 2011

Information filtering via preferential diffusion

[BibT_eX]

[DOI]

Weiping Liu

CoRR, 2011

High-Ordered Random Walks and Generalized Laplacians on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

2010

A Lower Bound on the Transposition Diameter.

[BibT_eX]

[DOI]

Yiting Yang

SIAM J. Discret. Math., 2010

Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes.

[BibT_eX]

[DOI]

Wei-Tian Li

Yiting Yang

SIAM J. Discret. Math., 2010

Efficient Topology-aware Coarse Graining for Synchronization in Directed Networks

[BibT_eX]

[DOI]

An Zeng

CoRR, 2010

Link Prediction in Complex Networks: A Survey

[BibT_eX]

[DOI]

CoRR, 2010

2009

An Exact Result for Hypergraphs and Upper Bounds for the Tur[a-acute]n Density of Krr+1.

[BibT_eX]

[DOI]

Yi Zhao

SIAM J. Discret. Math., 2009

Percolation in General Graphs.

[BibT_eX]

[DOI]

Paul Horn

Internet Math., 2009

On Families of Subsets With a Forbidden Subposet.

[BibT_eX]

[DOI]

Jerrold R. Griggs

Comb. Probab. Comput., 2009

Empirical analysis of web-based user-object bipartite networks

[BibT_eX]

[DOI]

CoRR, 2009

The Giant Component in a Random Subgraph of a Given Graph.

[BibT_eX]

[DOI]

Fan Chung Graham

Paul Horn

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

Role of weak ties in link prediction of complex networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

2007

Using Lovász Local Lemma in the Space of Random Injections.

[BibT_eX]

[DOI]

László A. Székely

Electron. J. Comb., 2007

Drawing Power Law Graphs Using a Local/Global Decomposition.

[BibT_eX]

[DOI]

Reid Andersen

Algorithmica, 2007

No-Three-in-Line-in-3D.

[BibT_eX]

[DOI]

Reid Andersen

Algorithmica, 2007

2006

The Volume of the Giant Component of a Random Graph with Given Expected Degrees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

2005

Modeling the Small-World Phenomenon with Local Network Flow.

[BibT_eX]

[DOI]

Reid Andersen

Internet Math., 2005

2003

Duplication Models for Biological Networks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

The Spectra of Random Graphs with Given Expected Degrees.

[BibT_eX]

[DOI]

Van H. Vu

Internet Math., 2003

Coupling Online and Offline Analyses for Random Power Law Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

The Average Distance in a Random Graph with Given Expected Degrees.

[BibT_eX]

[DOI]

Internet Math., 2003

Guessing Secrets with Inner Product Questions.

[BibT_eX]

[DOI]

Ronald L. Graham

Internet Math., 2003

Tolerating denial-of-service attacks using overlay networks: impact of topology.

[BibT_eX]

[DOI]

Ju Wang

Andrew A. Chien

Proceedings of the 2003 ACM Workshop on Survivable and Self-Regenerative Systems, 2003

2001

A Random Graph Model for Power Law Graphs.

[BibT_eX]

[DOI]

William Aiello

Fan Chung Graham

Exp. Math., 2001

The Diameter of Sparse Random Graphs.

[BibT_eX]

[DOI]

Fan Chung

Adv. Appl. Math., 2001

The diameter of random massive graphs.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Random Evolution in Massive Graphs.

[BibT_eX]

[DOI]

William Aiello

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

A random graph model for massive graphs.

[BibT_eX]

[DOI]

William Aiello

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).

[BibT_eX]

[DOI]